| No. |
Title |
Author |
Year |
| 1 |
Front Matter, Table of Contents, Preface, Conference Organization |
Leroux, Jérôme et al. |
2023 |
| 2 |
LIPIcs, Volume 272, MFCS 2023, Complete Volume |
Leroux, Jérôme et al. |
2023 |
| 3 |
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm |
Dufoulon, Fabien et al. |
2022 |
| 4 |
Graph Realization of Distance Sets |
Bar-Noy, Amotz et al. |
2022 |
| 5 |
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper) |
Bar-Noy, Amotz et al. |
2022 |
| 6 |
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph |
Bar-Noy, Amotz et al. |
2022 |
| 7 |
Budgeted Dominating Sets in Uncertain Graphs |
Choudhary, Keerti et al. |
2021 |
| 8 |
Selected Neighbor Degree Forest Realization |
Bar-Noy, Amotz et al. |
2021 |
| 9 |
Singularly Near Optimal Leader Election in Asynchronous Networks |
Kutten, Shay et al. |
2021 |
| 10 |
Graph Realizations: Maximum Degree in Vertex Neighborhoods |
Bar-Noy, Amotz et al. |
2020 |
| 11 |
Minimum Neighboring Degree Realization in Graphs and Trees |
Bar-Noy, Amotz et al. |
2020 |
| 12 |
Singularly Optimal Randomized Leader Election |
Kutten, Shay et al. |
2020 |
| 13 |
Efficiently Realizing Interval Sequences |
Bar-Noy, Amotz et al. |
2019 |
| 14 |
The Generalized Microscopic Image Reconstruction Problem |
Bar-Noy, Amotz et al. |
2019 |
| 15 |
Tight Bounds For Distributed MST Verification |
Kor, Liah et al. |
2011 |
| 16 |
Relaxed Spanners for Directed Disk Graphs |
Peleg, David et al. |
2010 |
| 17 |
Robust Fault Tolerant Uncapacitated Facility Location |
Chechik, Shiri et al. |
2010 |
