Search Results

Documents authored by Swat, Sylwester

Document
PACE Solver Description
DOI: 10.4230/LIPIcs.IPEC.2025.38
PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems

Authors: Sylwester Swat

Published in: LIPIcs, Volume 358, 20th International Symposium on Parameterized and Exact Computation (IPEC 2025)

Abstract
This article briefly describes the most important algorithms and techniques used in HitS&DoSeS, a dominating set and hitting set solver submitted to the PACE 2025 contest (10th Parameterized Algorithms and Computational Experiments Challenge). Used approaches for the exact and heuristic tracks are described, for both the dominating set and the hitting set problems.
Cite as

Sylwester Swat. PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 38:1-38:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{swat:LIPIcs.IPEC.2025.38,
  author =	{Swat, Sylwester},
  title =	{{PACE Solver Description: HitS\&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems}},
  booktitle =	{20th International Symposium on Parameterized and Exact Computation (IPEC 2025)},
  pages =	{38:1--38:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-407-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{358},
  editor =	{Agrawal, Akanksha and van Leeuwen, Erik Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.38},
  URN =		{urn:nbn:de:0030-drops-251705},
  doi =		{10.4230/LIPIcs.IPEC.2025.38},
  annote =	{Keywords: dominating set, hitting set, exact algorithms, heuristic algorithms, large graphs, combinatorial optimization}
}
Document
PACE Solver Description
DOI: 10.4230/LIPIcs.IPEC.2022.27
PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem

Authors: Sylwester Swat

Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

Abstract
This article briefly describes the most important algorithms and techniques used in the directed feedback vertex set heuristic solver called "DiVerSeS", submitted to the 7th Parameterized Algorithms and Computational Experiments Challenge (PACE 2022).
Cite as

Sylwester Swat. PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 27:1-27:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{swat:LIPIcs.IPEC.2022.27,
  author =	{Swat, Sylwester},
  title =	{{PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem}},
  booktitle =	{17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
  pages =	{27:1--27:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-260-0},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{249},
  editor =	{Dell, Holger and Nederlof, Jesper},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.27},
  URN =		{urn:nbn:de:0030-drops-173835},
  doi =		{10.4230/LIPIcs.IPEC.2022.27},
  annote =	{Keywords: Directed feedback vertex set, heuristic solver, graph algorithms, PACE 2022}
}
Document
PACE Solver Description
DOI: 10.4230/LIPIcs.IPEC.2021.32
PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem

Authors: Sylwester Swat

Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)

Abstract
This article briefly describes the most important algorithms and techniques used in the cluster editing heuristic solver called "CluES", submitted to the 6th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021).
Cite as

Sylwester Swat. PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 32:1-32:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{swat:LIPIcs.IPEC.2021.32,
  author =	{Swat, Sylwester},
  title =	{{PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem}},
  booktitle =	{16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
  pages =	{32:1--32:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-216-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{214},
  editor =	{Golovach, Petr A. and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.32},
  URN =		{urn:nbn:de:0030-drops-154157},
  doi =		{10.4230/LIPIcs.IPEC.2021.32},
  annote =	{Keywords: Cluster editing, heuristic solver, graph algorithms, PACE 2021}
}
Document
PACE Solver Description
DOI: 10.4230/LIPIcs.IPEC.2021.35
PACE Solver Description: Cluster Editing Kernelization Using CluES

Authors: Sylwester Swat

Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)

Abstract
This article briefly describes the most important algorithms and techniques used in the cluster editing kernelization solver called "CluES", submitted to the 6th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021).
Cite as

Sylwester Swat. PACE Solver Description: Cluster Editing Kernelization Using CluES. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 35:1-35:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{swat:LIPIcs.IPEC.2021.35,
  author =	{Swat, Sylwester},
  title =	{{PACE Solver Description: Cluster Editing Kernelization Using CluES}},
  booktitle =	{16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
  pages =	{35:1--35:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-216-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{214},
  editor =	{Golovach, Petr A. and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.35},
  URN =		{urn:nbn:de:0030-drops-154186},
  doi =		{10.4230/LIPIcs.IPEC.2021.35},
  annote =	{Keywords: Cluster editing, kernelization, graph algorithms, PACE 2021}
}
Document
PACE Solver Description
DOI: 10.4230/LIPIcs.IPEC.2020.33
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem

Authors: Sylwester Swat

Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)

Abstract
This article briefly describes the most important algorithms and techniques used in the treedepth decomposition heuristic solver called "ExTREEm", submitted to the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2020) co-organized with the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
Cite as

Sylwester Swat. PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 33:1-33:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{swat:LIPIcs.IPEC.2020.33,
  author =	{Swat, Sylwester},
  title =	{{PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem}},
  booktitle =	{15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
  pages =	{33:1--33:4},
  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.33},
  URN =		{urn:nbn:de:0030-drops-133365},
  doi =		{10.4230/LIPIcs.IPEC.2020.33},
  annote =	{Keywords: Treedepth decomposition, elimination tree, separator, PACE 2020}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact