Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Christian Komusiewicz
@article{DBLP:journals/corr/abs-2402-15494,
author = {Emanuel Herrendorf and
Christian Komusiewicz and
Nils Morawietz and
Frank Sommer},
title = {On the Complexity of Community-aware Network Sparsification},
journal = {CoRR},
volume = {abs/2402.15494},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.15494},
doi = {10.48550/ARXIV.2402.15494},
eprinttype = {arXiv},
eprint = {2402.15494},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-15494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoanaKS23,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Essentially Tight Kernels for (Weakly) Closed Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1706--1735},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01088-7},
doi = {10.1007/S00453-022-01088-7},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KoanaKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KoanaKS23a,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2156--2187},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01090-z},
doi = {10.1007/S00453-022-01090-Z},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KoanaKS23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/datamine/HolznigenkemperKS23,
author = {Jana Holznigenkemper and
Christian Komusiewicz and
Bernhard Seeger},
title = {On computing exact means of time series using the move-split-merge
metric},
journal = {Data Min. Knowl. Discov.},
volume = {37},
number = {2},
pages = {595--626},
year = {2023},
url = {https://doi.org/10.1007/s10618-022-00908-2},
doi = {10.1007/S10618-022-00908-2},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/datamine/HolznigenkemperKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/EcksteinGKS23,
author = {Nils Jakob Eckstein and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
title = {Destroying Multicolored Paths and Cycles in Edge-Colored Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {25},
year = {2023},
url = {https://doi.org/10.46298/dmtcs.7636},
doi = {10.46298/DMTCS.7636},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/EcksteinGKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GarvardtKS23,
author = {Jaroslav Garvardt and
Christian Komusiewicz and
Frank Sommer},
title = {The Parameterized Complexity of s-Club with Triangle and Seed Constraints},
journal = {Theory Comput. Syst.},
volume = {67},
number = {5},
pages = {1050--1081},
year = {2023},
url = {https://doi.org/10.1007/s00224-023-10135-x},
doi = {10.1007/S00224-023-10135-X},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GarvardtKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/StausKMS23,
author = {Luca Pascal Staus and
Christian Komusiewicz and
Nils Morawietz and
Frank Sommer},
editor = {Jonathan W. Berry and
David B. Shmoys and
Lenore Cowen and
Uwe Naumann},
title = {Exact Algorithms for Group Closeness Centrality},
booktitle = {{SIAM} Conference on Applied and Computational Discrete Algorithms,
{ACDA} 2023, Seattle, WA, USA, May 31 - June 2, 2023},
pages = {1--12},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977714.1},
doi = {10.1137/1.9781611977714.1},
timestamp = {Tue, 17 Oct 2023 16:38:11 +0200},
biburl = {https://dblp.org/rec/conf/acda/StausKMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/KomusiewiczSS23,
author = {Christian Komusiewicz and
Jannis Schramek and
Frank Sommer},
editor = {Jonathan W. Berry and
David B. Shmoys and
Lenore Cowen and
Uwe Naumann},
title = {On the Group Coverage Centrality Problem: Parameterized Complexity
and Heuristics},
booktitle = {{SIAM} Conference on Applied and Computational Discrete Algorithms,
{ACDA} 2023, Seattle, WA, USA, May 31 - June 2, 2023},
pages = {13--24},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977714.2},
doi = {10.1137/1.9781611977714.2},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acda/KomusiewiczSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KomusiewiczLMS23,
author = {Christian Komusiewicz and
Simone Linz and
Nils Morawietz and
Jannik Schestag},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {On the Complexity of Parameterized Local Search for the Maximum Parsimony
Problem},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.18},
doi = {10.4230/LIPICS.CPM.2023.18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/KomusiewiczLMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/KomusiewiczKSS23,
author = {Christian Komusiewicz and
Pascal Kunz and
Frank Sommer and
Manuel Sorge},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {On Computing Optimal Tree Ensembles},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {17364--17374},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/komusiewicz23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/KomusiewiczKSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GarvardtGKM23,
author = {Jaroslav Garvardt and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
title = {Parameterized Local Search for Max c-Cut},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {5586--5594},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/620},
doi = {10.24963/IJCAI.2023/620},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GarvardtGKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Holznigenkemper23,
author = {Jana Holznigenkemper and
Christian Komusiewicz and
Nils Morawietz and
Bernhard Seeger},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {On the Complexity of Computing Time Series Medians Under the Move-Split-Merge
Metric},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {54:1--54:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.54},
doi = {10.4230/LIPICS.MFCS.2023.54},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Holznigenkemper23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/Holznigenkemper23,
author = {Jana Holznigenkemper and
Christian Komusiewicz and
Bernhard Seeger},
editor = {Shashi Shekhar and
Zhi{-}Hua Zhou and
Yao{-}Yi Chiang and
Gregor Stiglic},
title = {Exact and Heuristic Approaches to Speeding Up the {MSM} Time Series
Distance Computation},
booktitle = {Proceedings of the 2023 {SIAM} International Conference on Data Mining,
{SDM} 2023, Minneapolis-St. Paul Twin Cities, MN, USA, April 27-29,
2023},
pages = {451--459},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977653.ch51},
doi = {10.1137/1.9781611977653.CH51},
timestamp = {Tue, 17 Oct 2023 16:39:08 +0200},
biburl = {https://dblp.org/rec/conf/sdm/Holznigenkemper23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BilleGKM23,
author = {Alexander Bille and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
editor = {Loukas Georgiadis},
title = {A Graph-Theoretic Formulation of Exploratory Blockmodeling},
booktitle = {21st International Symposium on Experimental Algorithms, {SEA} 2023,
July 24-26, 2023, Barcelona, Spain},
series = {LIPIcs},
volume = {265},
pages = {14:1--14:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SEA.2023.14},
doi = {10.4230/LIPICS.SEA.2023.14},
timestamp = {Thu, 20 Jul 2023 11:35:53 +0200},
biburl = {https://dblp.org/rec/conf/wea/BilleGKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-01977,
author = {Jana Holznigenkemper and
Christian Komusiewicz and
Bernhard Seeger},
title = {Exact and Heuristic Approaches to Speeding Up the {MSM} Time Series
Distance Computation},
journal = {CoRR},
volume = {abs/2301.01977},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.01977},
doi = {10.48550/ARXIV.2301.01977},
eprinttype = {arXiv},
eprint = {2301.01977},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-01977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-04423,
author = {Christian Komusiewicz and
Pascal Kunz and
Frank Sommer and
Manuel Sorge},
title = {On Computing Optimal Tree Ensembles},
journal = {CoRR},
volume = {abs/2306.04423},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.04423},
doi = {10.48550/ARXIV.2306.04423},
eprinttype = {arXiv},
eprint = {2306.04423},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-04423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-03518,
author = {Christian Komusiewicz and
Jannik Schestag},
title = {A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem},
journal = {CoRR},
volume = {abs/2307.03518},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.03518},
doi = {10.48550/ARXIV.2307.03518},
eprinttype = {arXiv},
eprint = {2307.03518},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-03518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/GruttemeierK22,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
title = {Learning Bayesian Networks Under Sparsity Constraints: {A} Parameterized
Complexity Analysis},
journal = {J. Artif. Intell. Res.},
volume = {74},
pages = {1225--1267},
year = {2022},
url = {https://doi.org/10.1613/jair.1.13138},
doi = {10.1613/JAIR.1.13138},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/GruttemeierK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GolovachKKL22,
author = {Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
title = {Refined notions of parameterized enumeration kernels with applications
to matching cut enumeration},
journal = {J. Comput. Syst. Sci.},
volume = {123},
pages = {76--102},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.07.005},
doi = {10.1016/J.JCSS.2021.07.005},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GolovachKKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MorawietzGKS22,
author = {Nils Morawietz and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
title = {Refined Parameterizations for Computing Colored Cuts in Edge-Colored
Graphs},
journal = {Theory Comput. Syst.},
volume = {66},
number = {5},
pages = {1019--1045},
year = {2022},
url = {https://doi.org/10.1007/s00224-022-10101-z},
doi = {10.1007/S00224-022-10101-Z},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MorawietzGKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KoanaKS22,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Exploiting {\textdollar}c{\textdollar}-Closure in Kernelization Algorithms
for Graph Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2798--2821},
year = {2022},
url = {https://doi.org/10.1137/21m1449476},
doi = {10.1137/21M1449476},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/KoanaKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MorawietzGKS22,
author = {Nils Morawietz and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
title = {Colored cut games},
journal = {Theor. Comput. Sci.},
volume = {936},
pages = {13--32},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.09.013},
doi = {10.1016/J.TCS.2022.09.013},
timestamp = {Tue, 08 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MorawietzGKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GarvardtKS22,
author = {Jaroslav Garvardt and
Christian Komusiewicz and
Frank Sommer},
editor = {Cristina Bazgan and
Henning Fernau},
title = {The Parameterized Complexity of s-Club with Triangle and Seed Constraints},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {313--326},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_23},
doi = {10.1007/978-3-031-06678-8\_23},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GarvardtKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/SchestagGKS22,
author = {Jannik Schestag and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
editor = {Cristina Bazgan and
Henning Fernau},
title = {On Critical Node Problems with Vulnerable Vertices},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {494--508},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_36},
doi = {10.1007/978-3-031-06678-8\_36},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/SchestagGKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KomusiewiczM22,
author = {Christian Komusiewicz and
Nils Morawietz},
editor = {Holger Dell and
Jesper Nederlof},
title = {Parameterized Local Search for Vertex Cover: When Only the Search
Radius Is Crucial},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {20:1--20:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.20},
doi = {10.4230/LIPICS.IPEC.2022.20},
timestamp = {Wed, 14 Dec 2022 11:56:17 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KomusiewiczM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KomusiewiczM22,
author = {Christian Komusiewicz and
Nils Morawietz},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {66:1--66:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.66},
doi = {10.4230/LIPICS.MFCS.2022.66},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KomusiewiczM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KoanaKNS22,
author = {Tomohiro Koana and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Frank Sommer},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Covering Many (Or Few) Edges with k Vertices in Sparse Graphs},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {42:1--42:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.42},
doi = {10.4230/LIPICS.STACS.2022.42},
timestamp = {Sat, 12 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KoanaKNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05465,
author = {Tomohiro Koana and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Frank Sommer},
title = {Covering Many (or Few) Edges with k Vertices in Sparse Graphs},
journal = {CoRR},
volume = {abs/2201.05465},
year = {2022},
url = {https://arxiv.org/abs/2201.05465},
eprinttype = {arXiv},
eprint = {2201.05465},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05654,
author = {Jaroslav Garvardt and
Christian Komusiewicz and
Frank Sommer},
title = {The Parameterized Complexity of s-Club with Triangle and Seed Constraints},
journal = {CoRR},
volume = {abs/2201.05654},
year = {2022},
url = {https://arxiv.org/abs/2201.05654},
eprinttype = {arXiv},
eprint = {2201.05654},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05654.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-02902,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
title = {Efficient Bayesian Network Structure Learning via Parameterized Local
Search on Topological Orderings},
journal = {CoRR},
volume = {abs/2204.02902},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.02902},
doi = {10.48550/ARXIV.2204.02902},
eprinttype = {arXiv},
eprint = {2204.02902},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-02902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-14197,
author = {Jana Holznigenkemper and
Christian Komusiewicz and
Bernhard Seeger},
title = {On Computing Exact Means of Time Series Using the Move-Split-Merge
Metric},
journal = {CoRR},
volume = {abs/2209.14197},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.14197},
doi = {10.48550/ARXIV.2209.14197},
eprinttype = {arXiv},
eprint = {2209.14197},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-14197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01701,
author = {Niels Gr{\"{u}}ttemeier and
Philipp Heinrich Ke{\ss}ler and
Christian Komusiewicz and
Frank Sommer},
title = {Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained
2-Clubs},
journal = {CoRR},
volume = {abs/2211.01701},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01701},
doi = {10.48550/ARXIV.2211.01701},
eprinttype = {arXiv},
eprint = {2211.01701},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BulteauFJK21,
author = {Laurent Bulteau and
Guillaume Fertin and
G{\'{e}}raldine Jean and
Christian Komusiewicz},
title = {Sorting by Multi-Cut Rearrangements},
journal = {Algorithms},
volume = {14},
number = {6},
pages = {169},
year = {2021},
url = {https://doi.org/10.3390/a14060169},
doi = {10.3390/A14060169},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BulteauFJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KomusiewiczS21,
author = {Christian Komusiewicz and
Frank Sommer},
title = {Enumerating connected induced subgraphs: Improved delay and experimental
comparison},
journal = {Discret. Appl. Math.},
volume = {303},
pages = {262--282},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.04.036},
doi = {10.1016/J.DAM.2020.04.036},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KomusiewiczS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/GruttemeierKSS21,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Jannik Schestag and
Frank Sommer},
title = {Destroying Bicolored P\({}_{\mbox{3}}\)s by Deleting Few Edges},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {23},
number = {1},
year = {2021},
url = {https://doi.org/10.46298/dmtcs.6108},
doi = {10.46298/DMTCS.6108},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/GruttemeierKSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BulteauGKS21,
author = {Laurent Bulteau and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Manuel Sorge},
title = {Your rugby mates don't need to know your colleagues: Triadic closure
with edge colors},
journal = {J. Comput. Syst. Sci.},
volume = {120},
pages = {75--96},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.03.001},
doi = {10.1016/J.JCSS.2021.03.001},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BulteauGKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GruttemeierKM21,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
title = {Efficient Bayesian Network Structure Learning via Parameterized Local
Search on Topological Orderings},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {12328--12335},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i14.17463},
doi = {10.1609/AAAI.V35I14.17463},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GruttemeierKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KomusiewiczM21,
author = {Christian Komusiewicz and
Nils Morawietz},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Can Local Optimality Be Used for Efficient Data Reduction?},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {354--366},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_25},
doi = {10.1007/978-3-030-75242-2\_25},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KomusiewiczM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GruttemeierKM21,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
editor = {Zhi{-}Hua Zhou},
title = {On the Parameterized Complexity of Polytree Learning},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {4221--4227},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/580},
doi = {10.24963/IJCAI.2021/580},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GruttemeierKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KoanaKS21,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Essentially Tight Kernels For (Weakly) Closed Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.35},
doi = {10.4230/LIPICS.ISAAC.2021.35},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KoanaKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BulteauFJK21,
author = {Laurent Bulteau and
Guillaume Fertin and
G{\'{e}}raldine Jean and
Christian Komusiewicz},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Sorting by Multi-cut Rearrangements},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {593--607},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_43},
doi = {10.1007/978-3-030-67731-2\_43},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BulteauFJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GolovachKKL21,
author = {Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Refined Notions of Parameterized Enumeration Kernels with Applications
to Matching Cut Enumeration},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {37:1--37:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.37},
doi = {10.4230/LIPICS.STACS.2021.37},
timestamp = {Thu, 11 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GolovachKKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GruttemeierKMS21,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz and
Frank Sommer},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Preventing Small (s,t)Cuts by Protecting Edges},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {143--155},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_11},
doi = {10.1007/978-3-030-86838-3\_11},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GruttemeierKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-03800,
author = {Petr A. Golovach and
Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
title = {Refined Notions of Parameterized Enumeration Kernels with Applications
to Matching Cut Enumeration},
journal = {CoRR},
volume = {abs/2101.03800},
year = {2021},
url = {https://arxiv.org/abs/2101.03800},
eprinttype = {arXiv},
eprint = {2101.03800},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-03800.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-03914,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Essentially Tight Kernels for (Weakly) Closed Graphs},
journal = {CoRR},
volume = {abs/2103.03914},
year = {2021},
url = {https://arxiv.org/abs/2103.03914},
eprinttype = {arXiv},
eprint = {2103.03914},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-03914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-03138,
author = {Nils Jakob Eckstein and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
title = {Destroying Multicolored Paths and Cycles in Edge-Colored Graphs},
journal = {CoRR},
volume = {abs/2104.03138},
year = {2021},
url = {https://arxiv.org/abs/2104.03138},
eprinttype = {arXiv},
eprint = {2104.03138},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-03138.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-14171,
author = {Laurent Bulteau and
Michael R. Fellows and
Christian Komusiewicz and
Frances A. Rosamond},
title = {Parameterized String Equations},
journal = {CoRR},
volume = {abs/2104.14171},
year = {2021},
url = {https://arxiv.org/abs/2104.14171},
eprinttype = {arXiv},
eprint = {2104.14171},
timestamp = {Tue, 04 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-14171.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-09675,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
title = {On the Parameterized Complexity of Polytree Learning},
journal = {CoRR},
volume = {abs/2105.09675},
year = {2021},
url = {https://arxiv.org/abs/2105.09675},
eprinttype = {arXiv},
eprint = {2105.09675},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-09675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04482,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz and
Frank Sommer},
title = {Preventing Small (s, t)-Cuts by Protecting Edges},
journal = {CoRR},
volume = {abs/2107.04482},
year = {2021},
url = {https://arxiv.org/abs/2107.04482},
eprinttype = {arXiv},
eprint = {2107.04482},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04482.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GruttemeierK20,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
title = {On the Relation of Strong Triadic Closure and Cluster Deletion},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {853--880},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00617-1},
doi = {10.1007/S00453-019-00617-1},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GruttemeierK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KomusiewiczKL20,
author = {Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
title = {Matching cut: Kernelization, single-exponential time FPT, and exact
exponential algorithms},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {44--58},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.12.010},
doi = {10.1016/J.DAM.2019.12.010},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KomusiewiczKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SommerK20,
author = {Frank Sommer and
Christian Komusiewicz},
title = {Parameterized algorithms for Module Map problems},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {396--416},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.01.029},
doi = {10.1016/J.DAM.2020.01.029},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/SommerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FertinK20,
author = {Guillaume Fertin and
Christian Komusiewicz},
title = {Graph Motif Problems Parameterized by Dual},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {371--396},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00538},
doi = {10.7155/JGAA.00538},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FertinK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qss/BevernKMNSW20,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
title = {h-Index manipulation by undoing merges},
journal = {Quant. Sci. Stud.},
volume = {1},
number = {4},
pages = {1529--1552},
year = {2020},
url = {https://doi.org/10.1162/qss\_a\_00093},
doi = {10.1162/QSS\_A\_00093},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qss/BevernKMNSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KanjKSL20,
author = {Iyad Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices
Around},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {640--681},
year = {2020},
url = {https://doi.org/10.1137/19M1239362},
doi = {10.1137/19M1239362},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KanjKSL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KomusiewiczOZ20,
author = {Christian Komusiewicz and
Mateus de Oliveira Oliveira and
Meirav Zehavi},
title = {Revisiting the parameterized complexity of Maximum-Duo Preservation
String Mapping},
journal = {Theor. Comput. Sci.},
volume = {847},
pages = {27--38},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.034},
doi = {10.1016/J.TCS.2020.09.034},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KomusiewiczOZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/KomusiewiczS20,
author = {Christian Komusiewicz and
Frank Sommer},
editor = {Guy E. Blelloch and
Irene Finocchi},
title = {FixCon: {A} Generic Solver for Fixed-Cardinality Subgraph Problems},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2020, Salt Lake City, UT, USA, January 5-6, 2020},
pages = {12--26},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976007.2},
doi = {10.1137/1.9781611976007.2},
timestamp = {Fri, 31 Jan 2020 14:05:23 +0100},
biburl = {https://dblp.org/rec/conf/alenex/KomusiewiczS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GruttemeierKMS20,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz and
Frank Sommer},
editor = {Inge Li G{\o}rtz and
Oren Weimann},
title = {String Factorizations Under Various Collision Constraints},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020,
June 17-19, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {161},
pages = {17:1--17:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CPM.2020.17},
doi = {10.4230/LIPICS.CPM.2020.17},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GruttemeierKMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KoanaKS20,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Exploiting c-Closure in Kernelization Algorithms for Graph Problems},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {65:1--65:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.65},
doi = {10.4230/LIPICS.ESA.2020.65},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KoanaKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MorawietzGKS20,
author = {Nils Morawietz and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
editor = {Nitin Saxena and
Sunil Simon},
title = {Colored Cut Games},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
{BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
series = {LIPIcs},
volume = {182},
pages = {30:1--30:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.30},
doi = {10.4230/LIPICS.FSTTCS.2020.30},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MorawietzGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GruttemeierK20,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
editor = {Christian Bessiere},
title = {Learning Bayesian Networks Under Sparsity Constraints: {A} Parameterized
Complexity Analysis},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {4245--4251},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/586},
doi = {10.24963/IJCAI.2020/586},
timestamp = {Mon, 20 Jul 2020 12:38:52 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GruttemeierK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KoanaKS20,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.20},
doi = {10.4230/LIPICS.ISAAC.2020.20},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KoanaKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/MorawietzGKS20,
author = {Nils Morawietz and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
editor = {Alexander Chatzigeorgiou and
Riccardo Dondi and
Herodotos Herodotou and
Christos A. Kapoutsis and
Yannis Manolopoulos and
George A. Papadopoulos and
Florian Sikora},
title = {Refined Parameterizations for Computing Colored Cuts in Edge-Colored
Graphs},
booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International
Conference on Current Trends in Theory and Practice of Informatics,
{SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12011},
pages = {248--259},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-38919-2\_21},
doi = {10.1007/978-3-030-38919-2\_21},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/MorawietzGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GruttemeierKM20,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
editor = {Susanne Albers},
title = {Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized
by Distance to Low-Degree Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {26:1--26:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.26},
doi = {10.4230/LIPICS.SWAT.2020.26},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GruttemeierKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-08659,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
title = {Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized
by Distance to Low-Degree Graphs},
journal = {CoRR},
volume = {abs/2002.08659},
year = {2020},
url = {https://arxiv.org/abs/2002.08659},
eprinttype = {arXiv},
eprint = {2002.08659},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-08659.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-14724,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
title = {Learning Bayesian Networks Under Sparsity Constraints: {A} Parameterized
Complexity Analysis},
journal = {CoRR},
volume = {abs/2004.14724},
year = {2020},
url = {https://arxiv.org/abs/2004.14724},
eprinttype = {arXiv},
eprint = {2004.14724},
timestamp = {Sun, 03 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-14724.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-03986,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Exploiting {\textdollar}{\textbackslash}mathbf\{c\}{\textdollar}-Closure
in Kernelization Algorithms for Graph Problems},
journal = {CoRR},
volume = {abs/2005.03986},
year = {2020},
url = {https://arxiv.org/abs/2005.03986},
eprinttype = {arXiv},
eprint = {2005.03986},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-03986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-05630,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
title = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs},
journal = {CoRR},
volume = {abs/2007.05630},
year = {2020},
url = {https://arxiv.org/abs/2007.05630},
eprinttype = {arXiv},
eprint = {2007.05630},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-05630.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FluschnikKMNNT19,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
title = {When Can Graph Hyperbolicity be Computed in Linear Time?},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2016--2045},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0522-6},
doi = {10.1007/S00453-018-0522-6},
timestamp = {Wed, 17 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FluschnikKMNNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KomusiewiczNNP19,
author = {Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Marten Picker},
title = {Exact algorithms for finding well-connected 2-clubs in sparse real-world
graphs: Theory and experiments},
journal = {Eur. J. Oper. Res.},
volume = {275},
number = {3},
pages = {846--864},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.12.006},
doi = {10.1016/J.EJOR.2018.12.006},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KomusiewiczNNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netsci/BredereckKKMNS19,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Assessing the computational complexity of multilayer subgraph detection},
journal = {Netw. Sci.},
volume = {7},
number = {2},
pages = {215--241},
year = {2019},
url = {https://doi.org/10.1017/nws.2019.13},
doi = {10.1017/NWS.2019.13},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/netsci/BredereckKKMNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BulteauGKS19,
author = {Laurent Bulteau and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Manuel Sorge},
editor = {Pinar Heggernes},
title = {Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure
with Edge Colors},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {99--111},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_9},
doi = {10.1007/978-3-030-17402-6\_9},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BulteauGKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/GruttemeierKSS19,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Jannik Schestag and
Frank Sommer},
editor = {Florin Manea and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Giuseppe Primiero},
title = {Destroying Bicolored P\({}_{\mbox{3}}\)s by Deleting Few Edges},
booktitle = {Computing with Foresight and Industry - 15th Conference on Computability
in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11558},
pages = {193--204},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22996-2\_17},
doi = {10.1007/978-3-030-22996-2\_17},
timestamp = {Sun, 25 Oct 2020 22:53:05 +0100},
biburl = {https://dblp.org/rec/conf/cie/GruttemeierKSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KomusiewiczS19,
author = {Christian Komusiewicz and
Frank Sommer},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {Enumerating Connected Induced Subgraphs: Improved Delay and Experimental
Comparison},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {272--284},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_22},
doi = {10.1007/978-3-030-10801-4\_22},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/KomusiewiczS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03627,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Jannik Schestag and
Frank Sommer},
title = {Destroying Bicolored P\({}_{\mbox{3}}\)s by Deleting Few Edges},
journal = {CoRR},
volume = {abs/1901.03627},
year = {2019},
url = {http://arxiv.org/abs/1901.03627},
eprinttype = {arXiv},
eprint = {1901.03627},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-03627.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-03870,
author = {Guillaume Fertin and
Christian Komusiewicz},
title = {Graph Motif Problems Parameterized by Dual},
journal = {CoRR},
volume = {abs/1908.03870},
year = {2019},
url = {http://arxiv.org/abs/1908.03870},
eprinttype = {arXiv},
eprint = {1908.03870},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-03870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candc/FertinHKS18,
author = {Guillaume Fertin and
Falk H{\"{u}}ffner and
Christian Komusiewicz and
Manuel Sorge},
title = {Matching algorithms for assigning orthologs after genome duplication
events},
journal = {Comput. Biol. Chem.},
volume = {74},
pages = {379--390},
year = {2018},
url = {https://doi.org/10.1016/j.compbiolchem.2018.03.015},
doi = {10.1016/J.COMPBIOLCHEM.2018.03.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/candc/FertinHKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KanjKSL18,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Parameterized algorithms for recognizing monopolar and 2-subcolorable
graphs},
journal = {J. Comput. Syst. Sci.},
volume = {92},
pages = {22--47},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2017.08.002},
doi = {10.1016/J.JCSS.2017.08.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KanjKSL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BevernFK18,
author = {Ren{\'{e}} van Bevern and
Vincent Froese and
Christian Komusiewicz},
title = {Parameterizing Edge Modification Problems Above Lower Bounds},
journal = {Theory Comput. Syst.},
volume = {62},
number = {3},
pages = {739--770},
year = {2018},
url = {https://doi.org/10.1007/s00224-016-9746-5},
doi = {10.1007/S00224-016-9746-5},
timestamp = {Sat, 17 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BevernFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/Komusiewicz18,
author = {Christian Komusiewicz},
title = {Tight Running Time Lower Bounds for Vertex Deletion Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {10},
number = {2},
pages = {6:1--6:18},
year = {2018},
url = {https://doi.org/10.1145/3186589},
doi = {10.1145/3186589},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/Komusiewicz18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FertinFK18,
author = {Guillaume Fertin and
Julien Fradin and
Christian Komusiewicz},
editor = {Gonzalo Navarro and
David Sankoff and
Binhai Zhu},
title = {On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph
Structure},
booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, July
2-4, 2018 - Qingdao, China},
series = {LIPIcs},
volume = {105},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CPM.2018.17},
doi = {10.4230/LIPICS.CPM.2018.17},
timestamp = {Wed, 28 Feb 2024 00:16:40 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FertinFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KanjKSL18,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices
Around},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.51},
doi = {10.4230/LIPICS.ESA.2018.51},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/KanjKSL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/SommerK18,
author = {Frank Sommer and
Christian Komusiewicz},
editor = {Jon Lee and
Giovanni Rinaldi and
Ali Ridha Mahjoub},
title = {Parameterized Algorithms for Module Map Problems},
booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10856},
pages = {376--388},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96151-4\_32},
doi = {10.1007/978-3-319-96151-4\_32},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/SommerK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KomusiewiczKL18,
author = {Christian Komusiewicz and
Dieter Kratsch and
Van Bang Le},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact
Exponential Algorithms},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.19},
doi = {10.4230/LIPICS.IPEC.2018.19},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KomusiewiczKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GruttemeierK18,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {On the Relation of Strong Triadic Closure and Cluster Deletion},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {239--251},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_20},
doi = {10.1007/978-3-030-00256-5\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GruttemeierK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00807,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz},
title = {On the Relation of Strong Triadic Closure and Cluster Deletion},
journal = {CoRR},
volume = {abs/1803.00807},
year = {2018},
url = {http://arxiv.org/abs/1803.00807},
eprinttype = {arXiv},
eprint = {1803.00807},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00807.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07516,
author = {Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Marten Picker},
title = {Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World
Graphs: Theory and Experiments},
journal = {CoRR},
volume = {abs/1807.07516},
year = {2018},
url = {http://arxiv.org/abs/1807.07516},
eprinttype = {arXiv},
eprint = {1807.07516},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07516.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-08772,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices
Around},
journal = {CoRR},
volume = {abs/1808.08772},
year = {2018},
url = {http://arxiv.org/abs/1808.08772},
eprinttype = {arXiv},
eprint = {1808.08772},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-08772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-09411,
author = {Laurent Bulteau and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Manuel Sorge},
title = {Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure
with Edge Colors},
journal = {CoRR},
volume = {abs/1811.09411},
year = {2018},
url = {http://arxiv.org/abs/1811.09411},
eprinttype = {arXiv},
eprint = {1811.09411},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-09411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BevernKS17,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Manuel Sorge},
title = {A parameterized approximation algorithm for the mixed and windy capacitated
arc routing problem: Theory and experiments},
journal = {Networks},
volume = {70},
number = {3},
pages = {262--278},
year = {2017},
url = {https://doi.org/10.1002/net.21742},
doi = {10.1002/NET.21742},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BevernKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/KatzmannK17,
author = {Maximilian Katzmann and
Christian Komusiewicz},
editor = {Satinder Singh and
Shaul Markovitch},
title = {Systematic Exploration of Larger Local Search Neighborhoods for the
Minimum Vertex Cover Problem},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {846--852},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.10659},
doi = {10.1609/AAAI.V31I1.10659},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/KatzmannK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BredereckKKMNS17,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Assessing the Computational Complexity of Multi-layer Subgraph Detection},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {128--139},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_12},
doi = {10.1007/978-3-319-57586-5\_12},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BredereckKKMNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KomusiewiczOZ17,
author = {Christian Komusiewicz and
Mateus de Oliveira Oliveira and
Meirav Zehavi},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Revisiting the Parameterized Complexity of Maximum-Duo Preservation
String Mapping},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {11:1--11:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.11},
doi = {10.4230/LIPICS.CPM.2017.11},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/KomusiewiczOZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauFK17,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Beyond Adjacency Maximization: Scaffold Filling for New String Distances},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {27:1--27:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.27},
doi = {10.4230/LIPICS.CPM.2017.27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauFK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DellKTW17,
author = {Holger Dell and
Christian Komusiewicz and
Nimrod Talmon and
Mathias Weller},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {The {PACE} 2017 Parameterized Algorithms and Computational Experiments
Challenge: The Second Iteration},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {30:1--30:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.30},
doi = {10.4230/LIPICS.IPEC.2017.30},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DellKTW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FluschnikKMNNT17,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {When Can Graph Hyperbolicity Be Computed in Linear Time?},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {397--408},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_34},
doi = {10.1007/978-3-319-62127-2\_34},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/FluschnikKMNNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanjKSL17,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable
Graphs},
journal = {CoRR},
volume = {abs/1702.04322},
year = {2017},
url = {http://arxiv.org/abs/1702.04322},
eprinttype = {arXiv},
eprint = {1702.04322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KanjKSL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikKMNNT17,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
title = {When can Graph Hyperbolicity be computed in Linear Time?},
journal = {CoRR},
volume = {abs/1702.06503},
year = {2017},
url = {http://arxiv.org/abs/1702.06503},
eprinttype = {arXiv},
eprint = {1702.06503},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikKMNNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-07584,
author = {Guillaume Fertin and
Julien Fradin and
Christian Komusiewicz},
title = {The Maximum Colorful Arborescence problem parameterized by the structure
of its color hierarchy graph},
journal = {CoRR},
volume = {abs/1710.07584},
year = {2017},
url = {http://arxiv.org/abs/1710.07584},
eprinttype = {arXiv},
eprint = {1710.07584},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-07584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/BevernKNSW16,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
title = {H-index manipulation by merging articles: Models, theory, and experiments},
journal = {Artif. Intell.},
volume = {240},
pages = {19--35},
year = {2016},
url = {https://doi.org/10.1016/j.artint.2016.08.001},
doi = {10.1016/J.ARTINT.2016.08.001},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/BevernKNSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/Komusiewicz16,
author = {Christian Komusiewicz},
title = {Multivariate Algorithmics for Finding Cohesive Subnetworks},
journal = {Algorithms},
volume = {9},
number = {1},
pages = {21},
year = {2016},
url = {https://doi.org/10.3390/a9010021},
doi = {10.3390/A9010021},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/Komusiewicz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BulteauFK16,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
title = {(Prefix) reversal distance for (signed) strings with few blocks or
small alphabets},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {44--55},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.05.002},
doi = {10.1016/J.JDA.2016.05.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BulteauFK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HermelinKKN16,
author = {Danny Hermelin and
Moshe Kaspi and
Christian Komusiewicz and
Barak Navon},
title = {Parameterized complexity of critical node cuts},
journal = {Theor. Comput. Sci.},
volume = {651},
pages = {62--75},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.08.018},
doi = {10.1016/J.TCS.2016.08.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HermelinKKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FertinK16,
author = {Guillaume Fertin and
Christian Komusiewicz},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {Graph Motif Problems Parameterized by Dual},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {7:1--7:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.7},
doi = {10.4230/LIPICS.CPM.2016.7},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FertinK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BevernFK16,
author = {Ren{\'{e}} van Bevern and
Vincent Froese and
Christian Komusiewicz},
editor = {Alexander S. Kulikov and
Gerhard J. Woeginger},
title = {Parameterizing Edge Modification Problems Above Lower Bounds},
booktitle = {Computer Science - Theory and Applications - 11th International Computer
Science Symposium in Russia, {CSR} 2016, St. Petersburg, Russia, June
9-13, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9691},
pages = {57--72},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-34171-2\_5},
doi = {10.1007/978-3-319-34171-2\_5},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BevernFK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/door/BevernBBKTW16,
author = {Ren{\'{e}} van Bevern and
Robert Bredereck and
Laurent Bulteau and
Christian Komusiewicz and
Nimrod Talmon and
Gerhard J. Woeginger},
editor = {Yury Kochetov and
Michael Yu. Khachay and
Vladimir L. Beresnev and
Evgeni A. Nurminski and
Panos M. Pardalos},
title = {Precedence-Constrained Scheduling Problems Parameterized by Partial
Order Width},
booktitle = {Discrete Optimization and Operations Research - 9th International
Conference, {DOOR} 2016, Vladivostok, Russia, September 19-23, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9869},
pages = {105--120},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44914-2\_9},
doi = {10.1007/978-3-319-44914-2\_9},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/door/BevernBBKTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BevernKMNSW16,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
editor = {Gal A. Kaminka and
Maria Fox and
Paolo Bouquet and
Eyke H{\"{u}}llermeier and
Virginia Dignum and
Frank Dignum and
Frank van Harmelen},
title = {h-Index Manipulation by Undoing Merges},
booktitle = {{ECAI} 2016 - 22nd European Conference on Artificial Intelligence,
29 August-2 September 2016, The Hague, The Netherlands - Including
Prestigious Applications of Artificial Intelligence {(PAIS} 2016)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {285},
pages = {895--903},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-672-9-895},
doi = {10.3233/978-1-61499-672-9-895},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/ecai/BevernKMNSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BevernKKNS16,
author = {Ren{\'{e}} van Bevern and
Iyad A. Kanj and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Twins in Subdivision Drawings of Hypergraphs},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {67--80},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_6},
doi = {10.1007/978-3-319-50106-2\_6},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/BevernKKNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DellHJKKR16,
author = {Holger Dell and
Thore Husfeldt and
Bart M. P. Jansen and
Petteri Kaski and
Christian Komusiewicz and
Frances A. Rosamond},
editor = {Jiong Guo and
Danny Hermelin},
title = {The First Parameterized Algorithms and Computational Experiments Challenge},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {30:1--30:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.30},
doi = {10.4230/LIPICS.IPEC.2016.30},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DellHJKKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KanjKSL16,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
editor = {Rasmus Pagh},
title = {Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable
Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.14},
doi = {10.4230/LIPICS.SWAT.2016.14},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/KanjKSL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Komusiewicz16,
author = {Christian Komusiewicz},
title = {Kernelization, Partially Polynomial Kernels},
booktitle = {Encyclopedia of Algorithms},
pages = {1028--1031},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_530},
doi = {10.1007/978-1-4939-2864-4\_530},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Komusiewicz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKMNSW16,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
title = {h-Index Manipulation by Undoing Merges},
journal = {CoRR},
volume = {abs/1604.04827},
year = {2016},
url = {http://arxiv.org/abs/1604.04827},
eprinttype = {arXiv},
eprint = {1604.04827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKMNSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BredereckKKMNS16,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Assessing the Computational Complexity of Multi-Layer Subgraph Detection},
journal = {CoRR},
volume = {abs/1604.07724},
year = {2016},
url = {http://arxiv.org/abs/1604.07724},
eprinttype = {arXiv},
eprint = {1604.07724},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BredereckKKMNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernBBKTW16,
author = {Ren{\'{e}} van Bevern and
Robert Bredereck and
Laurent Bulteau and
Christian Komusiewicz and
Nimrod Talmon and
Gerhard J. Woeginger},
title = {Precedence-constrained scheduling problems parameterized by partial
order width},
journal = {CoRR},
volume = {abs/1605.00901},
year = {2016},
url = {http://arxiv.org/abs/1605.00901},
eprinttype = {arXiv},
eprint = {1605.00901},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernBBKTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KomusiewiczNN16,
author = {Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Parameterized Algorithmics for Graph Modification Problems: On Interactions
with Heuristics},
journal = {CoRR},
volume = {abs/1606.03268},
year = {2016},
url = {http://arxiv.org/abs/1606.03268},
eprinttype = {arXiv},
eprint = {1606.03268},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KomusiewiczNN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/HuffnerKNR15,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Rolf Niedermeier and
Martin R{\"{o}}tzschke},
title = {The Parameterized Complexity of the Rainbow Subgraph Problem},
journal = {Algorithms},
volume = {8},
number = {1},
pages = {60--81},
year = {2015},
url = {https://doi.org/10.3390/a8010060},
doi = {10.3390/A8010060},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/HuffnerKNR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/FertinKMR15,
author = {Guillaume Fertin and
Christian Komusiewicz and
Hafedh Mohamed{-}Babou and
Irena Rusu},
title = {Finding Supported Paths in Heterogeneous Networks},
journal = {Algorithms},
volume = {8},
number = {4},
pages = {810--831},
year = {2015},
url = {https://doi.org/10.3390/a8040810},
doi = {10.3390/A8040810},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/FertinKMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/BrucknerHK15,
author = {Sharon Bruckner and
Falk H{\"{u}}ffner and
Christian Komusiewicz},
title = {A graph modification approach for finding core-periphery structures
in protein interaction networks},
journal = {Algorithms Mol. Biol.},
volume = {10},
pages = {16},
year = {2015},
url = {https://doi.org/10.1186/s13015-015-0043-7},
doi = {10.1186/S13015-015-0043-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/BrucknerHK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HartungKNS15,
author = {Sepp Hartung and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Ondrej Such{\'{y}}},
title = {On structural parameterizations for the 2-club problem},
journal = {Discret. Appl. Math.},
volume = {185},
pages = {79--92},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.11.026},
doi = {10.1016/J.DAM.2014.11.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HartungKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KomusiewiczS15,
author = {Christian Komusiewicz and
Manuel Sorge},
title = {An algorithmic framework for fixed-cardinality optimization in sparse
graphs applied to dense subgraph problems},
journal = {Discret. Appl. Math.},
volume = {193},
pages = {145--161},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.04.029},
doi = {10.1016/J.DAM.2015.04.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KomusiewiczS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BredereckCHKNS15,
author = {Robert Bredereck and
Jiehua Chen and
Sepp Hartung and
Christian Komusiewicz and
Rolf Niedermeier and
Ondrej Such{\'{y}}},
title = {On explaining integer vectors by few homogeneous segments},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {4},
pages = {766--782},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.12.028},
doi = {10.1016/J.JCSS.2014.12.028},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BredereckCHKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HartungKN15,
author = {Sepp Hartung and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein},
title = {Parameterized Algorithmics and Computational Experiments for Finding
2-Clubs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {155--190},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00352},
doi = {10.7155/JGAA.00352},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HartungKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChenKNSSW15,
author = {Jiehua Chen and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge and
Ondrej Such{\'{y}} and
Mathias Weller},
title = {Polynomial-Time Data Reduction for the Subset Interconnection Design
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {1--25},
year = {2015},
url = {https://doi.org/10.1137/140955057},
doi = {10.1137/140955057},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChenKNSSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FertinJK15,
author = {Guillaume Fertin and
Shahrad Jamshidi and
Christian Komusiewicz},
title = {Towards an algorithmic guide to Spiral Galaxies},
journal = {Theor. Comput. Sci.},
volume = {586},
pages = {26--39},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.051},
doi = {10.1016/J.TCS.2015.01.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FertinJK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/BevernKS15,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Manuel Sorge},
editor = {Giuseppe F. Italiano and
Marie Schmidt},
title = {Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing
Problems},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2015, September 17, 2015, Patras,
Greece},
series = {OASIcs},
volume = {48},
pages = {130--143},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2015.130},
doi = {10.4230/OASICS.ATMOS.2015.130},
timestamp = {Tue, 15 Feb 2022 09:40:04 +0100},
biburl = {https://dblp.org/rec/conf/atmos/BevernKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/KomusiewiczR15,
author = {Christian Komusiewicz and
Andreea Radulescu},
editor = {Jianxin Wang and
Chee{-}Keng Yap},
title = {On the Sound Covering Cycle Problem in Paired de Bruijn Graphs},
booktitle = {Frontiers in Algorithmics - 9th International Workshop, {FAW} 2015,
Guilin, China, July 3-5, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9130},
pages = {150--161},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19647-3\_14},
doi = {10.1007/978-3-319-19647-3\_14},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/KomusiewiczR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BevernKNSW15,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
editor = {Qiang Yang and
Michael J. Wooldridge},
title = {H-Index Manipulation by Merging Articles: Models, Theory, and Experiments},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},
pages = {808--814},
publisher = {{AAAI} Press},
year = {2015},
url = {http://ijcai.org/Abstract/15/119},
timestamp = {Tue, 20 Aug 2019 16:16:43 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/BevernKNSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HermelinKKN15,
author = {Danny Hermelin and
Moshe Kaspi and
Christian Komusiewicz and
Barak Navon},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Parameterized Complexity of Critical Node Cuts},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {343--354},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.343},
doi = {10.4230/LIPICS.IPEC.2015.343},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HermelinKKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HuffnerKS15,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Manuel Sorge},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {Finding Highly Connected Subgraphs},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {254--265},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_21},
doi = {10.1007/978-3-662-46078-8\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HuffnerKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/HuffnerKN15,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization
Schemes},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {410--421},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_34},
doi = {10.1007/978-3-319-21840-3\_34},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/HuffnerKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/KomusiewiczSS15,
author = {Christian Komusiewicz and
Manuel Sorge and
Kolja Stahl},
editor = {Evripidis Bampis},
title = {Finding Connected Subgraphs of Fixed Minimum Density: Implementation
and Experiments},
booktitle = {Experimental Algorithms - 14th International Symposium, {SEA} 2015,
Paris, France, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9125},
pages = {82--93},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20086-6\_7},
doi = {10.1007/978-3-319-20086-6\_7},
timestamp = {Thu, 23 Sep 2021 11:47:32 +0200},
biburl = {https://dblp.org/rec/conf/wea/KomusiewiczSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KomusiewiczNN15,
author = {Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Ernst W. Mayr},
title = {Parameterized Algorithmics for Graph Modification Problems: On Interactions
with Heuristics},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {3--15},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_1},
doi = {10.1007/978-3-662-53174-7\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KomusiewiczNN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HermelinKKN15,
author = {Danny Hermelin and
Moshe Kaspi and
Christian Komusiewicz and
Barak Navon},
title = {Parameterized Complexity of Critical Node Cuts},
journal = {CoRR},
volume = {abs/1503.06321},
year = {2015},
url = {http://arxiv.org/abs/1503.06321},
eprinttype = {arXiv},
eprint = {1503.06321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HermelinKKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKS15,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Manuel Sorge},
title = {Approximation algorithms for mixed, windy, and capacitated arc routing
problems},
journal = {CoRR},
volume = {abs/1506.05620},
year = {2015},
url = {http://arxiv.org/abs/1506.05620},
eprinttype = {arXiv},
eprint = {1506.05620},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKKNS15,
author = {Ren{\'{e}} van Bevern and
Iyad A. Kanj and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge},
title = {Well-Formed Separator Sequences, with an Application to Hypergraph
Drawing},
journal = {CoRR},
volume = {abs/1507.02350},
year = {2015},
url = {http://arxiv.org/abs/1507.02350},
eprinttype = {arXiv},
eprint = {1507.02350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Komusiewicz15,
author = {Christian Komusiewicz},
title = {Tight Running Time Lower Bounds for Vertex Deletion Problems},
journal = {CoRR},
volume = {abs/1511.05449},
year = {2015},
url = {http://arxiv.org/abs/1511.05449},
eprinttype = {arXiv},
eprint = {1511.05449},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Komusiewicz15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKKNS15a,
author = {Ren{\'{e}} van Bevern and
Iyad A. Kanj and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge},
title = {Twins in Subdivision Drawings of Hypergraphs},
journal = {CoRR},
volume = {abs/1511.09389},
year = {2015},
url = {http://arxiv.org/abs/1511.09389},
eprinttype = {arXiv},
eprint = {1511.09389},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKKNS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernFK15,
author = {Ren{\'{e}} van Bevern and
Vincent Froese and
Christian Komusiewicz},
title = {Parameterizing edge modification problems above lower bounds},
journal = {CoRR},
volume = {abs/1512.04047},
year = {2015},
url = {http://arxiv.org/abs/1512.04047},
eprinttype = {arXiv},
eprint = {1512.04047},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernFK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KomusiewiczU14,
author = {Christian Komusiewicz and
Johannes Uhlmann},
title = {A Cubic-Vertex Kernel for Flip Consensus Tree},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {81--108},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9663-1},
doi = {10.1007/S00453-012-9663-1},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KomusiewiczU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/BulteauHKN14,
author = {Laurent Bulteau and
Falk H{\"{u}}ffner and
Christian Komusiewicz and
Rolf Niedermeier},
title = {Multivariate Algorithmics for NP-Hard String Problems},
journal = {Bull. {EATCS}},
volume = {114},
year = {2014},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/310},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/BulteauHKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/HuffnerKLN14,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Adrian Liebtrau and
Rolf Niedermeier},
title = {Partitioning Biological Networks into Highly Connected Clusters with
Maximum Edge Coverage},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {11},
number = {3},
pages = {455--467},
year = {2014},
url = {https://doi.org/10.1109/TCBB.2013.177},
doi = {10.1109/TCBB.2013.177},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/HuffnerKLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuoHK14,
author = {Jiong Guo and
Danny Hermelin and
Christian Komusiewicz},
title = {Local search for string problems: Brute-force is essentially optimal},
journal = {Theor. Comput. Sci.},
volume = {525},
pages = {30--41},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.05.006},
doi = {10.1016/J.TCS.2013.05.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuoHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DornfelderGKW14,
author = {Martin D{\"{o}}rnfelder and
Jiong Guo and
Christian Komusiewicz and
Mathias Weller},
title = {On the parameterized complexity of consensus clustering},
journal = {Theor. Comput. Sci.},
volume = {542},
pages = {71--82},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.05.002},
doi = {10.1016/J.TCS.2014.05.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DornfelderGKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauFK14,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
editor = {Alexander S. Kulikov and
Sergei O. Kuznetsov and
Pavel A. Pevzner},
title = {Reversal Distances for Strings with Few Blocks or Small Alphabets},
booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014,
Moscow, Russia, June 16-18, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8486},
pages = {50--59},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07566-2\_6},
doi = {10.1007/978-3-319-07566-2\_6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauFK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/FertinJK14,
author = {Guillaume Fertin and
Shahrad Jamshidi and
Christian Komusiewicz},
editor = {Alfredo Ferro and
Fabrizio Luccio and
Peter Widmayer},
title = {Towards an Algorithmic Guide to Spiral Galaxies},
booktitle = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari
Island, Sicily, Italy, July 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8496},
pages = {171--182},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07890-8\_15},
doi = {10.1007/978-3-319-07890-8\_15},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/FertinJK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BulteauK14,
author = {Laurent Bulteau and
Christian Komusiewicz},
editor = {Chandra Chekuri},
title = {Minimum Common String Partition Parameterized by Partition Size Is
Fixed-Parameter Tractable},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {102--121},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.8},
doi = {10.1137/1.9781611973402.8},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BulteauK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BrucknerHK14,
author = {Sharon Bruckner and
Falk H{\"{u}}ffner and
Christian Komusiewicz},
editor = {Daniel G. Brown and
Burkhard Morgenstern},
title = {A Graph Modification Approach for Finding Core-Periphery Structures
in Protein Interaction Networks},
booktitle = {Algorithms in Bioinformatics - 14th International Workshop, {WABI}
2014, Wroclaw, Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8701},
pages = {340--351},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44753-6\_25},
doi = {10.1007/978-3-662-44753-6\_25},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BrucknerHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HuffnerKNR14,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Rolf Niedermeier and
Martin R{\"{o}}tzschke},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {The Parameterized Complexity of the Rainbow Subgraph Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {287--298},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_24},
doi = {10.1007/978-3-319-12340-0\_24},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HuffnerKNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKNSW14,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
title = {On Google Scholar H-Index Manipulation by Merging Articles},
journal = {CoRR},
volume = {abs/1412.5498},
year = {2014},
url = {http://arxiv.org/abs/1412.5498},
eprinttype = {arXiv},
eprint = {1412.5498},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKNSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GuoHK13,
author = {Jiong Guo and
Danny Hermelin and
Christian Komusiewicz},
editor = {Johannes Fischer and
Peter Sanders},
title = {Local Search for String Problems: Brute Force Is Essentially Optimal},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7922},
pages = {130--141},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38905-4\_14},
doi = {10.1007/978-3-642-38905-4\_14},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GuoHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenKNSSW13,
author = {Jiehua Chen and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge and
Ondrej Such{\'{y}} and
Mathias Weller},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Effective and Efficient Data Reduction for the Subset Interconnection
Design Problem},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {361--371},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_34},
doi = {10.1007/978-3-642-45030-3\_34},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenKNSSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/HuffnerKLN13,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Adrian Liebtrau and
Rolf Niedermeier},
editor = {Zhipeng Cai and
Oliver Eulenstein and
Daniel Janies and
Daniel Schwartz},
title = {Partitioning Biological Networks into Highly Connected Clusters with
Maximum Edge Coverage},
booktitle = {Bioinformatics Research and Applications, 9th International Symposium,
{ISBRA} 2013, Charlotte, NC, USA, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7875},
pages = {99--111},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38036-5\_13},
doi = {10.1007/978-3-642-38036-5\_13},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isbra/HuffnerKLN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HartungKN13,
author = {Sepp Hartung and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein},
editor = {Peter van Emde Boas and
Frans C. A. Groen and
Giuseppe F. Italiano and
Jerzy R. Nawrocki and
Harald Sack},
title = {On Structural Parameterizations for the 2-Club Problem},
booktitle = {{SOFSEM} 2013: Theory and Practice of Computer Science, 39th International
Conference on Current Trends in Theory and Practice of Computer Science,
{\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 26-31,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7741},
pages = {233--243},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35843-2\_21},
doi = {10.1007/978-3-642-35843-2\_21},
timestamp = {Mon, 28 Aug 2023 21:17:48 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HartungKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BulteauFKR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz and
Irena Rusu},
editor = {Aaron E. Darling and
Jens Stoye},
title = {A Fixed-Parameter Algorithm for Minimum Common String Partition with
Few Duplications},
booktitle = {Algorithms in Bioinformatics - 13th International Workshop, {WABI}
2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8126},
pages = {244--258},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40453-5\_19},
doi = {10.1007/978-3-642-40453-5\_19},
timestamp = {Tue, 21 Mar 2023 21:00:29 +0100},
biburl = {https://dblp.org/rec/conf/wabi/BulteauFKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BredereckCHKNS13,
author = {Robert Bredereck and
Jiehua Chen and
Sepp Hartung and
Christian Komusiewicz and
Rolf Niedermeier and
Ondrej Such{\'{y}}},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {On Explaining Integer Vectors by Few Homogenous Segments},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {207--218},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_18},
doi = {10.1007/978-3-642-40104-6\_18},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BredereckCHKNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BrucknerHKN13,
author = {Sharon Bruckner and
Falk H{\"{u}}ffner and
Christian Komusiewicz and
Rolf Niedermeier},
editor = {Vincenzo Bonifaci and
Camil Demetrescu and
Alberto Marchetti{-}Spaccamela},
title = {Evaluation of ILP-Based Approaches for Partitioning into Colorful
Components},
booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,
Rome, Italy, June 5-7, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7933},
pages = {176--187},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38527-8\_17},
doi = {10.1007/978-3-642-38527-8\_17},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/BrucknerHKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0649,
author = {Laurent Bulteau and
Christian Komusiewicz},
title = {Minimum Common String Partition Parameterized by Partition Size is
Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1305.0649},
year = {2013},
url = {http://arxiv.org/abs/1305.0649},
eprinttype = {arXiv},
eprint = {1305.0649},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-3735,
author = {Sepp Hartung and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein and
Ondrej Such{\'{y}}},
title = {On Structural Parameterizations for the 2-Club Problem},
journal = {CoRR},
volume = {abs/1305.3735},
year = {2013},
url = {http://arxiv.org/abs/1305.3735},
eprinttype = {arXiv},
eprint = {1305.3735},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-3735.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BulteauFKR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz and
Irena Rusu},
title = {A Fixed-Parameter Algorithm for Minimum Common String Partition with
Few Duplications},
journal = {CoRR},
volume = {abs/1307.7842},
year = {2013},
url = {http://arxiv.org/abs/1307.7842},
eprinttype = {arXiv},
eprint = {1307.7842},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BulteauFKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cmmm/SchmidtWKWL12,
author = {Christoph Schmidt and
Thomas Weiss and
Christian Komusiewicz and
Herbert Witte and
Lutz Leistritz},
title = {An Analytical Approach to Network Motif Detection in Samples of Networks
with Pairwise Different Vertex Labels},
journal = {Comput. Math. Methods Medicine},
volume = {2012},
pages = {910380:1--910380:12},
year = {2012},
url = {https://doi.org/10.1155/2012/910380},
doi = {10.1155/2012/910380},
timestamp = {Mon, 10 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cmmm/SchmidtWKWL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KomusiewiczU12,
author = {Christian Komusiewicz and
Johannes Uhlmann},
title = {Cluster editing with locally bounded modifications},
journal = {Discret. Appl. Math.},
volume = {160},
number = {15},
pages = {2259--2270},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.05.019},
doi = {10.1016/J.DAM.2012.05.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KomusiewiczU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/WellerKNU12,
author = {Mathias Weller and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
title = {On making directed graphs transitive},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {2},
pages = {559--574},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.07.001},
doi = {10.1016/J.JCSS.2011.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/WellerKNU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/SchaferKMN12,
author = {Alexander Sch{\"{a}}fer and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
title = {Parameterized computational complexity of finding small-diameter subgraphs},
journal = {Optim. Lett.},
volume = {6},
number = {5},
pages = {883--891},
year = {2012},
url = {https://doi.org/10.1007/s11590-011-0311-5},
doi = {10.1007/S11590-011-0311-5},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/SchaferKMN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BrucknerHKNTU12,
author = {Sharon Bruckner and
Falk H{\"{u}}ffner and
Christian Komusiewicz and
Rolf Niedermeier and
Sven Thiel and
Johannes Uhlmann},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Partitioning into Colorful Components by Minimum Edge Deletions},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {56--69},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_5},
doi = {10.1007/978-3-642-31265-6\_5},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BrucknerHKNTU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BrueggemanFFLKKPR12,
author = {Leo Brueggeman and
Michael R. Fellows and
Rudolf Fleischer and
Martin Lackner and
Christian Komusiewicz and
Yiannis Koutis and
Andreas Pfandler and
Frances A. Rosamond},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Train Marshalling Is Fixed Parameter Tractable},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {51--56},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_8},
doi = {10.1007/978-3-642-30347-0\_8},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/BrueggemanFFLKKPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HartungKN12,
author = {Sepp Hartung and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {Parameterized Algorithmics and Computational Experiments for Finding
2-Clubs},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {231--241},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_22},
doi = {10.1007/978-3-642-33293-7\_22},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HartungKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KomusiewiczS12,
author = {Christian Komusiewicz and
Manuel Sorge},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {Finding Dense Subgraphs of Sparse Graphs},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {242--251},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_23},
doi = {10.1007/978-3-642-33293-7\_23},
timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KomusiewiczS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KomusiewiczN12,
author = {Christian Komusiewicz and
Rolf Niedermeier},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {New Races in Parameterized Algorithmics},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {19--30},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_2},
doi = {10.1007/978-3-642-32589-2\_2},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KomusiewiczN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Komusiewicz2011,
author = {Christian Komusiewicz},
title = {Parameterized Algorithmics for Network Analysis: Clustering {\&}
Querying},
school = {Berlin Institute of Technology},
year = {2011},
url = {http://opus.kobv.de/tuberlin/volltexte/2011/3250/},
urn = {urn:nbn:de:kobv:83-opus-32503},
isbn = {978-3-7983-2379-7},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Komusiewicz2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoKKU11,
author = {Jiong Guo and
Iyad A. Kanj and
Christian Komusiewicz and
Johannes Uhlmann},
title = {Editing Graphs into Disjoint Unions of Dense Clusters},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {949--970},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9487-4},
doi = {10.1007/S00453-011-9487-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoKKU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FellowsGKNU11,
author = {Michael R. Fellows and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
title = {Graph-based data clustering with overlaps},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {2--17},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.006},
doi = {10.1016/J.DISOPT.2010.09.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FellowsGKNU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BetzlerGKN11,
author = {Nadja Betzler and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier},
title = {Average parameterization and partial kernelization for computing medians},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {4},
pages = {774--789},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.07.005},
doi = {10.1016/J.JCSS.2010.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BetzlerGKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KomusiewiczNU11,
author = {Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
title = {Deconstructing intractability - {A} multivariate complexity analysis
of interval constrained coloring},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {137--151},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.07.003},
doi = {10.1016/J.JDA.2010.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KomusiewiczNU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/BetzlerBFKN11,
author = {Nadja Betzler and
Ren{\'{e}} van Bevern and
Michael R. Fellows and
Christian Komusiewicz and
Rolf Niedermeier},
title = {Parameterized Algorithmics for Finding Connected Motifs in Biological
Networks},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {5},
pages = {1296--1308},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2011.19},
doi = {10.1109/TCBB.2011.19},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/BetzlerBFKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DornfelderGKW11,
author = {Martin D{\"{o}}rnfelder and
Jiong Guo and
Christian Komusiewicz and
Mathias Weller},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {On the Parameterized Complexity of Consensus Clustering},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {624--633},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_64},
doi = {10.1007/978-3-642-25591-5\_64},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DornfelderGKW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KomusiewiczU11,
author = {Christian Komusiewicz and
Johannes Uhlmann},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {Alternative Parameterizations for Cluster Editing},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {344--355},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_29},
doi = {10.1007/978-3-642-18381-2\_29},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/KomusiewiczU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HuffnerKMN10,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
title = {Fixed-Parameter Algorithms for Cluster Vertex Deletion},
journal = {Theory Comput. Syst.},
volume = {47},
number = {1},
pages = {196--217},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9150-x},
doi = {10.1007/S00224-008-9150-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HuffnerKMN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuoKNU10,
author = {Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
title = {A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster
Editing},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1662--1683},
year = {2010},
url = {https://doi.org/10.1137/090767285},
doi = {10.1137/090767285},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuoKNU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HartungGKNU10,
author = {Sepp Hartung and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
editor = {Maria Fox and
David Poole},
title = {Exact Algorithms and Experiments for Hierarchical Tree Clustering},
booktitle = {Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010},
pages = {457--462},
publisher = {{AAAI} Press},
year = {2010},
url = {https://doi.org/10.1609/aaai.v24i1.7684},
doi = {10.1609/AAAI.V24I1.7684},
timestamp = {Mon, 04 Sep 2023 16:23:45 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HartungGKNU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BetzlerGKN10,
author = {Nadja Betzler and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Average Parameterization and Partial Kernelization for Computing Medians},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {60--71},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_7},
doi = {10.1007/978-3-642-12200-2\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BetzlerGKN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BevernKMN10,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
editor = {Dimitrios M. Thilikos},
title = {Measuring Indifference: Unit Interval Vertex Deletion},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {232--243},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_22},
doi = {10.1007/978-3-642-16926-7\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BevernKMN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BrugmannKM09,
author = {Daniel Br{\"{u}}gmann and
Christian Komusiewicz and
Hannes Moser},
title = {On Generating Triangle-Free Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {51--58},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.008},
doi = {10.1016/J.ENDM.2009.02.008},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BrugmannKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KomusiewiczHMN09,
author = {Christian Komusiewicz and
Falk H{\"{u}}ffner and
Hannes Moser and
Rolf Niedermeier},
title = {Isolation concepts for efficiently enumerating dense subgraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3640--3654},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.021},
doi = {10.1016/J.TCS.2009.04.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KomusiewiczHMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuffnerKMN09,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
title = {Isolation concepts for clique enumeration: Comparison and computational
experiments},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5384--5397},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.008},
doi = {10.1016/J.TCS.2009.05.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HuffnerKMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/GuoKNU09,
author = {Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
editor = {Andrew V. Goldberg and
Yunhong Zhou},
title = {A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing},
booktitle = {Algorithmic Aspects in Information and Management, 5th International
Conference, {AAIM} 2009, San Francisco, CA, USA, June 15-17, 2009.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5564},
pages = {226--239},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02158-9\_20},
doi = {10.1007/978-3-642-02158-9\_20},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/GuoKNU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FellowsGKNU09,
author = {Michael R. Fellows and
Jiong Guo and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
editor = {Hung Q. Ngo},
title = {Graph-Based Data Clustering with Overlaps},
booktitle = {Computing and Combinatorics, 15th Annual International Conference,
{COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5609},
pages = {516--526},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02882-3\_51},
doi = {10.1007/978-3-642-02882-3\_51},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/FellowsGKNU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KomusiewiczNU09,
author = {Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Deconstructing Intractability: {A} Case Study for Interval Constrained
Coloring},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {207--220},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_19},
doi = {10.1007/978-3-642-02441-2\_19},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/KomusiewiczNU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GuoKKU09,
author = {Jiong Guo and
Iyad A. Kanj and
Christian Komusiewicz and
Johannes Uhlmann},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Editing Graphs into Disjoint Unions of Dense Clusters},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {583--593},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_60},
doi = {10.1007/978-3-642-10631-6\_60},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GuoKKU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/WellerKNU09,
author = {Mathias Weller and
Christian Komusiewicz and
Rolf Niedermeier and
Johannes Uhlmann},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {On Making Directed Graphs Transitive},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {542--553},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_47},
doi = {10.1007/978-3-642-03367-4\_47},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/WellerKNU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/HuffnerKMN08,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Enumerating Isolated Cliques in Synthetic and Financial Networks},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {405--416},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_38},
doi = {10.1007/978-3-540-85097-7\_38},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/HuffnerKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BetzlerFKN08,
author = {Nadja Betzler and
Michael R. Fellows and
Christian Komusiewicz and
Rolf Niedermeier},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Parameterized Algorithms and Hardness Results for Some Graph Motif
Problems},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {31--43},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_6},
doi = {10.1007/978-3-540-69068-9\_6},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BetzlerFKN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KomusiewiczU08,
author = {Christian Komusiewicz and
Johannes Uhlmann},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {A Cubic-Vertex Kernel for Flip Consensus Tree},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {280--291},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1760},
doi = {10.4230/LIPICS.FSTTCS.2008.1760},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/KomusiewiczU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/HuffnerKMN08,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Fixed-Parameter Algorithms for Cluster Vertex Deletion},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {711--722},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_61},
doi = {10.1007/978-3-540-78773-0\_61},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/HuffnerKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GuoHKZ08,
author = {Jiong Guo and
Falk H{\"{u}}ffner and
Christian Komusiewicz and
Yong Zhang},
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {Improved Algorithms for Bicluster Editing},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
pages = {445--456},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4\_39},
doi = {10.1007/978-3-540-79228-4\_39},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GuoHKZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KomusiewiczHMN07,
author = {Christian Komusiewicz and
Falk H{\"{u}}ffner and
Hannes Moser and
Rolf Niedermeier},
editor = {Guohui Lin},
title = {Isolation Concepts for Enumerating Dense Subgraphs},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {140--150},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_16},
doi = {10.1007/978-3-540-73545-8\_16},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KomusiewiczHMN07.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.
last updated on 2024-03-24 00:10 CET 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:
