Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner. On the Uncrossed Number of Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 18:1-18:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balko_et_al:LIPIcs.GD.2024.18, author = {Balko, Martin and Hlin\v{e}n\'{y}, Petr and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Orthaber, Joachim and Vogtenhuber, Birgit and Wagner, Mirko H.}, title = {{On the Uncrossed Number of Graphs}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {18:1--18:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.18}, URN = {urn:nbn:de:0030-drops-213028}, doi = {10.4230/LIPIcs.GD.2024.18}, annote = {Keywords: Uncrossed Number, Crossing Number, Planarity, Thickness} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Kaya Alpturer, Joseph Y. Halpern, and Ron van der Meyden. A Knowledge-Based Analysis of Intersection Protocols. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{alpturer_et_al:LIPIcs.DISC.2024.2, author = {Alpturer, Kaya and Halpern, Joseph Y. and van der Meyden, Ron}, title = {{A Knowledge-Based Analysis of Intersection Protocols}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.2}, URN = {urn:nbn:de:0030-drops-212291}, doi = {10.4230/LIPIcs.DISC.2024.2}, annote = {Keywords: Intersection management, Autonomous vehicles, Distributed algorithms, Epistemic logic, Fault tolerance} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Laxman Dhulipala, Michael Dinitz, Jakub Łącki, and Slobodan Mitrović. Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 19:1-19:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dhulipala_et_al:LIPIcs.DISC.2024.19, author = {Dhulipala, Laxman and Dinitz, Michael and {\L}\k{a}cki, Jakub and Mitrovi\'{c}, Slobodan}, title = {{Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {19:1--19:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.19}, URN = {urn:nbn:de:0030-drops-212453}, doi = {10.4230/LIPIcs.DISC.2024.19}, annote = {Keywords: approximate maximum matching, set cover, hypergraph matching, PRAM, massively parallel computation} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Jeff Giliberti and Zahra Parsaeian. Massively Parallel Ruling Set Made Deterministic. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 29:1-29:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{giliberti_et_al:LIPIcs.DISC.2024.29, author = {Giliberti, Jeff and Parsaeian, Zahra}, title = {{Massively Parallel Ruling Set Made Deterministic}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {29:1--29:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.29}, URN = {urn:nbn:de:0030-drops-212551}, doi = {10.4230/LIPIcs.DISC.2024.29}, annote = {Keywords: deterministic algorithms, distributed computing, massively parallel computation, graph algorithms, derandomization} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Gruia Călinescu, Sami Davies, Samir Khuller, and Shirley Zhang. Online Flexible Busy Time Scheduling on Heterogeneous Machines. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 37:1-37:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{calinescu_et_al:LIPIcs.ESA.2024.37, author = {C\u{a}linescu, Gruia and Davies, Sami and Khuller, Samir and Zhang, Shirley}, title = {{Online Flexible Busy Time Scheduling on Heterogeneous Machines}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {37:1--37:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.37}, URN = {urn:nbn:de:0030-drops-211083}, doi = {10.4230/LIPIcs.ESA.2024.37}, annote = {Keywords: Online algorithms, Scheduling, Competitive analysis} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Chandra Chekuri and Rhea Jain. Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 41:1-41:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chekuri_et_al:LIPIcs.ESA.2024.41, author = {Chekuri, Chandra and Jain, Rhea}, title = {{Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {41:1--41:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.41}, URN = {urn:nbn:de:0030-drops-211124}, doi = {10.4230/LIPIcs.ESA.2024.41}, annote = {Keywords: Buy-at-bulk, Hop-constrained network design, LP integrality gap, Fault-tolerant network design} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, and Weihao Zhu. From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 42:1-42:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chekuri_et_al:LIPIcs.ESA.2024.42, author = {Chekuri, Chandra and Jain, Rhea and Kulkarni, Shubhang and Zheng, Da Wei and Zhu, Weihao}, title = {{From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {42:1--42:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.42}, URN = {urn:nbn:de:0030-drops-211134}, doi = {10.4230/LIPIcs.ESA.2024.42}, annote = {Keywords: Directed Planar Graphs, Submodular Functions, Steiner Tree, Network Design} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, and Sebastian Wild. An Optimal Randomized Algorithm for Finding the Saddlepoint. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 44:1-44:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dallant_et_al:LIPIcs.ESA.2024.44, author = {Dallant, Justin and Haagensen, Frederik and Jacob, Riko and Kozma, L\'{a}szl\'{o} and Wild, Sebastian}, title = {{An Optimal Randomized Algorithm for Finding the Saddlepoint}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {44:1--44:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.44}, URN = {urn:nbn:de:0030-drops-211154}, doi = {10.4230/LIPIcs.ESA.2024.44}, annote = {Keywords: saddlepoint, matrix, comparison, search, randomized algorithms} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, and Mark Simkin. Invertible Bloom Lookup Tables with Less Memory and Randomness. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 54:1-54:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fleischhacker_et_al:LIPIcs.ESA.2024.54, author = {Fleischhacker, Nils and Larsen, Kasper Green and Obremski, Maciej and Simkin, Mark}, title = {{Invertible Bloom Lookup Tables with Less Memory and Randomness}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {54:1--54:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.54}, URN = {urn:nbn:de:0030-drops-211252}, doi = {10.4230/LIPIcs.ESA.2024.54}, annote = {Keywords: Invertible Bloom Lookup Tables} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Mohit Garg, Debajyoti Kar, and Arindam Khan. Random-Order Online Independent Set of Intervals and Hyperrectangles. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 58:1-58:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{garg_et_al:LIPIcs.ESA.2024.58, author = {Garg, Mohit and Kar, Debajyoti and Khan, Arindam}, title = {{Random-Order Online Independent Set of Intervals and Hyperrectangles}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {58:1--58:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.58}, URN = {urn:nbn:de:0030-drops-211298}, doi = {10.4230/LIPIcs.ESA.2024.58}, annote = {Keywords: Online Algorithms, Random-Order Model, Maximum Independent Set of Rectangles, Hyperrectangles, Fat Objects, Interval Scheduling} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Slobodan Mitrović, Ronitt Rubinfeld, and Mihir Singhal. Locally Computing Edge Orientations. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 89:1-89:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mitrovic_et_al:LIPIcs.ESA.2024.89, author = {Mitrovi\'{c}, Slobodan and Rubinfeld, Ronitt and Singhal, Mihir}, title = {{Locally Computing Edge Orientations}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {89:1--89:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.89}, URN = {urn:nbn:de:0030-drops-211603}, doi = {10.4230/LIPIcs.ESA.2024.89}, annote = {Keywords: local computation algorithms, edge orientation, tree coloring} }
Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Shuchi Chawla and Dimitris Christou. Online Time-Windows TSP with Predictions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 2:1-2:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chawla_et_al:LIPIcs.APPROX/RANDOM.2024.2, author = {Chawla, Shuchi and Christou, Dimitris}, title = {{Online Time-Windows TSP with Predictions}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {2:1--2:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.2}, URN = {urn:nbn:de:0030-drops-209954}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.2}, annote = {Keywords: Travelling Salesman Problem, Predictions, Learning-Augmented Algorithms, Approximation} }
Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi. Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{lokshtanov_et_al:LIPIcs.APPROX/RANDOM.2024.6, author = {Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket and Xue, Jie and Zehavi, Meirav}, title = {{Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.6}, URN = {urn:nbn:de:0030-drops-209990}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.6}, annote = {Keywords: bipartization, geometric intersection graphs, approximation algorithms} }
Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Yaron Fairstein, Joseph (Seffi) Naor, and Tomer Tsachor. Distributional Online Weighted Paging with Limited Horizon. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fairstein_et_al:LIPIcs.APPROX/RANDOM.2024.15, author = {Fairstein, Yaron and Naor, Joseph (Seffi) and Tsachor, Tomer}, title = {{Distributional Online Weighted Paging with Limited Horizon}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.15}, URN = {urn:nbn:de:0030-drops-210088}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.15}, annote = {Keywords: Online algorithms, Caching, Stochastic analysis, Predictions} }
Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, and Amitabh Trehan. Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 17:1-17:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bampis_et_al:LIPIcs.APPROX/RANDOM.2024.17, author = {Bampis, Evripidis and Dogeas, Konstantinos and Erlebach, Thomas and Megow, Nicole and Schl\"{o}ter, Jens and Trehan, Amitabh}, title = {{Competitive Query Minimization for Stable Matching with One-Sided Uncertainty}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {17:1--17:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.17}, URN = {urn:nbn:de:0030-drops-210100}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.17}, annote = {Keywords: Matching under Preferences, Stable Marriage, Query-Competitive Algorithms, Uncertainty} }
Feedback for Dagstuhl Publishing