Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
0
Efficient reversal of transductions of sparse graph classes
Jan Niclas Dreier
,
Jakub Gajarský
,
Michał Pilipczuk
PDF
bib
Algorithms for Satisfiability Testing
9 2023, SKILL 2023, Gesellschaft für Informatik, Bonn.
Florentina Voboril
bib
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
volume 241 of
LIPIcs
, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF
bib
Computing Treewidth with Constraint Programming
pages 115-126, 9 2022, SKILL 2022, Gesellschaft für Informatik, Bonn.
Florentina Voboril
PDF
bib
A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
09 2020, Presentation, CPAIOR2020.
Jatschka, Thomas
,
Rodemann, Tobias
,
Günther Raidl
PDF
bib
Portfolio Solvers for QDIMACS and QCIR
Note: QBF Evaluation at SAT
Hoos, Holger H.
,
Tomas Peitl
,
Slivovsky, Friedrich
,
Stefan Szeider
bib
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)
volume 7 of
Dagstuhl Reports
, 2017.
PDF
bib
DOI
Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16)
volume 9801 of
LNCS
, 2016, Springer International Publishing.
bib
DOI
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers
volume 8246 of
Lecture Notes in Computer Science
, 2013, Springer Verlag.
Note: ISBN 978-3-319-03897-1
PDF
bib
DOI
Proceedings of the 10th Metaheuristics International Conference
bib
»
bib
×