Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Konrad Majewski, Michał Pilipczuk, and Anna Zych-Pawlewicz. Parameterized Dynamic Data Structure for Split Completion. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 87:1-87:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{majewski_et_al:LIPIcs.ESA.2024.87, author = {Majewski, Konrad and Pilipczuk, Micha{\l} and Zych-Pawlewicz, Anna}, title = {{Parameterized Dynamic Data Structure for Split Completion}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {87:1--87: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.87}, URN = {urn:nbn:de:0030-drops-211587}, doi = {10.4230/LIPIcs.ESA.2024.87}, annote = {Keywords: parameterized complexity, dynamic data structures, split graphs} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Alexander Dobler, Manuel Sorge, and Anaïs Villedieu. Turbocharging Heuristics for Weak Coloring Numbers. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 44:1-44:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dobler_et_al:LIPIcs.ESA.2022.44, author = {Dobler, Alexander and Sorge, Manuel and Villedieu, Ana\"{i}s}, title = {{Turbocharging Heuristics for Weak Coloring Numbers}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {44:1--44:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva 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.2022.44}, URN = {urn:nbn:de:0030-drops-169820}, doi = {10.4230/LIPIcs.ESA.2022.44}, annote = {Keywords: Structural sparsity, parameterized algorithms, parameterized complexity, fixed-parameter tractability} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Wojciech Nadara, Michał Pilipczuk, and Marcin Smulewicz. Computing Treedepth in Polynomial Space and Linear FPT Time. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 79:1-79:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nadara_et_al:LIPIcs.ESA.2022.79, author = {Nadara, Wojciech and Pilipczuk, Micha{\l} and Smulewicz, Marcin}, title = {{Computing Treedepth in Polynomial Space and Linear FPT Time}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {79:1--79:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva 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.2022.79}, URN = {urn:nbn:de:0030-drops-170175}, doi = {10.4230/LIPIcs.ESA.2022.79}, annote = {Keywords: treedepth, FPT, polynomial space} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, and Marek Sokołowski. Determining 4-Edge-Connected Components in Linear Time. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 71:1-71:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{nadara_et_al:LIPIcs.ESA.2021.71, author = {Nadara, Wojciech and Radecki, Mateusz and Smulewicz, Marcin and Soko{\l}owski, Marek}, title = {{Determining 4-Edge-Connected Components in Linear Time}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {71:1--71:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.71}, URN = {urn:nbn:de:0030-drops-146523}, doi = {10.4230/LIPIcs.ESA.2021.71}, annote = {Keywords: graphs, connectivity, cuts} }
Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Łukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, and Piotr Wygocki. The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 37:1-37:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kowalik_et_al:LIPIcs.IPEC.2020.37, author = {Kowalik, {\L}ukasz and Mucha, Marcin and Nadara, Wojciech and Pilipczuk, Marcin and Sorge, Manuel and Wygocki, Piotr}, title = {{The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {37:1--37:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-172-6}, ISSN = {1868-8969}, year = {2020}, volume = {180}, editor = {Cao, Yixin and Pilipczuk, Marcin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.37}, URN = {urn:nbn:de:0030-drops-133404}, doi = {10.4230/LIPIcs.IPEC.2020.37}, annote = {Keywords: computing treedepth, contest, implementation challenge, FPT} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Łukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, and Magnus Wahlström. Many Visits TSP Revisited. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 66:1-66:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kowalik_et_al:LIPIcs.ESA.2020.66, author = {Kowalik, {\L}ukasz and Li, Shaohua and Nadara, Wojciech and Smulewicz, Marcin and Wahlstr\"{o}m, Magnus}, title = {{Many Visits TSP Revisited}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {66:1--66:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66}, URN = {urn:nbn:de:0030-drops-129329}, doi = {10.4230/LIPIcs.ESA.2020.66}, annote = {Keywords: many visits traveling salesman problem, exponential algorithm} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Wojciech Czerwiński, Wojciech Nadara, and Marcin Pilipczuk. Improved Bounds for the Excluded-Minor Approximation of Treedepth. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 34:1-34:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{czerwinski_et_al:LIPIcs.ESA.2019.34, author = {Czerwi\'{n}ski, Wojciech and Nadara, Wojciech and Pilipczuk, Marcin}, title = {{Improved Bounds for the Excluded-Minor Approximation of Treedepth}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {34:1--34:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola 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.2019.34}, URN = {urn:nbn:de:0030-drops-111557}, doi = {10.4230/LIPIcs.ESA.2019.34}, annote = {Keywords: treedepth, excluded minor} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, and Sebastian Siebertz. Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{nadara_et_al:LIPIcs.SEA.2018.14, author = {Nadara, Wojciech and Pilipczuk, Marcin and Rabinovich, Roman and Reidl, Felix and Siebertz, Sebastian}, title = {{Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {14:1--14:16}, 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.14}, URN = {urn:nbn:de:0030-drops-89493}, doi = {10.4230/LIPIcs.SEA.2018.14}, annote = {Keywords: Empirical Evaluation of Algorithms, Sparse Graph Classes, Generalized Coloring Numbers, Uniform Quasi-Wideness} }
Feedback for Dagstuhl Publishing