Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Danny Hermelin
@article{DBLP:journals/tcs/HermelinKNP24,
author = {Danny Hermelin and
Leon Kellerhals and
Rolf Niedermeier and
Rami Pugatch},
title = {Approximating sparse quadratic programs},
journal = {Theor. Comput. Sci.},
volume = {984},
pages = {114319},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114319},
doi = {10.1016/J.TCS.2023.114319},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HermelinKNP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-01740,
author = {Klaus Heeger and
Danny Hermelin},
title = {Minimizing the Weighted Number of Tardy Jobs is W[1]-hard},
journal = {CoRR},
volume = {abs/2401.01740},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.01740},
doi = {10.48550/ARXIV.2401.01740},
eprinttype = {arXiv},
eprint = {2401.01740},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-01740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DondiH23,
author = {Riccardo Dondi and
Danny Hermelin},
title = {Computing the \emph{k} densest subgraphs of a graph},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106316},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106316},
doi = {10.1016/J.IPL.2022.106316},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DondiH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/HeegerHMMNS23,
author = {Klaus Heeger and
Danny Hermelin and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable scheduling on a single machine},
journal = {J. Sched.},
volume = {26},
number = {2},
pages = {209--225},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00754-6},
doi = {10.1007/S10951-022-00754-6},
timestamp = {Sun, 16 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/HeegerHMMNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HermelinIMN23,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Rolf Niedermeier},
title = {Temporal interval cliques and independent sets},
journal = {Theor. Comput. Sci.},
volume = {961},
pages = {113885},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113885},
doi = {10.1016/J.TCS.2023.113885},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HermelinIMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HeegerHS23,
author = {Klaus Heeger and
Danny Hermelin and
Dvir Shabtay},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Single Machine Scheduling with Few Deadlines},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {24:1--24:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.24},
doi = {10.4230/LIPICS.IPEC.2023.24},
timestamp = {Wed, 13 Dec 2023 14:08:59 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/HeegerHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-12593,
author = {Klaus Heeger and
Danny Hermelin and
Matthias Mnich and
Dvir Shabtay},
title = {No Polynomial Kernels for Knapsack},
journal = {CoRR},
volume = {abs/2308.12593},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.12593},
doi = {10.48550/ARXIV.2308.12593},
eprinttype = {arXiv},
eprint = {2308.12593},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-12593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannFHSW22,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1341--1356},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00928-w},
doi = {10.1007/S00453-022-00928-W},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannFHSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AbboudBHS22,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {Scheduling lower bounds via {AND} subset sum},
journal = {J. Comput. Syst. Sci.},
volume = {127},
pages = {29--40},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.01.005},
doi = {10.1016/J.JCSS.2022.01.005},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AbboudBHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/HermelinSZP22,
author = {Danny Hermelin and
Dvir Shabtay and
Chen Zelig and
Michael L. Pinedo},
title = {A general scheme for solving a large set of scheduling problems with
rejection in {FPT} time},
journal = {J. Sched.},
volume = {25},
number = {2},
pages = {229--255},
year = {2022},
url = {https://doi.org/10.1007/s10951-022-00731-z},
doi = {10.1007/S10951-022-00731-Z},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/HermelinSZP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbboudBHS22,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {SETH-based Lower Bounds for Subset Sum and Bicriteria Path},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {1},
pages = {6:1--6:22},
year = {2022},
url = {https://doi.org/10.1145/3450524},
doi = {10.1145/3450524},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AbboudBHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HermelinIMS22,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Dvir Shabtay},
editor = {Holger Dell and
Jesper Nederlof},
title = {Hardness of Interval Scheduling on Unrelated Machines},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.18},
doi = {10.4230/LIPICS.IPEC.2022.18},
timestamp = {Wed, 14 Dec 2022 11:56:17 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/HermelinIMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/HermelinIMN22,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Rolf Niedermeier},
editor = {James Aspnes and
Othon Michail},
title = {Temporal Unit Interval Independent Sets},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {19:1--19:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.19},
doi = {10.4230/LIPICS.SAND.2022.19},
timestamp = {Fri, 29 Apr 2022 14:01:39 +0200},
biburl = {https://dblp.org/rec/conf/sand/HermelinIMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06841,
author = {Danny Hermelin and
Hendrik Molter and
Dvir Shabtay},
title = {Single Machine Weighted Number of Tardy Jobs Minimization With Small
Weights},
journal = {CoRR},
volume = {abs/2202.06841},
year = {2022},
url = {https://arxiv.org/abs/2202.06841},
eprinttype = {arXiv},
eprint = {2202.06841},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06841.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12825,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Dvir Shabtay},
title = {Hardness of Interval Scheduling on Unrelated Machines},
journal = {CoRR},
volume = {abs/2206.12825},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.12825},
doi = {10.48550/ARXIV.2206.12825},
eprinttype = {arXiv},
eprint = {2206.12825},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-12825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/HermelinKPS21,
author = {Danny Hermelin and
Shlomo Karhi and
Michael L. Pinedo and
Dvir Shabtay},
title = {New algorithms for minimizing the weighted number of tardy jobs on
a single machine},
journal = {Ann. Oper. Res.},
volume = {298},
number = {1},
pages = {271--287},
year = {2021},
url = {https://doi.org/10.1007/s10479-018-2852-9},
doi = {10.1007/S10479-018-2852-9},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/HermelinKPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HermelinM21,
author = {Danny Hermelin and
George Manoussakis},
title = {Efficient enumeration of maximal induced bicliques},
journal = {Discret. Appl. Math.},
volume = {303},
pages = {253--261},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.04.034},
doi = {10.1016/J.DAM.2020.04.034},
timestamp = {Fri, 24 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HermelinM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eaai/YedidsionHS21,
author = {Harel Yedidsion and
Danny Hermelin and
Michael Segal},
title = {Collective multi agent deployment for wireless sensor network maintenance},
journal = {Eng. Appl. Artif. Intell.},
volume = {102},
pages = {104265},
year = {2021},
url = {https://doi.org/10.1016/j.engappai.2021.104265},
doi = {10.1016/J.ENGAPPAI.2021.104265},
timestamp = {Fri, 25 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eaai/YedidsionHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HeegerHMMNS21,
author = {Klaus Heeger and
Danny Hermelin and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable Scheduling on a Single Machine},
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 = {11818--11825},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i13.17404},
doi = {10.1609/AAAI.V35I13.17404},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HeegerHMMNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenCDFHNPPSWZ21,
author = {Jiehua Chen and
Wojciech Czerwinski and
Yann Disser and
Andreas Emil Feldmann and
Danny Hermelin and
Wojciech Nadara and
Marcin Pilipczuk and
Michal Pilipczuk and
Manuel Sorge and
Bartlomiej Wr{\'{o}}blewski and
Anna Zych{-}Pawlewicz},
editor = {D{\'{a}}niel Marx},
title = {Efficient fully dynamic elimination forests with applications to detecting
long paths and cycles},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {796--809},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.50},
doi = {10.1137/1.9781611976465.50},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenCDFHNPPSWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-03279,
author = {Till Fluschnik and
Klaus Heeger and
Danny Hermelin},
title = {Polynomial Turing Kernels for Clique with an Optimal Number of Queries},
journal = {CoRR},
volume = {abs/2110.03279},
year = {2021},
url = {https://arxiv.org/abs/2110.03279},
eprinttype = {arXiv},
eprint = {2110.03279},
timestamp = {Thu, 21 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-03279.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-06172,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Rolf Niedermeier},
title = {Temporal Unit Interval Independent Sets},
journal = {CoRR},
volume = {abs/2112.06172},
year = {2021},
url = {https://arxiv.org/abs/2112.06172},
eprinttype = {arXiv},
eprint = {2112.06172},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-06172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-13824,
author = {Danny Hermelin and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable Scheduling for the Total Completion Time Objective},
journal = {CoRR},
volume = {abs/2112.13824},
year = {2021},
url = {https://arxiv.org/abs/2112.13824},
eprinttype = {arXiv},
eprint = {2112.13824},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-13824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinMPSY20,
author = {Danny Hermelin and
George Manoussakis and
Michael L. Pinedo and
Dvir Shabtay and
Liron Yedidsion},
title = {Parameterized Multi-Scenario Single-Machine Scheduling Problems},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2644--2667},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00702-w},
doi = {10.1007/S00453-020-00702-W},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinMPSY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/FernauFHKMN20,
author = {Henning Fernau and
Till Fluschnik and
Danny Hermelin and
Andreas Krebs and
Hendrik Molter and
Rolf Niedermeier},
title = {Diminishable parameterized problems and strict polynomial kernelization},
journal = {Comput.},
volume = {9},
number = {1},
pages = {1--24},
year = {2020},
url = {https://doi.org/10.3233/COM-180220},
doi = {10.3233/COM-180220},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/computability/FernauFHKMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BulteauHKLV20,
author = {Laurent Bulteau and
Danny Hermelin and
Dusan Knop and
Anthony Labarre and
St{\'{e}}phane Vialette},
title = {The Clever Shopper Problem},
journal = {Theory Comput. Syst.},
volume = {64},
number = {1},
pages = {17--34},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09917-z},
doi = {10.1007/S00224-019-09917-Z},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BulteauHKLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Hermelin20,
author = {Danny Hermelin},
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {Hans Bodlaender and the Theory of Kernelization Lower Bounds},
booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12160},
pages = {18--21},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0\_3},
doi = {10.1007/978-3-030-42071-0\_3},
timestamp = {Tue, 21 Apr 2020 18:45:48 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Hermelin20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudBHS20,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Scheduling Lower Bounds via {AND} Subset Sum},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.4},
doi = {10.4230/LIPICS.ICALP.2020.4},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbboudBHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannFHSW20,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {19:1--19:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.19},
doi = {10.4230/LIPICS.ICALP.2020.19},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannFHSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07695,
author = {Riccardo Dondi and
Danny Hermelin},
title = {Computing the k Densest Subgraphs of a Graph},
journal = {CoRR},
volume = {abs/2002.07695},
year = {2020},
url = {https://arxiv.org/abs/2002.07695},
eprinttype = {arXiv},
eprint = {2002.07695},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07695.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-07104,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
journal = {CoRR},
volume = {abs/2003.07104},
year = {2020},
url = {https://arxiv.org/abs/2003.07104},
eprinttype = {arXiv},
eprint = {2003.07104},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-07104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-07113,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {Scheduling Lower Bounds via {AND} Subset Sum},
journal = {CoRR},
volume = {abs/2003.07113},
year = {2020},
url = {https://arxiv.org/abs/2003.07113},
eprinttype = {arXiv},
eprint = {2003.07113},
timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-07113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-00571,
author = {Jiehua Chen and
Wojciech Czerwinski and
Yann Disser and
Andreas Emil Feldmann and
Danny Hermelin and
Wojciech Nadara and
Michal Pilipczuk and
Marcin Pilipczuk and
Manuel Sorge and
Bartlomiej Wr{\'{o}}blewski and
Anna Zych{-}Pawlewicz},
title = {On Dynamic Parameterized k-Path},
journal = {CoRR},
volume = {abs/2006.00571},
year = {2020},
url = {https://arxiv.org/abs/2006.00571},
eprinttype = {arXiv},
eprint = {2006.00571},
timestamp = {Mon, 30 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-00571.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-01252,
author = {Danny Hermelin and
Leon Kellerhals and
Rolf Niedermeier and
Rami Pugatch},
title = {Approximating Sparse Quadratic Programs},
journal = {CoRR},
volume = {abs/2007.01252},
year = {2020},
url = {https://arxiv.org/abs/2007.01252},
eprinttype = {arXiv},
eprint = {2007.01252},
timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-01252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-04643,
author = {Klaus Heeger and
Danny Hermelin and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable Scheduling on a Single Machine},
journal = {CoRR},
volume = {abs/2010.04643},
year = {2020},
url = {https://arxiv.org/abs/2010.04643},
eprinttype = {arXiv},
eprint = {2010.04643},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-04643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoH19,
author = {Jiong Guo and
Danny Hermelin},
title = {Foreword: Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {419--420},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0529-z},
doi = {10.1007/S00453-018-0529-Z},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HermelinPST19,
author = {Danny Hermelin and
Michael L. Pinedo and
Dvir Shabtay and
Nimrod Talmon},
title = {On the parameterized tractability of single machine scheduling with
rejection},
journal = {Eur. J. Oper. Res.},
volume = {273},
number = {1},
pages = {67--73},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.07.038},
doi = {10.1016/J.EJOR.2018.07.038},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HermelinPST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EibenHR19,
author = {Eduard Eiben and
Danny Hermelin and
M. S. Ramanujan},
title = {On approximate preprocessing for domination and hitting subgraphs
with connected deletion sets},
journal = {J. Comput. Syst. Sci.},
volume = {105},
pages = {158--170},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.05.001},
doi = {10.1016/J.JCSS.2019.05.001},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EibenHR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/HermelinST19,
author = {Danny Hermelin and
Dvir Shabtay and
Nimrod Talmon},
title = {On the parameterized tractability of the just-in-time flow-shop scheduling
problem},
journal = {J. Sched.},
volume = {22},
number = {6},
pages = {663--676},
year = {2019},
url = {https://doi.org/10.1007/s10951-019-00617-7},
doi = {10.1007/S10951-019-00617-7},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/HermelinST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HermelinMLW19,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen and
Gerhard J. Woeginger},
title = {Domination When the Stars Are Out},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {25:1--25:90},
year = {2019},
url = {https://doi.org/10.1145/3301445},
doi = {10.1145/3301445},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HermelinMLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChenHS19,
author = {Jiehua Chen and
Danny Hermelin and
Manuel Sorge},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {On Computing Centroids According to the p-Norms of Hamming Distance
Vectors},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {28:1--28:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.28},
doi = {10.4230/LIPICS.ESA.2019.28},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChenHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudBHS19,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
editor = {Timothy M. Chan},
title = {SETH-Based Lower Bounds for Subset Sum and Bicriteria Path},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {41--57},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.3},
doi = {10.1137/1.9781611975482.3},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbboudBHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-12350,
author = {Danny Hermelin and
Matthias Mnich and
Simon Omlor},
title = {Single Machine Batch Scheduling to Minimize the Weighted Number of
Tardy Jobs},
journal = {CoRR},
volume = {abs/1911.12350},
year = {2019},
url = {http://arxiv.org/abs/1911.12350},
eprinttype = {arXiv},
eprint = {1911.12350},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-12350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BenshaharCHZ18,
author = {Arnon Benshahar and
Vered Chalifa{-}Caspi and
Danny Hermelin and
Michal Ziv{-}Ukelson},
title = {A Biclique Approach to Reference-Anchored Gene Blocks and Its Applications
to Genomic Islands},
journal = {J. Comput. Biol.},
volume = {25},
number = {2},
pages = {214--235},
year = {2018},
url = {https://doi.org/10.1089/cmb.2017.0108},
doi = {10.1089/CMB.2017.0108},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BenshaharCHZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FluschnikHNN18,
author = {Till Fluschnik and
Danny Hermelin and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Fractals for Kernelization Lower Bounds},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {1},
pages = {656--681},
year = {2018},
url = {https://doi.org/10.1137/16M1088740},
doi = {10.1137/16M1088740},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FluschnikHNN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/FernauFHKMN18,
author = {Henning Fernau and
Till Fluschnik and
Danny Hermelin and
Andreas Krebs and
Hendrik Molter and
Rolf Niedermeier},
editor = {Florin Manea and
Russell G. Miller and
Dirk Nowotka},
title = {Diminishable Parameterized Problems and Strict Polynomial Kernelization},
booktitle = {Sailing Routes in the World of Computation - 14th Conference on Computability
in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10936},
pages = {161--171},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94418-0\_17},
doi = {10.1007/978-3-319-94418-0\_17},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cie/FernauFHKMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BulteauHLV18,
author = {Laurent Bulteau and
Danny Hermelin and
Anthony Labarre and
St{\'{e}}phane Vialette},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {The Clever Shopper Problem},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {53--64},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_6},
doi = {10.1007/978-3-319-90530-3\_6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BulteauHLV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenHSY18,
author = {Jiehua Chen and
Danny Hermelin and
Manuel Sorge and
Harel Yedidsion},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {How Hard Is It to Satisfy (Almost) All Roommates?},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.35},
doi = {10.4230/LIPICS.ICALP.2018.35},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenHSY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07944,
author = {Laurent Bulteau and
Danny Hermelin and
Anthony Labarre and
St{\'{e}}phane Vialette},
title = {The Clever Shopper Problem},
journal = {CoRR},
volume = {abs/1802.07944},
year = {2018},
url = {http://arxiv.org/abs/1802.07944},
eprinttype = {arXiv},
eprint = {1802.07944},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06469,
author = {Jiehua Chen and
Danny Hermelin and
Manuel Sorge},
title = {On Computing Centroids According to the p-Norms of Hamming Distance
Vectors},
journal = {CoRR},
volume = {abs/1807.06469},
year = {2018},
url = {http://arxiv.org/abs/1807.06469},
eprinttype = {arXiv},
eprint = {1807.06469},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06469.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08949,
author = {Jiehua Chen and
Danny Hermelin and
Manuel Sorge},
title = {A Note on Clustering Aggregation},
journal = {CoRR},
volume = {abs/1807.08949},
year = {2018},
url = {http://arxiv.org/abs/1807.08949},
eprinttype = {arXiv},
eprint = {1807.08949},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-08949.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganGH17,
author = {Marek Cygan and
Fabrizio Grandoni and
Danny Hermelin},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {3},
pages = {43:1--43:22},
year = {2017},
url = {https://doi.org/10.1145/3108239},
doi = {10.1145/3108239},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CyganGH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EibenHR17,
author = {Eduard Eiben and
Danny Hermelin and
M. S. Ramanujan},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Lossy Kernels for Hitting Subgraphs},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {67:1--67:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.67},
doi = {10.4230/LIPICS.MFCS.2017.67},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/EibenHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/paams/HermelinSY17,
author = {Danny Hermelin and
Michael Segal and
Harel Yedidsion},
editor = {Yves Demazeau and
Paul Davidsson and
Javier Bajo and
Zita A. Vale},
title = {Coordination of Mobile Mules via Facility Location Strategies},
booktitle = {Advances in Practical Applications of Cyber-Physical Multi-Agent Systems:
The {PAAMS} Collection - 15th International Conference, {PAAMS} 2017,
Porto, Portugal, June 21-23, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10349},
pages = {107--119},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59930-4\_9},
doi = {10.1007/978-3-319-59930-4\_9},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/paams/HermelinSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2016,
editor = {Jiong Guo and
Danny Hermelin},
title = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-023-1},
isbn = {978-3-95977-023-1},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HermelinSY17,
author = {Danny Hermelin and
Michael Segal and
Harel Yedidsion},
title = {Coordination of Mobile Mules via Facility Location Strategies},
journal = {CoRR},
volume = {abs/1702.04142},
year = {2017},
url = {http://arxiv.org/abs/1702.04142},
eprinttype = {arXiv},
eprint = {1702.04142},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HermelinSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbboudBHS17,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {SETH-Based Lower Bounds for Subset Sum and Bicriteria Path},
journal = {CoRR},
volume = {abs/1704.04546},
year = {2017},
url = {http://arxiv.org/abs/1704.04546},
eprinttype = {arXiv},
eprint = {1704.04546},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbboudBHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenHSY17,
author = {Jiehua Chen and
Danny Hermelin and
Manuel Sorge and
Harel Yedidsion},
title = {How hard is it to satisfy (almost) all roommates?},
journal = {CoRR},
volume = {abs/1707.04316},
year = {2017},
url = {http://arxiv.org/abs/1707.04316},
eprinttype = {arXiv},
eprint = {1707.04316},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenHSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04161,
author = {Danny Hermelin and
Judith{-}Madeleine Kubitza and
Dvir Shabtay and
Nimrod Talmon and
Gerhard J. Woeginger},
title = {Scheduling Two Agents on a Single Machine: {A} Parameterized Analysis
of NP-hard Problems},
journal = {CoRR},
volume = {abs/1709.04161},
year = {2017},
url = {http://arxiv.org/abs/1709.04161},
eprinttype = {arXiv},
eprint = {1709.04161},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-04161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04169,
author = {Danny Hermelin and
Dvir Shabtay and
Nimrod Talmon},
title = {On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling
Problem},
journal = {CoRR},
volume = {abs/1709.04169},
year = {2017},
url = {http://arxiv.org/abs/1709.04169},
eprinttype = {arXiv},
eprint = {1709.04169},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-04169.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-05751,
author = {Danny Hermelin and
Shlomo Karhi and
Mike Pinedo and
Dvir Shabtay},
title = {New Algorithms for Minimizing the Weighted Number of Tardy Jobs On
a Single Machine},
journal = {CoRR},
volume = {abs/1709.05751},
year = {2017},
url = {http://arxiv.org/abs/1709.05751},
eprinttype = {arXiv},
eprint = {1709.05751},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-05751.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/CyganFHW17,
author = {Marek Cygan and
Fedor V. Fomin and
Danny Hermelin and
Magnus Wahlstr{\"{o}}m},
title = {Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)},
journal = {Dagstuhl Reports},
volume = {7},
number = {1},
pages = {103--128},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.1.103},
doi = {10.4230/DAGREP.7.1.103},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/CyganFHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BringmannHML16,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized complexity dichotomy for Steiner Multicut},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {6},
pages = {1020--1043},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2016.03.003},
doi = {10.1016/J.JCSS.2016.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BringmannHML16.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}
}
@article{DBLP:journals/toct/FellowsHRS16,
author = {Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond and
Hadas Shachnai},
title = {Tractable Parameterizations for the Minimum Linear Arrangement Problem},
journal = {{ACM} Trans. Comput. Theory},
volume = {8},
number = {2},
pages = {6:1--6:12},
year = {2016},
url = {https://doi.org/10.1145/2898352},
doi = {10.1145/2898352},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/FellowsHRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FluschnikHNN16,
author = {Till Fluschnik and
Danny Hermelin and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded
Cut Problems},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.25},
doi = {10.4230/LIPICS.ICALP.2016.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FluschnikHNN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BenshaharCHZ16,
author = {Arnon Benshahar and
Vered Chalifa{-}Caspi and
Danny Hermelin and
Michal Ziv{-}Ukelson},
editor = {Martin C. Frith and
Christian N{\o}rgaard Storm Pedersen},
title = {A Biclique Approach to Reference Anchored Gene Blocks and Its Applications
to Pathogenicity Islands},
booktitle = {Algorithms in Bioinformatics - 16th International Workshop, {WABI}
2016, Aarhus, Denmark, August 22-24, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9838},
pages = {14--26},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-43681-4\_2},
doi = {10.1007/978-3-319-43681-4\_2},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BenshaharCHZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernauFHKMN16,
author = {Henning Fernau and
Till Fluschnik and
Danny Hermelin and
Andreas Krebs and
Hendrik Molter and
Rolf Niedermeier},
title = {Diminishable Parameterized Problems and Strict Polynomial Kernelization},
journal = {CoRR},
volume = {abs/1611.03739},
year = {2016},
url = {http://arxiv.org/abs/1611.03739},
eprinttype = {arXiv},
eprint = {1611.03739},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernauFHKMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinKSWW15,
author = {Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlstr{\"{o}}m and
Xi Wu},
title = {A Completeness Theory for Polynomial (Turing) Kernelization},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {702--730},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9910-8},
doi = {10.1007/S00453-014-9910-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinKSWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GagieHLW15,
author = {Travis Gagie and
Danny Hermelin and
Gad M. Landau and
Oren Weimann},
title = {Binary Jumbled Pattern Matching on Trees and Tree-Like Structures},
journal = {Algorithmica},
volume = {73},
number = {3},
pages = {571--588},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9957-6},
doi = {10.1007/S00453-014-9957-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GagieHLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FountoulakisFH15,
author = {Nikolaos Fountoulakis and
Tobias Friedrich and
Danny Hermelin},
title = {On the average-case complexity of parameterized clique},
journal = {Theor. Comput. Sci.},
volume = {576},
pages = {18--29},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.042},
doi = {10.1016/J.TCS.2015.01.042},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FountoulakisFH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HermelinR15,
author = {Danny Hermelin and
Liat Rozenberg},
title = {Parameterized complexity analysis for the Closest String with Wildcards
problem},
journal = {Theor. Comput. Sci.},
volume = {600},
pages = {11--18},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.043},
doi = {10.1016/J.TCS.2015.06.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HermelinR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HermelinKSTW15,
author = {Danny Hermelin and
Judith{-}Madeleine Kubitza and
Dvir Shabtay and
Nimrod Talmon and
Gerhard J. Woeginger},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Scheduling Two Competing Agents When One Agent Has Significantly Fewer
Jobs},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {55--65},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.55},
doi = {10.4230/LIPICS.IPEC.2015.55},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/HermelinKSTW15.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/stacs/BringmannHML15,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Parameterized Complexity Dichotomy for Steiner Multicut},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {157--170},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.157},
doi = {10.4230/LIPICS.STACS.2015.157},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BringmannHML15.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/FluschnikHNN15,
author = {Till Fluschnik and
Danny Hermelin and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded
Cut Problems},
journal = {CoRR},
volume = {abs/1512.00333},
year = {2015},
url = {http://arxiv.org/abs/1512.00333},
eprinttype = {arXiv},
eprint = {1512.00333},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikHNN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinML14,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs},
journal = {Algorithmica},
volume = {70},
number = {3},
pages = {513--560},
year = {2014},
url = {https://doi.org/10.1007/s00453-014-9877-5},
doi = {10.1007/S00453-014-9877-5},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinML14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HermelinMR14,
author = {Danny Hermelin and
Juli{\'{a}}n Mestre and
Dror Rawitz},
title = {Optimization problems in dotted interval graphs},
journal = {Discret. Appl. Math.},
volume = {174},
pages = {66--72},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.04.014},
doi = {10.1016/J.DAM.2014.04.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HermelinMR14.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}
}
@inproceedings{DBLP:conf/cpm/HermelinR14,
author = {Danny Hermelin and
Liat Rozenberg},
editor = {Alexander S. Kulikov and
Sergei O. Kuznetsov and
Pavel A. Pevzner},
title = {Parameterized Complexity Analysis for the Closest String with Wildcards
Problem},
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 = {140--149},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07566-2\_15},
doi = {10.1007/978-3-319-07566-2\_15},
timestamp = {Wed, 25 Sep 2019 18:18:47 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HermelinR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HermelinLRW14,
author = {Danny Hermelin and
Gad M. Landau and
Yuri Rabinovich and
Oren Weimann},
title = {Binary Jumbled Pattern Matching via All-Pairs Shortest Paths},
journal = {CoRR},
volume = {abs/1401.2065},
year = {2014},
url = {http://arxiv.org/abs/1401.2065},
eprinttype = {arXiv},
eprint = {1401.2065},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HermelinLRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannHML14,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity Dichotomy for Steiner Multicut},
journal = {CoRR},
volume = {abs/1404.7006},
year = {2014},
url = {http://arxiv.org/abs/1404.7006},
eprinttype = {arXiv},
eprint = {1404.7006},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannHML14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FountoulakisFH14,
author = {Nikolaos Fountoulakis and
Tobias Friedrich and
Danny Hermelin},
title = {On the Average-case Complexity of Parameterized Clique},
journal = {CoRR},
volume = {abs/1410.6400},
year = {2014},
url = {http://arxiv.org/abs/1410.6400},
eprinttype = {arXiv},
eprint = {1410.6400},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FountoulakisFH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinLLW13,
author = {Danny Hermelin and
Gad M. Landau and
Shir Landau and
Oren Weimann},
title = {Unified Compression-Based Acceleration of Edit-Distance Computation},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {339--353},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9590-6},
doi = {10.1007/S00453-011-9590-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinLLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HermelinHKW13,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Parameterized Two-Player Nash Equilibrium},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {802--816},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9609-z},
doi = {10.1007/S00453-011-9609-Z},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HermelinHKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FellowsFHNR13,
author = {Michael R. Fellows and
Tobias Friedrich and
Danny Hermelin and
Nina Narodytska and
Frances A. Rosamond},
title = {Constraint satisfaction problems: Convexity makes AllDifferent constraints
tractable},
journal = {Theor. Comput. Sci.},
volume = {472},
pages = {81--89},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.11.038},
doi = {10.1016/J.TCS.2012.11.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FellowsFHNR13.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/esa/CyganGH13,
author = {Marek Cygan and
Fabrizio Grandoni and
Danny Hermelin},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy -
(Extended Abstract)},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {361--372},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_31},
doi = {10.1007/978-3-642-40450-4\_31},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/CyganGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FellowsHRS13,
author = {Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond and
Hadas Shachnai},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Tractable Parameterizations for the Minimum Linear Arrangement Problem},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {457--468},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_39},
doi = {10.1007/978-3-642-40450-4\_39},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/FellowsHRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GagieHLW13,
author = {Travis Gagie and
Danny Hermelin and
Gad M. Landau and
Oren Weimann},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Binary Jumbled Pattern Matching on Trees and Tree-Like Structures},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {517--528},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_44},
doi = {10.1007/978-3-642-40450-4\_44},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GagieHLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HermelinKSWW13,
author = {Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlstr{\"{o}}m and
Xi Wu},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {A Completeness Theory for Polynomial (Turing) Kernelization},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {202--215},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_18},
doi = {10.1007/978-3-319-03898-8\_18},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HermelinKSWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-6127,
author = {Travis Gagie and
Danny Hermelin and
Gad M. Landau and
Oren Weimann},
title = {Binary Jumbled Pattern Matching on Trees and Tree-Like Structures},
journal = {CoRR},
volume = {abs/1301.6127},
year = {2013},
url = {http://arxiv.org/abs/1301.6127},
eprinttype = {arXiv},
eprint = {1301.6127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-6127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4914,
author = {Marek Cygan and
Fabrizio Grandoni and
Danny Hermelin},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy},
journal = {CoRR},
volume = {abs/1305.4914},
year = {2013},
url = {http://arxiv.org/abs/1305.4914},
eprinttype = {arXiv},
eprint = {1305.4914},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FellowsHR12,
author = {Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond},
title = {Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their
Algorithmic Applications},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {3--18},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9545-y},
doi = {10.1007/S00453-011-9545-Y},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FellowsHR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/NorHCERDS12,
author = {Igor Nor and
Danny Hermelin and
Sylvain Charlat and
Jan Engelstadter and
Max Reuter and
Olivier Duron and
Marie{-}France Sagot},
title = {Mod/Resc Parsimony Inference: Theory and application},
journal = {Inf. Comput.},
volume = {213},
pages = {23--32},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2011.03.008},
doi = {10.1016/J.IC.2011.03.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/NorHCERDS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HermelinML12,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Parameterized Complexity of Induced H-Matching on Claw-Free Graphs},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {624--635},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_54},
doi = {10.1007/978-3-642-33090-2\_54},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HermelinML12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HermelinRV12,
author = {Danny Hermelin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {465--474},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_49},
doi = {10.1007/978-3-642-35261-4\_49},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HermelinRV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HermelinW12,
author = {Danny Hermelin and
Xi Wu},
editor = {Yuval Rabani},
title = {Weak compositions and their applications to polynomial lower bounds
for kernelization},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {104--113},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.9},
doi = {10.1137/1.9781611973099.9},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/HermelinW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HermelinMR12,
author = {Danny Hermelin and
Juli{\'{a}}n Mestre and
Dror Rawitz},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Optimization Problems in Dotted Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {46--56},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_8},
doi = {10.1007/978-3-642-34611-8\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HermelinMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HermelinML12,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs},
journal = {CoRR},
volume = {abs/1206.7105},
year = {2012},
url = {http://arxiv.org/abs/1206.7105},
eprinttype = {arXiv},
eprint = {1206.7105},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HermelinML12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Bar-YehudaHR11,
author = {Reuven Bar{-}Yehuda and
Danny Hermelin and
Dror Rawitz},
title = {Minimum vertex cover in rectangle graphs},
journal = {Comput. Geom.},
volume = {44},
number = {6-7},
pages = {356--364},
year = {2011},
url = {https://doi.org/10.1016/j.comgeo.2011.03.002},
doi = {10.1016/J.COMGEO.2011.03.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Bar-YehudaHR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HermelinR11,
author = {Danny Hermelin and
Dror Rawitz},
title = {Optimization problems in multiple subtree graphs},
journal = {Discret. Appl. Math.},
volume = {159},
number = {7},
pages = {588--594},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.03.010},
doi = {10.1016/J.DAM.2010.03.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HermelinR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Ben-ZwiHLN11,
author = {Oren Ben{-}Zwi and
Danny Hermelin and
Daniel Lokshtanov and
Ilan Newman},
title = {Treewidth governs the complexity of target set selection},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {87--96},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.007},
doi = {10.1016/J.DISOPT.2010.09.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/Ben-ZwiHLN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FellowsFHV11,
author = {Michael R. Fellows and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
title = {Upper and lower bounds for finding connected motifs in vertex-colored
graphs},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {4},
pages = {799--811},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.07.003},
doi = {10.1016/J.JCSS.2010.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FellowsFHV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/FellowsHHLRR11,
author = {Michael R. Fellows and
Tzvika Hartman and
Danny Hermelin and
Gad M. Landau and
Frances A. Rosamond and
Liat Rozenberg},
title = {Haplotype Inference Constrained by Plausible Haplotype Data},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {6},
pages = {1692--1699},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2010.72},
doi = {10.1109/TCBB.2010.72},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/FellowsHHLRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HermelinMLW11,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen and
Gerhard J. Woeginger},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Domination When the Stars Are Out},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {462--473},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_39},
doi = {10.1007/978-3-642-22006-7\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HermelinMLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HermelinLWY11,
author = {Danny Hermelin and
Avivit Levy and
Oren Weimann and
Raphael Yuster},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Distance Oracles for Vertex-Labeled Graphs},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
pages = {490--501},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8\_39},
doi = {10.1007/978-3-642-22012-8\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HermelinLWY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FellowsFHNR11,
author = {Michael R. Fellows and
Tobias Friedrich and
Danny Hermelin and
Nina Narodytska and
Frances A. Rosamond},
editor = {Toby Walsh},
title = {Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints
Tractable},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},
pages = {522--527},
publisher = {{IJCAI/AAAI}},
year = {2011},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-095},
doi = {10.5591/978-1-57735-516-8/IJCAI11-095},
timestamp = {Tue, 20 Aug 2019 16:16:04 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FellowsFHNR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HermelinHKW11,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Parameterized Two-Player Nash Equilibrium},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {215--226},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_20},
doi = {10.1007/978-3-642-25870-1\_20},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/HermelinHKW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-0976,
author = {Danny Hermelin and
Stefan Kratsch and
Karolina Soltys and
Magnus Wahlstr{\"{o}}m and
Xi Wu},
title = {Hierarchies of Inefficient Kernelizability},
journal = {CoRR},
volume = {abs/1110.0976},
year = {2011},
url = {http://arxiv.org/abs/1110.0976},
eprinttype = {arXiv},
eprint = {1110.0976},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-0976.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HermelinW11,
author = {Danny Hermelin and
Xi Wu},
title = {Weak Compositions and Their Applications to Polynomial Lower-Bounds
for Kernelization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-072}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/072},
eprinttype = {ECCC},
eprint = {TR11-072},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HermelinW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FellowsFHMR10,
author = {Michael R. Fellows and
J{\"{o}}rg Flum and
Danny Hermelin and
Moritz M{\"{u}}ller and
Frances A. Rosamond},
title = {W-Hierarchies Defined by Symmetric Gates},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {311--339},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9138-6},
doi = {10.1007/S00224-008-9138-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FellowsFHMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bar-YehudaHR10,
author = {Reuven Bar{-}Yehuda and
Danny Hermelin and
Dror Rawitz},
title = {An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex
Cover with Applications},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {1},
pages = {287--300},
year = {2010},
url = {https://doi.org/10.1137/090773313},
doi = {10.1137/090773313},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Bar-YehudaHR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ButmanHLR10,
author = {Ayelet Butman and
Danny Hermelin and
Moshe Lewenstein and
Dror Rawitz},
title = {Optimization problems in multiple-interval graphs},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {2},
pages = {40:1--40:18},
year = {2010},
url = {https://doi.org/10.1145/1721837.1721856},
doi = {10.1145/1721837.1721856},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ButmanHLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FertinHRV10,
author = {Guillaume Fertin and
Danny Hermelin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Finding common structured patterns in linear graphs},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {26-28},
pages = {2475--2486},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.02.017},
doi = {10.1016/J.TCS.2010.02.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FertinHRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NorHCERDS10,
author = {Igor Nor and
Danny Hermelin and
Sylvain Charlat and
Jan Engelstadter and
Max Reuter and
Olivier Duron and
Marie{-}France Sagot},
editor = {Amihood Amir and
Laxmi Parida},
title = {Mod/Resc Parsimony Inference},
booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
New York, NY, USA, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6129},
pages = {202--213},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13509-5\_19},
doi = {10.1007/978-3-642-13509-5\_19},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/NorHCERDS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Bar-YehudaHR10,
author = {Reuven Bar{-}Yehuda and
Danny Hermelin and
Dror Rawitz},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Minimum Vertex Cover in Rectangle Graphs},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {255--266},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_22},
doi = {10.1007/978-3-642-15775-2\_22},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Bar-YehudaHR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GotthilfHLL10,
author = {Zvi Gotthilf and
Danny Hermelin and
Gad M. Landau and
Moshe Lewenstein},
editor = {Edgar Ch{\'{a}}vez and
Stefano Lonardi},
title = {Restricted {LCS}},
booktitle = {String Processing and Information Retrieval - 17th International Symposium,
{SPIRE} 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6393},
pages = {250--257},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16321-0\_26},
doi = {10.1007/978-3-642-16321-0\_26},
timestamp = {Sat, 05 Sep 2020 18:08:29 +0200},
biburl = {https://dblp.org/rec/conf/spire/GotthilfHLL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-3332,
author = {Reuven Bar{-}Yehuda and
Danny Hermelin and
Dror Rawitz},
title = {Minimum Vertex Cover in Rectangle Graphs},
journal = {CoRR},
volume = {abs/1001.3332},
year = {2010},
url = {http://arxiv.org/abs/1001.3332},
eprinttype = {arXiv},
eprint = {1001.3332},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-3332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-1292,
author = {Igor Nor and
Danny Hermelin and
Sylvain Charlat and
Jan Engelstadter and
Max Reuter and
Olivier Duron and
Marie{-}France Sagot},
title = {Mod/Resc Parsimony Inference},
journal = {CoRR},
volume = {abs/1002.1292},
year = {2010},
url = {http://arxiv.org/abs/1002.1292},
eprinttype = {arXiv},
eprint = {1002.1292},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-1292.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1194,
author = {Danny Hermelin and
Gad M. Landau and
Shir Landau and
Oren Weimann},
title = {Unified Compression-Based Acceleration of Edit-Distance Computation},
journal = {CoRR},
volume = {abs/1004.1194},
year = {2010},
url = {http://arxiv.org/abs/1004.1194},
eprinttype = {arXiv},
eprint = {1004.1194},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1194.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-2063,
author = {Danny Hermelin and
Chien{-}Chung Huang and
Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Parameterized Two-Player Nash Equilibrium},
journal = {CoRR},
volume = {abs/1006.2063},
year = {2010},
url = {http://arxiv.org/abs/1006.2063},
eprinttype = {arXiv},
eprint = {1006.2063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-2063.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-0012,
author = {Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen and
Gerhard J. Woeginger},
title = {Domination When the Stars Are Out},
journal = {CoRR},
volume = {abs/1012.0012},
year = {2010},
url = {http://arxiv.org/abs/1012.0012},
eprinttype = {arXiv},
eprint = {1012.0012},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-0012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BodlaenderDFH09,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Danny Hermelin},
title = {On problems without polynomial kernels},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {8},
pages = {423--434},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2009.04.001},
doi = {10.1016/J.JCSS.2009.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BodlaenderDFH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FellowsHRV09,
author = {Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond and
St{\'{e}}phane Vialette},
title = {On the parameterized complexity of multiple-interval graph problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {53--61},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.065},
doi = {10.1016/J.TCS.2008.09.065},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FellowsHRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FellowsHHLRR09,
author = {Michael R. Fellows and
Tzvika Hartman and
Danny Hermelin and
Gad M. Landau and
Frances A. Rosamond and
Liat Rozenberg},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Haplotype Inference Constrained by Plausible Haplotype Data},
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 = {339--352},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_30},
doi = {10.1007/978-3-642-02441-2\_30},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/FellowsHHLRR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FellowsHR09,
author = {Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {149--160},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_12},
doi = {10.1007/978-3-642-11269-0\_12},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/FellowsHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/Ben-ZwiHLN09,
author = {Oren Ben{-}Zwi and
Danny Hermelin and
Daniel Lokshtanov and
Ilan Newman},
editor = {John Chuang and
Lance Fortnow and
Pearl Pu},
title = {An exact almost optimal algorithm for target set selection in social
networks},
booktitle = {Proceedings 10th {ACM} Conference on Electronic Commerce (EC-2009),
Stanford, California, USA, July 6--10, 2009},
pages = {355--362},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1566374.1566424},
doi = {10.1145/1566374.1566424},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/Ben-ZwiHLN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HermelinLLW09,
author = {Danny Hermelin and
Gad M. Landau and
Shir Landau and
Oren Weimann},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {A Unified Algorithm for Accelerating Edit-Distance Computation via
Text-Compression},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {529--540},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1804},
doi = {10.4230/LIPICS.STACS.2009.1804},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HermelinLLW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Bar-YehudaHR09,
author = {Reuven Bar{-}Yehuda and
Danny Hermelin and
Dror Rawitz},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Extension of the Nemhauser and Trotter Theorem to Generalized Vertex
Cover with Applications},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {13--24},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_2},
doi = {10.1007/978-3-642-12450-1\_2},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Bar-YehudaHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HermelinR09,
author = {Danny Hermelin and
Dror Rawitz},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Optimization Problems in Multiple Subtree Graphs},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {194--204},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_18},
doi = {10.1007/978-3-642-12450-1\_18},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HermelinR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-2649,
author = {Danny Hermelin and
Gad M. Landau and
Shir Landau and
Oren Weimann},
title = {A Unified Algorithm for Accelerating Edit-Distance Computation via
Text-Compression},
journal = {CoRR},
volume = {abs/0902.2649},
year = {2009},
url = {http://arxiv.org/abs/0902.2649},
eprinttype = {arXiv},
eprint = {0902.2649},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-2649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HermelinRRV08,
author = {Danny Hermelin and
Dror Rawitz and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {The Minimum Substring Cover problem},
journal = {Inf. Comput.},
volume = {206},
number = {11},
pages = {1303--1312},
year = {2008},
url = {https://doi.org/10.1016/j.ic.2008.06.002},
doi = {10.1016/J.IC.2008.06.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HermelinRRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlinFHV08,
author = {Guillaume Blin and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
title = {Fixed-parameter algorithms for protein similarity search under mRNA
structure constraints},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {618--626},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.03.004},
doi = {10.1016/J.JDA.2008.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlinFHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreHLRV08,
author = {Maxime Crochemore and
Danny Hermelin and
Gad M. Landau and
Dror Rawitz and
St{\'{e}}phane Vialette},
title = {Approximating the 2-interval pattern problem},
journal = {Theor. Comput. Sci.},
volume = {395},
number = {2-3},
pages = {283--297},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.01.007},
doi = {10.1016/J.TCS.2008.01.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrochemoreHLRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GotthilfHL08,
author = {Zvi Gotthilf and
Danny Hermelin and
Moshe Lewenstein},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Constrained {LCS:} Hardness and Approximation},
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 = {255--262},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_24},
doi = {10.1007/978-3-540-69068-9\_24},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GotthilfHL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderDFH08,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Danny Hermelin},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {On Problems without Polynomial Kernels (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {563--574},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_46},
doi = {10.1007/978-3-540-70575-8\_46},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderDFH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FellowsHMR08,
author = {Michael R. Fellows and
Danny Hermelin and
Moritz M{\"{u}}ller and
Frances A. Rosamond},
editor = {Martin Grohe and
Rolf Niedermeier},
title = {A Purely Democratic Characterization of {W[1]}},
booktitle = {Parameterized and Exact Computation, Third International Workshop,
{IWPEC} 2008, Victoria, Canada, May 14-16, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5018},
pages = {103--114},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79723-4\_11},
doi = {10.1007/978-3-540-79723-4\_11},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/FellowsHMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BlinBHGBE07,
author = {Guillaume Blin and
Eric Blais and
Danny Hermelin and
Pierre Guillon and
Mathieu Blanchette and
Nadia El{-}Mabrouk},
title = {Gene Maps Linearization Using Genomic Rearrangement Distances},
journal = {J. Comput. Biol.},
volume = {14},
number = {4},
pages = {394--407},
year = {2007},
url = {https://doi.org/10.1089/cmb.2007.A002},
doi = {10.1089/CMB.2007.A002},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BlinBHGBE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BackofenCHLRWZ07,
author = {Rolf Backofen and
Shihyen Chen and
Danny Hermelin and
Gad M. Landau and
Mikhail A. Roytberg and
Oren Weimann and
Kaizhong Zhang},
title = {Locality and Gaps in {RNA} Comparison},
journal = {J. Comput. Biol.},
volume = {14},
number = {8},
pages = {1074--1087},
year = {2007},
url = {https://doi.org/10.1089/cmb.2007.0062},
doi = {10.1089/CMB.2007.0062},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BackofenCHLRWZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FertinHRV07,
author = {Guillaume Fertin and
Danny Hermelin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Common Structured Patterns in Linear Graphs: Approximation and Combinatorics},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
London, Canada, July 9-11, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {241--252},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_25},
doi = {10.1007/978-3-540-73437-6\_25},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FertinHRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FellowsFHV07,
author = {Michael R. Fellows and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored
Graphs},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {340--351},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_31},
doi = {10.1007/978-3-540-73420-8\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FellowsFHV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ButmanHLR07,
author = {Ayelet Butman and
Danny Hermelin and
Moshe Lewenstein and
Dror Rawitz},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Optimization problems in multiple-interval graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {268--277},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283412},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/ButmanHLR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HermelinRRV07,
author = {Danny Hermelin and
Dror Rawitz and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Christos Kaklamanis and
Martin Skutella},
title = {The Minimum Substring Cover Problem},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4927},
pages = {170--183},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77918-6\_14},
doi = {10.1007/978-3-540-77918-6\_14},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HermelinRRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BackofenHLW06,
author = {Rolf Backofen and
Danny Hermelin and
Gad M. Landau and
Oren Weimann},
editor = {Moshe Lewenstein and
Gabriel Valiente},
title = {Local Alignment of {RNA} Sequences with Arbitrary Scoring Schemes},
booktitle = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
Barcelona, Spain, July 5-7, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4009},
pages = {246--257},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780441\_23},
doi = {10.1007/11780441\_23},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BackofenHLW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CrochemoreHLV05,
author = {Maxime Crochemore and
Danny Hermelin and
Gad M. Landau and
St{\'{e}}phane Vialette},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Approximating the 2-Interval Pattern Problem},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {426--437},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_39},
doi = {10.1007/11561071\_39},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/CrochemoreHLV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BackofenHLW05,
author = {Rolf Backofen and
Danny Hermelin and
Gad M. Landau and
Oren Weimann},
editor = {Mariano P. Consens and
Gonzalo Navarro},
title = {Normalized Similarity of {RNA} Sequences},
booktitle = {String Processing and Information Retrieval, 12th International Conference,
{SPIRE} 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3772},
pages = {360--369},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11575832\_40},
doi = {10.1007/11575832\_40},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/spire/BackofenHLW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BlinFHV05,
author = {Guillaume Blin and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
editor = {Dieter Kratsch},
title = {Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA
Structure Constraints},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {271--282},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_24},
doi = {10.1007/11604686\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BlinFHV05.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-04-25 05:52 CEST 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:
