Search Results

Documents authored by Safro, Ilya

Document
DOI: 10.4230/DagRep.13.12.1
Scalable Graph Mining and Learning (Dagstuhl Seminar 23491)

Authors: Danai Koutra, Henning Meyerhenke, Ilya Safro, and Fabian Brandt-Tumescheit

Published in: Dagstuhl Reports, Volume 13, Issue 12 (2024)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23491 "Scalable Graph Mining and Learning". The event brought together leading researchers and practitioners to discuss cutting-edge developments in graph machine learning, massive-scale graph analytics frameworks, and optimization techniques for graph processing. Besides the executive summary, the report contains abstracts of the 18 scientific talks presented, descriptions of three open problems, and preliminary results of three working groups formed during the seminar. In summary, the seminar successfully fostered discussions that bridged theoretical research and practical applications in scalable graph learning, mining, and analytics. Several potential outcomes include writing position and research papers as well as joint grant submissions.
Cite as

Danai Koutra, Henning Meyerhenke, Ilya Safro, and Fabian Brandt-Tumescheit. Scalable Graph Mining and Learning (Dagstuhl Seminar 23491). In Dagstuhl Reports, Volume 13, Issue 12, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{koutra_et_al:DagRep.13.12.1,
  author =	{Koutra, Danai and Meyerhenke, Henning and Safro, Ilya and Brandt-Tumescheit, Fabian},
  title =	{{Scalable Graph Mining and Learning (Dagstuhl Seminar 23491)}},
  pages =	{1--23},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{13},
  number =	{12},
  editor =	{Koutra, Danai and Meyerhenke, Henning and Safro, Ilya and Brandt-Tumescheit, Fabian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.12.1},
  URN =		{urn:nbn:de:0030-drops-198530},
  doi =		{10.4230/DagRep.13.12.1},
  annote =	{Keywords: Graph mining, Graph machine learning, (hyper)graph and network algorithms, high-performance computing for graphs, algorithm engineering for graphs}
}
Document
DOI: 10.4230/DagRep.13.8.1
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)

Authors: George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, and Albert-Jan Yzelman

Published in: Dagstuhl Reports, Volume 13, Issue 8 (2024)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23331 "Recent Trends in Graph Decomposition", which took place from 13. August to 18. August, 2023. The seminar brought together 33 experts from academia and industry to discuss graph decomposition, a pivotal technique for handling massive graphs in applications such as social networks and scientific simulations. The seminar addressed the challenges posed by contemporary hardware designs, the potential of deep neural networks and reinforcement learning in developing heuristics, the unique optimization requirements of large sparse data, and the need for scalable algorithms suitable for emerging architectures. Through presentations, discussions, and collaborative sessions, the event fostered an exchange of innovative ideas, leading to the creation of community notes highlighting key open problems in the field.
Cite as

George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, and Albert-Jan Yzelman. Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). In Dagstuhl Reports, Volume 13, Issue 8, pp. 1-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{karypis_et_al:DagRep.13.8.1,
  author =	{Karypis, George and Schulz, Christian and Strash, Darren and Ajwani, Deepak and Bisseling, Rob H. and Casel, Katrin and \c{C}ataly\"{u}rek, \"{U}mit V. and Chevalier, C\'{e}dric and Chudigiewitsch, Florian and Faraj, Marcelo Fonseca and Fellows, Michael and Gottesb\"{u}ren, Lars and Heuer, Tobias and Kaya, Kamer and Lacki, Jakub and Langguth, Johannes and Li, Xiaoye Sherry and Mayer, Ruben and Meintrup, Johannes and Mizutani, Yosuke and Pellegrini, Fran\c{c}ois and Petrini, Fabrizio and Rosamond, Frances and Safro, Ilya and Schlag, Sebastian and Sharma, Roohani and Sullivan, Blair D. and U\c{c}ar, Bora and Yzelman, Albert-Jan},
  title =	{{Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)}},
  pages =	{1--45},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{13},
  number =	{8},
  editor =	{Karypis, George and Schulz, Christian and Strash, Darren},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.8.1},
  URN =		{urn:nbn:de:0030-drops-198114},
  doi =		{10.4230/DagRep.13.8.1},
  annote =	{Keywords: combinatorial optimization, experimental algorithmics, parallel algorithms}
}
Document
DOI: 10.4230/DagRep.8.6.19
High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

Authors: Henning Meyerhenke, Richard Peng, and Ilya Safro

Published in: Dagstuhl Reports, Volume 8, Issue 6 (2019)

Abstract
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Algorithms''. The seminar reflected the ongoing qualitative change how graph algorithms are used in practice due to (i) the complex structure of graphs in new and emerging applications, (ii) the size of typical inputs, and (iii) the computer systems with which graph problems are solved. This change is having a tremendous impact on the field of graph algorithms in terms of algorithm theory and implementation as well as hardware requirements and application areas. The seminar covered recent advances in all these aspects, trying to balance and mediate between theory and practice. The abstracts included in this report contain and survey recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications, both from a theoretical and a practical point of view.
Cite as

