Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Zihui Liang, Bakh Khoussainov, Toru Takisaka, and Mingyu Xiao. Connectivity in the Presence of an Opponent. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 79:1-79:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{liang_et_al:LIPIcs.ESA.2023.79, author = {Liang, Zihui and Khoussainov, Bakh and Takisaka, Toru and Xiao, Mingyu}, title = {{Connectivity in the Presence of an Opponent}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {79:1--79:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.79}, URN = {urn:nbn:de:0030-drops-187324}, doi = {10.4230/LIPIcs.ESA.2023.79}, annote = {Keywords: Explicit M\"{u}ller games, games played on finite graphs, winning strategies, synthesis and analysis of games} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Jingyang Zhao, Mingyu Xiao, and Chao Xu. Improved Approximation Algorithms for the Traveling Tournament Problem. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 83:1-83:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{zhao_et_al:LIPIcs.MFCS.2022.83, author = {Zhao, Jingyang and Xiao, Mingyu and Xu, Chao}, title = {{Improved Approximation Algorithms for the Traveling Tournament Problem}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {83:1--83:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.83}, URN = {urn:nbn:de:0030-drops-168813}, doi = {10.4230/LIPIcs.MFCS.2022.83}, annote = {Keywords: Sports scheduling, Traveling Tournament Problem, Approximation algorithm} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Radovan Červený and Ondřej Suchý. Faster FPT Algorithm for 5-Path Vertex Cover. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cerveny_et_al:LIPIcs.MFCS.2019.32, author = {\v{C}erven\'{y}, Radovan and Such\'{y}, Ond\v{r}ej}, title = {{Faster FPT Algorithm for 5-Path Vertex Cover}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.32}, URN = {urn:nbn:de:0030-drops-109761}, doi = {10.4230/LIPIcs.MFCS.2019.32}, annote = {Keywords: graph algorithms, Hitting Set, iterative compression, parameterized complexity, d-Path Vertex Cover} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Mingyu Xiao and Hiroshi Nagamochi. Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 112:1-112:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{xiao_et_al:LIPIcs.ICALP.2018.112, author = {Xiao, Mingyu and Nagamochi, Hiroshi}, title = {{Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {112:1--112:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.112}, URN = {urn:nbn:de:0030-drops-91164}, doi = {10.4230/LIPIcs.ICALP.2018.112}, annote = {Keywords: FPT, Important Cuts, Graph Cuts, Graph Algorithms} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Mingyu Xiao and Hiroshi Nagamochi. A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 62:1-62:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{xiao_et_al:LIPIcs.ISAAC.2016.62, author = {Xiao, Mingyu and Nagamochi, Hiroshi}, title = {{A Linear-Time Algorithm for Integral Multiterminal Flows in Trees}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {62:1--62:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.62}, URN = {urn:nbn:de:0030-drops-68311}, doi = {10.4230/LIPIcs.ISAAC.2016.62}, annote = {Keywords: Multiterminal flow; Maximum flow; Minimum Cut; Trees; Linear-time algorithms} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Mingyu Xiao and Shaowei Kou. An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 89:1-89:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{xiao_et_al:LIPIcs.MFCS.2016.89, author = {Xiao, Mingyu and Kou, Shaowei}, title = {{An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {89:1--89:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.89}, URN = {urn:nbn:de:0030-drops-64976}, doi = {10.4230/LIPIcs.MFCS.2016.89}, annote = {Keywords: sports scheduling, traveling tournament problem, approximation algorithms, timetabling combinatorial optimization} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, and Barak Navon. Parameterized Complexity of Critical Node Cuts. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 343-354, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hermelin_et_al:LIPIcs.IPEC.2015.343, author = {Hermelin, Danny and Kaspi, Moshe and Komusiewicz, Christian and Navon, Barak}, title = {{Parameterized Complexity of Critical Node Cuts}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {343--354}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.343}, URN = {urn:nbn:de:0030-drops-55950}, doi = {10.4230/LIPIcs.IPEC.2015.343}, annote = {Keywords: graph cut problem, NP-hard problem, treewidth} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen. Parameterized Complexity Dichotomy for Steiner Multicut. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 157-170, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bringmann_et_al:LIPIcs.STACS.2015.157, author = {Bringmann, Karl and Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan}, title = {{Parameterized Complexity Dichotomy for Steiner Multicut}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {157--170}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.157}, URN = {urn:nbn:de:0030-drops-49115}, doi = {10.4230/LIPIcs.STACS.2015.157}, annote = {Keywords: graph cut problems, Steiner cut, fixed-parameter tractability} }
Feedback for Dagstuhl Publishing