Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/iwpec/ipec2019.bht:"
download as .bib file
@inproceedings{DBLP:conf/iwpec/000119,
author = {Johannes Blum},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Hierarchy of Transportation Network Parameters and Hardness Results},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.4},
doi = {10.4230/LIPICS.IPEC.2019.4},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/000119.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/000119a,
author = {Jiawei Gao},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees
and Bounded Treewidth DAGs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {16:1--16:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.16},
doi = {10.4230/LIPICS.IPEC.2019.16},
timestamp = {Thu, 05 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/000119a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/000219,
author = {Marco Bressan},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Faster Subgraph Counting in Sparse Graphs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {6:1--6:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.6},
doi = {10.4230/LIPICS.IPEC.2019.6},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/000219.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Berendsohn0M19,
author = {Benjamin Aram Berendsohn and
L{\'{a}}szl{\'{o}} Kozma and
D{\'{a}}niel Marx},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Finding and Counting Permutations via CSPs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {1:1--1:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.1},
doi = {10.4230/LIPICS.IPEC.2019.1},
timestamp = {Thu, 05 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Berendsohn0M19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BessyBCPS19,
author = {St{\'{e}}phane Bessy and
Marin Bougeret and
Alan Di{\^{e}}go A. Carneiro and
F{\'{a}}bio Protti and
U{\'{e}}verton S. Souza},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Width Parameterizations for Knot-Free Vertex Deletion on Digraphs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {2:1--2:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.2},
doi = {10.4230/LIPICS.IPEC.2019.2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BessyBCPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BlaserE19,
author = {Markus Bl{\"{a}}ser and
Christian Engels},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Parameterized Valiant's Classes},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {3:1--3:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.3},
doi = {10.4230/LIPICS.IPEC.2019.3},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BlaserE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BonnetP19,
author = {{\'{E}}douard Bonnet and
Nidhi Purohit},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Metric Dimension Parameterized by Treewidth},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {5:1--5:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.5},
doi = {10.4230/LIPICS.IPEC.2019.5},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BonnetP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChitnisC19,
author = {Rajesh Chitnis and
Graham Cormode},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Towards a Theory of Parameterized Streaming Algorithms},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {7:1--7:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.7},
doi = {10.4230/LIPICS.IPEC.2019.7},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/ChitnisC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChitnisF19,
author = {Rajesh Chitnis and
Andreas Emil Feldmann},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {{FPT} Inapproximability of Directed Cut and Connectivity Problems},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.8},
doi = {10.4230/LIPICS.IPEC.2019.8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ChitnisF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DreierFHKRTW19,
author = {Jan Dreier and
Janosch Fuchs and
Tim A. Hartmann and
Philipp Kuinke and
Peter Rossmanith and
Bjoern Tauer and
Hung{-}Lung Wang},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {The Complexity of Packing Edge-Disjoint Paths},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {10:1--10:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.10},
doi = {10.4230/LIPICS.IPEC.2019.10},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DreierFHKRTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DreierR19,
author = {Jan Dreier and
Peter Rossmanith},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Hardness of {FO} Model-Checking on Random Graphs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {11:1--11:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.11},
doi = {10.4230/LIPICS.IPEC.2019.11},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DreierR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DuarteLPSS19,
author = {Gabriel L. Duarte and
Daniel Lokshtanov and
Lehilton L. C. Pedrosa and
Rafael C. S. Schouery and
U{\'{e}}verton S. Souza},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Computing the Largest Bond of a Graph},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {12:1--12:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.12},
doi = {10.4230/LIPICS.IPEC.2019.12},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DuarteLPSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DzulfikarFH19,
author = {M. Ayaz Dzulfikar and
Johannes Klaus Fichte and
Markus Hecher},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {The {PACE} 2019 Parameterized Algorithms and Computational Experiments
Challenge: The Fourth Iteration (Invited Paper)},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {25:1--25:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.25},
doi = {10.4230/LIPICS.IPEC.2019.25},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DzulfikarFH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EtoHK019,
author = {Hiroshi Eto and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Parameterized Algorithms for Maximum Cut with Connectivity Constraints},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.13},
doi = {10.4230/LIPICS.IPEC.2019.13},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/EtoHK019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FluschnikNRZ19,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Multistage Vertex Cover},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.14},
doi = {10.4230/LIPICS.IPEC.2019.14},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/FluschnikNRZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FoucaudHLMP19,
author = {Florent Foucaud and
Herv{\'{e}} Hocquard and
Dimitri Lajou and
Valia Mitsou and
Th{\'{e}}o Pierron},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism
Problems},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {15:1--15:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.15},
doi = {10.4230/LIPICS.IPEC.2019.15},
timestamp = {Thu, 05 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/FoucaudHLMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GokeCM19,
author = {Alexander G{\"{o}}ke and
Lydia Mirabel Mendoza Cadena and
Matthias Mnich},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Resolving Infeasibility of Linear Systems: {A} Parameterized Approach},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.17},
doi = {10.4230/LIPICS.IPEC.2019.17},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GokeCM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GolovachT19,
author = {Petr A. Golovach and
Dimitrios M. Thilikos},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Clustering to Given Connectivities},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.18},
doi = {10.4230/LIPICS.IPEC.2019.18},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GolovachT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GomesS19,
author = {Guilherme de C. M. Gomes and
Ignasi Sau},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Finding Cuts of Bounded Degree: Complexity, {FPT} and Exact Algorithms,
and Kernelization},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {19:1--19:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.19},
doi = {10.4230/LIPICS.IPEC.2019.19},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GomesS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Hamm19,
author = {Thekla Hamm},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in
Linear Time},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.20},
doi = {10.4230/LIPICS.IPEC.2019.20},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Hamm19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HusicTT19,
author = {Edin Husic and
St{\'{e}}phan Thomass{\'{e}} and
Nicolas Trotignon},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {The Independent Set Problem Is {FPT} for Even-Hole-Free Graphs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {21:1--21:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.21},
doi = {10.4230/LIPICS.IPEC.2019.21},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HusicTT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/IwataK19,
author = {Yoichi Iwata and
Yusuke Kobayashi},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Improved Analysis of Highest-Degree Branching for Feedback Vertex
Set},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {22:1--22:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.22},
doi = {10.4230/LIPICS.IPEC.2019.22},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/IwataK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/LozzoEG019,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual
Carving-Width},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.9},
doi = {10.4230/LIPICS.IPEC.2019.9},
timestamp = {Thu, 05 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/LozzoEG019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/NovotnaOPRLW19,
author = {Jana Novotn{\'{a}} and
Karolina Okrasa and
Michal Pilipczuk and
Pawel Rzazewski and
Erik Jan van Leeuwen and
Bartosz Walczak},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {23:1--23:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.23},
doi = {10.4230/LIPICS.IPEC.2019.23},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/NovotnaOPRLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Rosenthal19,
author = {Gregory Rosenthal},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Beating Treewidth for Average-Case Subgraph Isomorphism},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.24},
doi = {10.4230/LIPICS.IPEC.2019.24},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Rosenthal19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/X19,
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {0:1--0:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.0},
doi = {10.4230/LIPICS.IPEC.2019.0},
timestamp = {Thu, 05 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/X19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2019,
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-129-0},
isbn = {978-3-95977-129-0},
timestamp = {Thu, 05 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-06-11 13:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
