Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
Christoph Jabs, Jeremias Berg, Hannes Ihalainen, and Matti Järvisalo. Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 18:1-18:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{jabs_et_al:LIPIcs.CP.2023.18, author = {Jabs, Christoph and Berg, Jeremias and Ihalainen, Hannes and J\"{a}rvisalo, Matti}, title = {{Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization}}, booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-300-3}, ISSN = {1868-8969}, year = {2023}, volume = {280}, editor = {Yap, Roland H. C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.18}, URN = {urn:nbn:de:0030-drops-190553}, doi = {10.4230/LIPIcs.CP.2023.18}, annote = {Keywords: maximum satisfiability, multi-objective combinatorial optimization, preprocessing, redundancy} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Markus Anders, Pascal Schweitzer, and Julian Stieß. Engineering a Preprocessor for Symmetry Detection. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 1:1-1:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{anders_et_al:LIPIcs.SEA.2023.1, author = {Anders, Markus and Schweitzer, Pascal and Stie{\ss}, Julian}, title = {{Engineering a Preprocessor for Symmetry Detection}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {1:1--1:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.1}, URN = {urn:nbn:de:0030-drops-183511}, doi = {10.4230/LIPIcs.SEA.2023.1}, annote = {Keywords: graph isomorphism, automorphism groups, symmetry detection, preprocessors} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Kamal Eyubov, Marcelo Fonseca Faraj, and Christian Schulz. FREIGHT: Fast Streaming Hypergraph Partitioning. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 15:1-15:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{eyubov_et_al:LIPIcs.SEA.2023.15, author = {Eyubov, Kamal and Fonseca Faraj, Marcelo and Schulz, Christian}, title = {{FREIGHT: Fast Streaming Hypergraph Partitioning}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.15}, URN = {urn:nbn:de:0030-drops-183657}, doi = {10.4230/LIPIcs.SEA.2023.15}, annote = {Keywords: Hypergraph partitioning, graph partitioning, edge partitioning, streaming} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Noah Wahl and Lars Gottesbüren. Greedy Heuristics for Judicious Hypergraph Partitioning. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 17:1-17:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{wahl_et_al:LIPIcs.SEA.2023.17, author = {Wahl, Noah and Gottesb\"{u}ren, Lars}, title = {{Greedy Heuristics for Judicious Hypergraph Partitioning}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.17}, URN = {urn:nbn:de:0030-drops-183674}, doi = {10.4230/LIPIcs.SEA.2023.17}, annote = {Keywords: hypergraph partitioning, local search algorithms, load balancing, local search} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Christoph Jabs, Jeremias Berg, Andreas Niskanen, and Matti Järvisalo. MaxSAT-Based Bi-Objective Boolean Optimization. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 12:1-12:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{jabs_et_al:LIPIcs.SAT.2022.12, author = {Jabs, Christoph and Berg, Jeremias and Niskanen, Andreas and J\"{a}rvisalo, Matti}, title = {{MaxSAT-Based Bi-Objective Boolean Optimization}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {12:1--12:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.12}, URN = {urn:nbn:de:0030-drops-166863}, doi = {10.4230/LIPIcs.SAT.2022.12}, annote = {Keywords: Multi-objective optimization, Pareto front enumeration, bi-objective optimization, maximum satisfiability, incremental SAT} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 13:1-13:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{smirnov_et_al:LIPIcs.SAT.2022.13, author = {Smirnov, Pavel and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.13}, URN = {urn:nbn:de:0030-drops-166871}, doi = {10.4230/LIPIcs.SAT.2022.13}, annote = {Keywords: constraint optimization, pseudo-Boolean optimization, implicit hitting sets, solution-improving search, unsatisfiable cores} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Andreas Niskanen, Jeremias Berg, and Matti Järvisalo. Incremental Maximum Satisfiability. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 14:1-14:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{niskanen_et_al:LIPIcs.SAT.2022.14, author = {Niskanen, Andreas and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Incremental Maximum Satisfiability}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.14}, URN = {urn:nbn:de:0030-drops-166885}, doi = {10.4230/LIPIcs.SAT.2022.14}, annote = {Keywords: maximum satisfiability, MaxSAT, incremental optimization, API, implicit hitting set approach} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Tuukka Korhonen and Matti Järvisalo. Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 8:1-8:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{korhonen_et_al:LIPIcs.CP.2021.8, author = {Korhonen, Tuukka and J\"{a}rvisalo, Matti}, title = {{Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {8:1--8:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.8}, URN = {urn:nbn:de:0030-drops-152992}, doi = {10.4230/LIPIcs.CP.2021.8}, annote = {Keywords: propositional model counting, decision heuristics, tree decompositions, empirical evaluation} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo. Refined Core Relaxation for Core-Guided MaxSAT Solving. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 28:1-28:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ihalainen_et_al:LIPIcs.CP.2021.28, author = {Ihalainen, Hannes and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Refined Core Relaxation for Core-Guided MaxSAT Solving}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {28:1--28:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.28}, URN = {urn:nbn:de:0030-drops-153197}, doi = {10.4230/LIPIcs.CP.2021.28}, annote = {Keywords: maximum satisfiability, MaxSAT, core-guided MaxSAT solving} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Andreas Niskanen, Jeremias Berg, and Matti Järvisalo. Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 44:1-44:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{niskanen_et_al:LIPIcs.CP.2021.44, author = {Niskanen, Andreas and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {44:1--44:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.44}, URN = {urn:nbn:de:0030-drops-153354}, doi = {10.4230/LIPIcs.CP.2021.44}, annote = {Keywords: Constraint optimization, maximum satisfiability, MaxSAT, implicit hitting set approach} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. Pseudo-Boolean Optimization by Implicit Hitting Sets. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 51:1-51:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{smirnov_et_al:LIPIcs.CP.2021.51, author = {Smirnov, Pavel and Berg, Jeremias and J\"{a}rvisalo, Matti}, title = {{Pseudo-Boolean Optimization by Implicit Hitting Sets}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {51:1--51:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.51}, URN = {urn:nbn:de:0030-drops-153429}, doi = {10.4230/LIPIcs.CP.2021.51}, annote = {Keywords: constraint optimization, pseudo-Boolean optimization, implicit hitting sets} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Tuukka Korhonen. Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 87:1-87:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{korhonen:LIPIcs.ICALP.2021.87, author = {Korhonen, Tuukka}, title = {{Lower Bounds on Dynamic Programming for Maximum Weight Independent Set}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {87:1--87:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.87}, URN = {urn:nbn:de:0030-drops-141562}, doi = {10.4230/LIPIcs.ICALP.2021.87}, annote = {Keywords: Maximum weight independent set, Treewidth, Tropical circuits, Dynamic programming, Treedepth, Monotone circuit complexity} }
Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Tuukka Korhonen. Finding Optimal Triangulations Parameterized by Edge Clique Cover. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 22:1-22:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{korhonen:LIPIcs.IPEC.2020.22, author = {Korhonen, Tuukka}, title = {{Finding Optimal Triangulations Parameterized by Edge Clique Cover}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {22:1--22: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.22}, URN = {urn:nbn:de:0030-drops-133253}, doi = {10.4230/LIPIcs.IPEC.2020.22}, annote = {Keywords: Treewidth, Minimum fill-in, Perfect phylogeny, Fractional hypertreewidth, Potential maximal cliques, Edge clique cover} }
Feedback for Dagstuhl Publishing