Henning Meyerhenke, Richard Peng, and Ilya Safro. High-Performance Graph Algorithms (Dagstuhl Seminar 18241). In Dagstuhl Reports, Volume 8, Issue 6, pp. 19-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{meyerhenke_et_al:DagRep.8.6.19,
  author =	{Meyerhenke, Henning and Peng, Richard and Safro, Ilya},
  title =	{{High-Performance Graph Algorithms (Dagstuhl Seminar 18241)}},
  pages =	{19--39},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{6},
  editor =	{Meyerhenke, Henning and Peng, Richard and Safro, Ilya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.6.19},
  URN =		{urn:nbn:de:0030-drops-100475},
  doi =		{10.4230/DagRep.8.6.19},
  annote =	{Keywords: algorithm engineering, combinatorial scientific computing, graph algorithms, high-performance computing, theoretical computer science}
}
Document
DOI: 10.4230/LIPIcs.SEA.2018.2
Aggregative Coarsening for Multilevel Hypergraph Partitioning

Authors: Ruslan Shaydulin and Ilya Safro

Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)

Abstract
Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening schemes and incorporate them within state-of-the-art hypergraph partitioner Zoltan. Our coarsening schemes are inspired by the algebraic multigrid and stable matching approaches. We demonstrate the effectiveness of the developed schemes as a part of multilevel hypergraph partitioning framework on a wide range of problems.
Cite as

Ruslan Shaydulin and Ilya Safro. Aggregative Coarsening for Multilevel Hypergraph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{shaydulin_et_al:LIPIcs.SEA.2018.2,
  author =	{Shaydulin, Ruslan and Safro, Ilya},
  title =	{{Aggregative Coarsening for Multilevel Hypergraph Partitioning}},
  booktitle =	{17th International Symposium on Experimental Algorithms (SEA 2018)},
  pages =	{2:1--2:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{D'Angelo, Gianlorenzo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.2},
  URN =		{urn:nbn:de:0030-drops-89371},
  doi =		{10.4230/LIPIcs.SEA.2018.2},
  annote =	{Keywords: hypergraph partitioning, multilevel algorithms, coarsening, matching, combinatorial scientific computing}
}
Document
DOI: 10.4230/DagRep.4.11.40
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)

Authors: Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, and Ilya Safro

Published in: Dagstuhl Reports, Volume 4, Issue 11 (2015)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Graph Algorithms and Applications in Computational Science". The seminar reflected the recent qualitative change how graph algorithms are used in practice due to (i) the complex structure of graphs in new and emerging applications, (ii) the size of typical inputs, and (iii) the computer systems on which graph problems are solved. This change is having a tremendous impact on the field of graph algorithms in terms of algorithm theory and implementation as well as hardware requirements and application areas. The seminar covered recent advances in all these aspects with a focus on practical algorithms and their efficient implementation for large-scale problems. The abstracts included in this report contain recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications.
Cite as

Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, and Ilya Safro. High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). In Dagstuhl Reports, Volume 4, Issue 11, pp. 40-58, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{meyer_et_al:DagRep.4.11.40,
  author =	{Meyer, Ulrich Carsten and Meyerhenke, Henning and Pinar, Ali and Safro, Ilya},
  title =	{{High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)}},
  pages =	{40--58},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Meyer, Ulrich Carsten and Meyerhenke, Henning and Pinar, Ali and Safro, Ilya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.40},
  URN =		{urn:nbn:de:0030-drops-49697},
  doi =		{10.4230/DagRep.4.11.40},
  annote =	{Keywords: graphs, graph algorithms, graph theory, computational science, complex networks, network science, graph partitioning, linear algebra, parallel program}
}
Document
DOI: 10.4230/DagSemProc.09061.15
Randomized Heuristics for Exploiting Jacobian Scarcity

Authors: Andrew Lyons and Ilya Safro

Published in: Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009)

Abstract
Griewank and Vogel introduced the notion of Jacobian scarcity, which generalizes the properties of sparsity and rank to capture a kind of deficiency in the degrees of freedom of the Jacobian matrix $F'(mathbf{x}).$ We describe new randomized heuristics that exploit scarcity for the optimized evaluation of collections of Jacobian-vector or Jacobian-transpose-vector products.
Cite as

Andrew Lyons and Ilya Safro. Randomized Heuristics for Exploiting Jacobian Scarcity. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{lyons_et_al:DagSemProc.09061.15,
  author =	{Lyons, Andrew and Safro, Ilya},
  title =	{{Randomized Heuristics for Exploiting Jacobian Scarcity}},
  booktitle =	{Combinatorial Scientific Computing},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9061},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.15},
  URN =		{urn:nbn:de:0030-drops-20868},
  doi =		{10.4230/DagSemProc.09061.15},
  annote =	{Keywords: Jacobian, scarcity, accumulation, directed acyclic graph}
}
Document
DOI: 10.4230/DagSemProc.09061.21
Weighted aggregation for multi-level graph partitioning

Authors: Cédric Chevalier and Ilya Safro

Published in: Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009)

Abstract
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a practical tool to solve this problem. A multilevel algorithm may be viewed as a process of graph topology learning at different scales in order to generate a better approximation for any approximation method incorporated at the uncoarsening stage in the framework. In this work we compare two multilevel frameworks based on the geometric and the algebraic multigrid schemes for the partitioning problem.
Cite as

Cédric Chevalier and Ilya Safro. Weighted aggregation for multi-level graph partitioning. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{chevalier_et_al:DagSemProc.09061.21,
  author =	{Chevalier, C\'{e}dric and Safro, Ilya},
  title =	{{Weighted aggregation for multi-level graph partitioning}},
  booktitle =	{Combinatorial Scientific Computing},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9061},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.21},
  URN =		{urn:nbn:de:0030-drops-20820},
  doi =		{10.4230/DagSemProc.09061.21},
  annote =	{Keywords: Graph partitioning, multilevel, coarsening, weighted aggregation}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact