Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Telikepalli Kavitha. Min-Cost Popular Matchings. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kavitha:LIPIcs.FSTTCS.2020.25, author = {Kavitha, Telikepalli}, title = {{Min-Cost Popular Matchings}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.25}, URN = {urn:nbn:de:0030-drops-132668}, doi = {10.4230/LIPIcs.FSTTCS.2020.25}, annote = {Keywords: Bipartite graphs, Stable matchings, Dual certificates} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Dimitris Fotakis, Jannik Matuschke, and Orestis Papadigenopoulos. Malleable Scheduling Beyond Identical Machines. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fotakis_et_al:LIPIcs.APPROX-RANDOM.2019.17, author = {Fotakis, Dimitris and Matuschke, Jannik and Papadigenopoulos, Orestis}, title = {{Malleable Scheduling Beyond Identical Machines}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.17}, URN = {urn:nbn:de:0030-drops-112324}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.17}, annote = {Keywords: malleable, jobs, moldable, machines, unrelated, uniform, parallel, speeds, approximation, scheduling} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Jannik Matuschke, Ulrike Schmidt-Kraepelin, and José Verschae. Maintaining Perfect Matchings at Low Cost. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 82:1-82:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{matuschke_et_al:LIPIcs.ICALP.2019.82, author = {Matuschke, Jannik and Schmidt-Kraepelin, Ulrike and Verschae, Jos\'{e}}, title = {{Maintaining Perfect Matchings at Low Cost}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {82:1--82:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.82}, URN = {urn:nbn:de:0030-drops-106582}, doi = {10.4230/LIPIcs.ICALP.2019.82}, annote = {Keywords: matchings, robust optimization, approximation algorithms} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, and José Verschae. A Local-Search Algorithm for Steiner Forest. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 31:1-31:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gro_et_al:LIPIcs.ITCS.2018.31, author = {Gro{\ss}, Martin and Gupta, Anupam and Kumar, Amit and Matuschke, Jannik and Schmidt, Daniel R. and Schmidt, Melanie and Verschae, Jos\'{e}}, title = {{A Local-Search Algorithm for Steiner Forest}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.31}, URN = {urn:nbn:de:0030-drops-83134}, doi = {10.4230/LIPIcs.ITCS.2018.31}, annote = {Keywords: Local Search, Steiner Forest, Approximation Algorithms, Network Design} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Jannik Matuschke, S. Thomas McCormick, and Gianpaolo Oriolo. Rerouting Flows When Links Fail. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 89:1-89:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{matuschke_et_al:LIPIcs.ICALP.2017.89, author = {Matuschke, Jannik and McCormick, S. Thomas and Oriolo, Gianpaolo}, title = {{Rerouting Flows When Links Fail}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {89:1--89:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.89}, URN = {urn:nbn:de:0030-drops-74466}, doi = {10.4230/LIPIcs.ICALP.2017.89}, annote = {Keywords: network flows, network interdiction, robust optimization} }
Published in: OASIcs, Volume 25, 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2012)
Felix G. König, Jannik Matuschke, and Alexander Richter. Multi-Dimensional Commodity Covering for Tariff Selection in Transportation. In 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 25, pp. 58-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{konig_et_al:OASIcs.ATMOS.2012.58, author = {K\"{o}nig, Felix G. and Matuschke, Jannik and Richter, Alexander}, title = {{Multi-Dimensional Commodity Covering for Tariff Selection in Transportation}}, booktitle = {12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {58--70}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-45-3}, ISSN = {2190-6807}, year = {2012}, volume = {25}, editor = {Delling, Daniel and Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2012.58}, URN = {urn:nbn:de:0030-drops-37034}, doi = {10.4230/OASIcs.ATMOS.2012.58}, annote = {Keywords: Covering, Heuristics, Transportation, Tariff Selection} }
Feedback for Dagstuhl Publishing