Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ignasi Sau
@article{DBLP:journals/algorithmica/AraujoBCS23,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
title = {Parameterized Complexity of Computing Maximum Minimal Blocking and
Hitting Sets},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {444--491},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01036-5},
doi = {10.1007/S00453-022-01036-5},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoBCS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KeilerLMSS23,
author = {Lucas Keiler and
Carlos Vin{\'{\i}}cius G. C. Lima and
Ana Karolinna Maia and
Rudini M. Sampaio and
Ignasi Sau},
title = {Target set selection with maximum activation time},
journal = {Discret. Appl. Math.},
volume = {338},
pages = {199--217},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.004},
doi = {10.1016/J.DAM.2023.06.004},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KeilerLMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LimaSSST23,
author = {Paloma T. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Prafullkumar Tale},
title = {Reducing the vertex cover number via edge contractions},
journal = {J. Comput. Syst. Sci.},
volume = {136},
pages = {63--87},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.03.003},
doi = {10.1016/J.JCSS.2023.03.003},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/LimaSSST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/SauST23,
author = {Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {\emph{k}-apices of minor-closed graph classes. I. Bounding the obstructions},
journal = {J. Comb. Theory, Ser. {B}},
volume = {161},
pages = {180--227},
year = {2023},
url = {https://doi.org/10.1016/j.jctb.2023.02.012},
doi = {10.1016/J.JCTB.2023.02.012},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/SauST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BasteST23,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting Minors on Bounded Treewidth Graphs. {IV.} An Optimal Algorithm},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {4},
pages = {865--912},
year = {2023},
url = {https://doi.org/10.1137/21m140482x},
doi = {10.1137/21M140482X},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BasteST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CamposC0S23,
author = {Victor A. Campos and
Jonas Costa and
Raul Lopes and
Ignasi Sau},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {New Menger-Like Dualities in Digraphs and Applications to Half-Integral
Linkages},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {30:1--30:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.30},
doi = {10.4230/LIPICS.ESA.2023.30},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/CamposC0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FominGSST23,
author = {Fedor V. Fomin and
Petr A. Golovach and
Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Compound Logics for Modification Problems},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {61:1--61:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.61},
doi = {10.4230/LIPICS.ICALP.2023.61},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FominGSST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MorelleSST23,
author = {Laure Morelle and
Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Faster Parameterized Algorithms for Modification Problems to Minor-Closed
Classes},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {93:1--93:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.93},
doi = {10.4230/LIPICS.ICALP.2023.93},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MorelleSST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JaffkeMST23,
author = {Lars Jaffke and
Laure Morelle and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Dynamic Programming on Bipartite Tree Decompositions},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {26:1--26:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.26},
doi = {10.4230/LIPICS.IPEC.2023.26},
timestamp = {Wed, 13 Dec 2023 14:08:59 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/JaffkeMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-16134,
author = {Victor A. Campos and
Jonas Costa and
Raul Lopes and
Ignasi Sau},
title = {New Menger-like dualities in digraphs and applications to half-integral
linkages},
journal = {CoRR},
volume = {abs/2306.16134},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.16134},
doi = {10.48550/ARXIV.2306.16134},
eprinttype = {arXiv},
eprint = {2306.16134},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-16134.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-06700,
author = {Nicolas Nisse and
Lucas Picasarri{-}Arrieta and
Ignasi Sau},
title = {Redicolouring digraphs: directed treewidth and cycle-degeneracy},
journal = {CoRR},
volume = {abs/2307.06700},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.06700},
doi = {10.48550/ARXIV.2307.06700},
eprinttype = {arXiv},
eprint = {2307.06700},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-06700.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-07754,
author = {Lars Jaffke and
Laure Morelle and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Dynamic programming on bipartite tree decompositions},
journal = {CoRR},
volume = {abs/2309.07754},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.07754},
doi = {10.48550/ARXIV.2309.07754},
eprinttype = {arXiv},
eprint = {2309.07754},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-07754.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-17224,
author = {Lu{\'{\i}}s Cunha and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {On the Complexity of the Median and Closest Permutation Problems},
journal = {CoRR},
volume = {abs/2311.17224},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.17224},
doi = {10.48550/ARXIV.2311.17224},
eprinttype = {arXiv},
eprint = {2311.17224},
timestamp = {Tue, 05 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-17224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoBCS22,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
title = {Introducing lop-Kernels: {A} Framework for Kernelization Lower Bounds},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3365--3406},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00979-z},
doi = {10.1007/S00453-022-00979-Z},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoBCS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CamposLMS22,
author = {Victor A. Campos and
Raul Lopes and
Ana Karolinna Maia and
Ignasi Sau},
title = {Adapting the Directed Grid Theorem into an {FPT} Algorithm},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1887--1917},
year = {2022},
url = {https://doi.org/10.1137/21m1452664},
doi = {10.1137/21M1452664},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CamposLMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BougeretJS22,
author = {Marin Bougeret and
Bart M. P. Jansen and
Ignasi Sau},
title = {Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations
of Vertex Cover Admit a Polynomial Kernel},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2737--2773},
year = {2022},
url = {https://doi.org/10.1137/21m1400766},
doi = {10.1137/21M1400766},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BougeretJS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SauST22,
author = {Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {\emph{k}-apices of Minor-closed Graph Classes. {II.} Parameterized
Algorithms},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {3},
pages = {21:1--21:30},
year = {2022},
url = {https://doi.org/10.1145/3519028},
doi = {10.1145/3519028},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/SauST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LopesS22,
author = {Raul Lopes and
Ignasi Sau},
title = {A relaxation of the Directed Disjoint Paths problem: {A} global congestion
metric helps},
journal = {Theor. Comput. Sci.},
volume = {898},
pages = {75--91},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.10.023},
doi = {10.1016/J.TCS.2021.10.023},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LopesS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LimaSSST22,
author = {Paloma T. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Prafullkumar Tale},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Reducing the Vertex Cover Number via Edge Contractions},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {69:1--69:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.69},
doi = {10.4230/LIPICS.MFCS.2022.69},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LimaSSST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-03322,
author = {Paloma T. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Prafullkumar Tale},
title = {Reducing the Vertex Cover Number via Edge Contractions},
journal = {CoRR},
volume = {abs/2202.03322},
year = {2022},
url = {https://arxiv.org/abs/2202.03322},
eprinttype = {arXiv},
eprint = {2202.03322},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-03322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02167,
author = {Laure Morelle and
Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {Faster parameterized algorithms for modification problems to minor-closed
classes},
journal = {CoRR},
volume = {abs/2210.02167},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02167},
doi = {10.48550/ARXIV.2210.02167},
eprinttype = {arXiv},
eprint = {2210.02167},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GomesS21,
author = {Guilherme de C. M. Gomes and
Ignasi Sau},
title = {Finding Cuts of Bounded Degree: Complexity, {FPT} and Exact Algorithms,
and Kernelization},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1677--1706},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00798-8},
doi = {10.1007/S00453-021-00798-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GomesS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteS21,
author = {R{\'{e}}my Belmonte and
Ignasi Sau},
title = {On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2351--2373},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00830-x},
doi = {10.1007/S00453-021-00830-X},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CamposGILSS21,
author = {Victor A. Campos and
Guilherme de C. M. Gomes and
Allen Ibiapina and
Raul Lopes and
Ignasi Sau and
Ana Silva},
title = {Coloring Problems on Bipartite Graphs of Small Diameter},
journal = {Electron. J. Comb.},
volume = {28},
number = {2},
pages = {2},
year = {2021},
url = {https://doi.org/10.37236/9931},
doi = {10.37236/9931},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CamposGILSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/SauS21,
author = {Ignasi Sau and
U{\'{e}}verton dos Santos Souza},
title = {Hitting forbidden induced subgraphs on bounded treewidth graphs},
journal = {Inf. Comput.},
volume = {281},
pages = {104812},
year = {2021},
url = {https://doi.org/10.1016/j.ic.2021.104812},
doi = {10.1016/J.IC.2021.104812},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/SauS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/VianaCSS21,
author = {Luiz Alberto do Carmo Viana and
Manoel B. Camp{\^{e}}lo and
Ignasi Sau and
Ana Silva},
title = {A unifying model for locally constrained spanning tree problems},
journal = {J. Comb. Optim.},
volume = {42},
number = {1},
pages = {125--150},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00740-2},
doi = {10.1007/S10878-021-00740-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/VianaCSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LimaSSS21,
author = {Paloma T. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {Reducing graph transversals via edge contractions},
journal = {J. Comput. Syst. Sci.},
volume = {120},
pages = {62--74},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.03.003},
doi = {10.1016/J.JCSS.2021.03.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/LimaSSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AraujoBCS21,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {A New Framework for Kernelization Lower Bounds: The Case of Maximum
Minimal Vertex Cover},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {4:1--4:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.4},
doi = {10.4230/LIPICS.IPEC.2021.4},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/AraujoBCS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/KeilerLMSS21,
author = {Lucas Keiler and
Carlos V. G. C. Lima and
Ana Karolinna Maia and
Rudini Menezes Sampaio and
Ignasi Sau},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Target set selection with maximum activation time},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {86--96},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.014},
doi = {10.1016/J.PROCS.2021.11.014},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lagos/KeilerLMSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-02484,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
title = {Introducing lop-kernels: a framework for kernelization lower bounds},
journal = {CoRR},
volume = {abs/2102.02484},
year = {2021},
url = {https://arxiv.org/abs/2102.02484},
eprinttype = {arXiv},
eprint = {2102.02484},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-02484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-03404,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Marin Bougeret and
Victor A. Campos and
Ignasi Sau},
title = {Parameterized complexity of computing maximum minimal blocking and
hitting sets},
journal = {CoRR},
volume = {abs/2102.03404},
year = {2021},
url = {https://arxiv.org/abs/2102.03404},
eprinttype = {arXiv},
eprint = {2102.03404},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-03404.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06463,
author = {Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {A more accurate view of the Flat Wall Theorem},
journal = {CoRR},
volume = {abs/2102.06463},
year = {2021},
url = {https://arxiv.org/abs/2102.06463},
eprinttype = {arXiv},
eprint = {2102.06463},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06463.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-00882,
author = {Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {k-apices of minor-closed graph classes. I. Bounding the obstructions},
journal = {CoRR},
volume = {abs/2103.00882},
year = {2021},
url = {https://arxiv.org/abs/2103.00882},
eprinttype = {arXiv},
eprint = {2103.00882},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-00882.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-06536,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting minors on bounded treewidth graphs. {II.} Single-exponential
algorithms},
journal = {CoRR},
volume = {abs/2103.06536},
year = {2021},
url = {https://arxiv.org/abs/2103.06536},
eprinttype = {arXiv},
eprint = {2103.06536},
timestamp = {Tue, 16 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-06536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-06614,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting minors on bounded treewidth graphs. {III.} Lower bounds},
journal = {CoRR},
volume = {abs/2103.06614},
year = {2021},
url = {https://arxiv.org/abs/2103.06614},
eprinttype = {arXiv},
eprint = {2103.06614},
timestamp = {Tue, 16 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-06614.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-01582,
author = {St{\'{e}}phane Bessy and
Florian H{\"{o}}rsch and
Ana Karolinna Maia and
Dieter Rautenbach and
Ignasi Sau},
title = {{FPT} algorithms for packing k-safe spanning rooted sub(di)graphs},
journal = {CoRR},
volume = {abs/2105.01582},
year = {2021},
url = {https://arxiv.org/abs/2105.01582},
eprinttype = {arXiv},
eprint = {2105.01582},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-01582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-02755,
author = {Fedor V. Fomin and
Petr A. Golovach and
Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {Compound Logics for Modification Problems},
journal = {CoRR},
volume = {abs/2111.02755},
year = {2021},
url = {https://arxiv.org/abs/2111.02755},
eprinttype = {arXiv},
eprint = {2111.02755},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-02755.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoCMSS20,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Ana Karolinna Maia and
Ignasi Sau and
Ana Silva},
title = {On the Complexity of Finding Internally Vertex-Disjoint Long Directed
Paths},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1616--1639},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00659-5},
doi = {10.1007/S00453-019-00659-5},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoCMSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AraujoCLSSS20,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Carlos Vin{\'{\i}}cius G. C. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
Ana Silva},
title = {Dual Parameterization of Weighted Coloring},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2316--2336},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00686-7},
doi = {10.1007/S00453-020-00686-7},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AraujoCLSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FariaKSSS20,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Rubens Sucupira},
title = {Maximum cuts in edge-colored graphs},
journal = {Discret. Appl. Math.},
volume = {281},
pages = {229--234},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.02.038},
doi = {10.1016/J.DAM.2019.02.038},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FariaKSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BasteST20,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting minors on bounded treewidth graphs. {III.} Lower bounds},
journal = {J. Comput. Syst. Sci.},
volume = {109},
pages = {56--77},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2019.11.002},
doi = {10.1016/J.JCSS.2019.11.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BasteST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BasteGPSST20,
author = {Julien Baste and
Didem G{\"{o}}z{\"{u}}pek and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom and
Dimitrios M. Thilikos},
title = {Parameterized complexity of finding a spanning tree with minimum reload
cost diameter},
journal = {Networks},
volume = {75},
number = {3},
pages = {259--277},
year = {2020},
url = {https://doi.org/10.1002/net.21923},
doi = {10.1002/NET.21923},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BasteGPSST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BasteST20,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {3},
pages = {1623--1648},
year = {2020},
url = {https://doi.org/10.1137/19M1287146},
doi = {10.1137/19M1287146},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BasteST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BasteST20,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting minors on bounded treewidth graphs. {II.} Single-exponential
algorithms},
journal = {Theor. Comput. Sci.},
volume = {814},
pages = {135--152},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.01.026},
doi = {10.1016/J.TCS.2020.01.026},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BasteST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BougeretJS20,
author = {Marin Bougeret and
Bart M. P. Jansen and
Ignasi Sau},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Bridge-Depth Characterizes Which Structural Parameterizations of Vertex
Cover Admit a Polynomial Kernel},
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 = {16:1--16:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.16},
doi = {10.4230/LIPICS.ICALP.2020.16},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BougeretJS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/SauST20,
author = {Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes},
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 = {95:1--95:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.95},
doi = {10.4230/LIPICS.ICALP.2020.95},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/SauST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LimaSSS20,
author = {Paloma T. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
U{\'{e}}verton S. Souza},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Reducing Graph Transversals via Edge Contractions},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {64:1--64:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.64},
doi = {10.4230/LIPICS.MFCS.2020.64},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/LimaSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/0001S20,
author = {Raul Lopes and
Ignasi Sau},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {A Relaxation of the Directed Disjoint Paths Problem: {A} Global Congestion
Metric Helps},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {68:1--68:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.68},
doi = {10.4230/LIPICS.MFCS.2020.68},
timestamp = {Wed, 26 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/0001S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/SauS20,
author = {Ignasi Sau and
U{\'{e}}verton dos Santos Souza},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {82:1--82:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.82},
doi = {10.4230/LIPICS.MFCS.2020.82},
timestamp = {Wed, 26 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/SauS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BasteST20,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Shuchi Chawla},
title = {A complexity dichotomy for hitting connected minors on bounded treewidth
graphs: the chair and the banner draw the boundary},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {951--970},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.57},
doi = {10.1137/1.9781611975994.57},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BasteST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BelmonteS20,
author = {R{\'{e}}my Belmonte and
Ignasi Sau},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {67--79},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_6},
doi = {10.1007/978-3-030-60440-0\_6},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BelmonteS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-06078,
author = {R{\'{e}}my Belmonte and
Ignasi Sau},
title = {On the complexity of finding large odd induced subgraphs and odd colorings},
journal = {CoRR},
volume = {abs/2002.06078},
year = {2020},
url = {https://arxiv.org/abs/2002.06078},
eprinttype = {arXiv},
eprint = {2002.06078},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-06078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08324,
author = {Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {Hitting forbidden induced subgraphs on bounded treewidth graphs},
journal = {CoRR},
volume = {abs/2004.08324},
year = {2020},
url = {https://arxiv.org/abs/2004.08324},
eprinttype = {arXiv},
eprint = {2004.08324},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08324.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-11173,
author = {Victor A. Campos and
Guilherme de C. M. Gomes and
Allen Ibiapina and
Raul Lopes and
Ignasi Sau and
Ana Silva},
title = {Coloring Problems on Bipartite Graphs of Small Diameter},
journal = {CoRR},
volume = {abs/2004.11173},
year = {2020},
url = {https://arxiv.org/abs/2004.11173},
eprinttype = {arXiv},
eprint = {2004.11173},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-11173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12692,
author = {Ignasi Sau and
Giannos Stamoulis and
Dimitrios M. Thilikos},
title = {k-apices of minor-closed graph classes. {II.} Parameterized algorithms},
journal = {CoRR},
volume = {abs/2004.12692},
year = {2020},
url = {https://arxiv.org/abs/2004.12692},
eprinttype = {arXiv},
eprint = {2004.12692},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12692.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12865,
author = {Marin Bougeret and
Bart M. P. Jansen and
Ignasi Sau},
title = {Bridge-Depth Characterizes which Structural Parameterizations of Vertex
Cover Admit a Polynomial Kernel},
journal = {CoRR},
volume = {abs/2004.12865},
year = {2020},
url = {https://arxiv.org/abs/2004.12865},
eprinttype = {arXiv},
eprint = {2004.12865},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12865.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-01460,
author = {Paloma T. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {Reducing graph transversals via edge contractions},
journal = {CoRR},
volume = {abs/2005.01460},
year = {2020},
url = {https://arxiv.org/abs/2005.01460},
eprinttype = {arXiv},
eprint = {2005.01460},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-01460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-10328,
author = {Luiz Alberto do Carmo Viana and
Manoel B. Camp{\^{e}}lo and
Ignasi Sau and
Ana Silva},
title = {A Unifying Model for Locally Constrained Spanning Tree Problems},
journal = {CoRR},
volume = {abs/2005.10328},
year = {2020},
url = {https://arxiv.org/abs/2005.10328},
eprinttype = {arXiv},
eprint = {2005.10328},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-10328.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-05246,
author = {Lucas Keiler and
Carlos Vin{\'{\i}}cius G. C. Lima and
Ana Karolinna Maia and
Rudini M. Sampaio and
Ignasi Sau},
title = {Target set selection with maximum activation time},
journal = {CoRR},
volume = {abs/2007.05246},
year = {2020},
url = {https://arxiv.org/abs/2007.05246},
eprinttype = {arXiv},
eprint = {2007.05246},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-05246.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-07738,
author = {Victor A. Campos and
Raul Lopes and
Ana Karolinna Maia and
Ignasi Sau},
title = {Adapting the Directed Grid Theorem into an {FPT} Algorithm},
journal = {CoRR},
volume = {abs/2007.07738},
year = {2020},
url = {https://arxiv.org/abs/2007.07738},
eprinttype = {arXiv},
eprint = {2007.07738},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-07738.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GarneroPST19,
author = {Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Explicit Linear Kernels for Packing Problems},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1615--1656},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0495-5},
doi = {10.1007/S00453-018-0495-5},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GarneroPST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BougeretS19,
author = {Marin Bougeret and
Ignasi Sau},
title = {How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels
Beyond Sparse Graphs?},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4043--4068},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0468-8},
doi = {10.1007/S00453-018-0468-8},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BougeretS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BasteRS19,
author = {Julien Baste and
Dieter Rautenbach and
Ignasi Sau},
title = {Approximating maximum uniquely restricted matchings in bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {267},
pages = {30--40},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.04.024},
doi = {10.1016/J.DAM.2019.04.024},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BasteRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BastosBMS19,
author = {Josefran de Oliveira Bastos and
Fabr{\'{\i}}cio Siqueira Benevides and
Guilherme Oliveira Mota and
Ignasi Sau},
title = {Counting Gallai 3-colorings of complete graphs},
journal = {Discret. Math.},
volume = {342},
number = {9},
pages = {2618--2631},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2019.05.015},
doi = {10.1016/J.DISC.2019.05.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BastosBMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BasteRS19,
author = {Julien Baste and
Dieter Rautenbach and
Ignasi Sau},
title = {Upper bounds on the uniquely restricted chromatic index},
journal = {J. Graph Theory},
volume = {91},
number = {3},
pages = {251--258},
year = {2019},
url = {https://doi.org/10.1002/jgt.22429},
doi = {10.1002/JGT.22429},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BasteRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AraujoSSS19,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Cl{\'{a}}udia Linhares Sales and
Ignasi Sau and
Ana Silva},
title = {Weighted proper orientations of trees and graphs of bounded treewidth},
journal = {Theor. Comput. Sci.},
volume = {771},
pages = {39--48},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.11.013},
doi = {10.1016/J.TCS.2018.11.013},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AraujoSSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GomesS19,
author = {Guilherme de C. M. Gomes and
Ignasi Sau},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Finding Cuts of Bounded Degree: Complexity, {FPT} and Exact Algorithms,
and Kernelization},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {19:1--19:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.19},
doi = {10.4230/LIPICS.IPEC.2019.19},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GomesS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/CamposLMS19,
author = {Victor A. Campos and
Raul Lopes and
Ana Karolinna Maia and
Ignasi Sau},
editor = {Gabriel Coutinho and
Yoshiharu Kohayakawa and
Vin{\'{\i}}cius Fernandes dos Santos and
Sebasti{\'{a}}n Urrutia},
title = {Adapting The Directed Grid Theorem into an {FPT} Algorithm},
booktitle = {Proceedings of the tenth Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June
2-7, 2019},
series = {Electronic Notes in Theoretical Computer Science},
volume = {346},
pages = {229--240},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.entcs.2019.08.021},
doi = {10.1016/J.ENTCS.2019.08.021},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/CamposLMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2019,
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8},
doi = {10.1007/978-3-030-30786-8},
isbn = {978-3-030-30785-1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-03134,
author = {Guilherme de C. M. Gomes and
Ignasi Sau},
title = {Finding cuts of bounded degree: complexity, {FPT} and exact algorithms,
and kernelization},
journal = {CoRR},
volume = {abs/1905.03134},
year = {2019},
url = {http://arxiv.org/abs/1905.03134},
eprinttype = {arXiv},
eprint = {1905.03134},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-03134.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04442,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting minors on bounded treewidth graphs. {IV.} An optimal algorithm},
journal = {CoRR},
volume = {abs/1907.04442},
year = {2019},
url = {http://arxiv.org/abs/1907.04442},
eprinttype = {arXiv},
eprint = {1907.04442},
timestamp = {Fri, 12 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04442.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-13848,
author = {Raul Lopes and
Ignasi Sau},
title = {A relaxation of the Directed Disjoint Paths problem: a global congestion
metric helps},
journal = {CoRR},
volume = {abs/1909.13848},
year = {2019},
url = {http://arxiv.org/abs/1909.13848},
eprinttype = {arXiv},
eprint = {1909.13848},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-13848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/hal/Sau18,
author = {Ignasi Sau},
title = {Some Contributions to Parameterized Complexity. (Quelques Contributions
en Complexit{\'{e}} Param{\'{e}}tr{\'{e}}e)},
year = {2018},
url = {https://tel.archives-ouvertes.fr/tel-02079241},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/hal/Sau18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimOPST18,
author = {Eun Jung Kim and
Sang{-}il Oum and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An {FPT} 2-Approximation for Tree-Cut Decomposition},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {116--135},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0245-5},
doi = {10.1007/S00453-016-0245-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KimOPST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chatzidimitriou18,
author = {Dimitris Chatzidimitriou and
Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An O(log OPT)-Approximation for Covering and Packing Minor Models
of {\texttheta}\({}_{\mbox{r}}\)},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1330--1356},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0313-5},
doi = {10.1007/S00453-017-0313-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Chatzidimitriou18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CrayS18,
author = {Henri Perret du Cray and
Ignasi Sau},
title = {Improved {FPT} algorithms for weighted independent set in bull-free
graphs},
journal = {Discret. Math.},
volume = {341},
number = {2},
pages = {451--462},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.09.012},
doi = {10.1016/J.DISC.2017.09.012},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CrayS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/GarneroS18,
author = {Valentin Garnero and
Ignasi Sau},
title = {A Linear Kernel for Planar Total Dominating Set},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {20},
number = {1},
year = {2018},
url = {https://doi.org/10.23638/DMTCS-20-1-14},
doi = {10.23638/DMTCS-20-1-14},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/GarneroS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BasteNS18,
author = {Julien Baste and
Marc Noy and
Ignasi Sau},
title = {On the number of labeled graphs of bounded treewidth},
journal = {Eur. J. Comb.},
volume = {71},
pages = {12--21},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2018.02.030},
doi = {10.1016/J.EJC.2018.02.030},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BasteNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CohenHMSW18,
author = {Nathann Cohen and
Fr{\'{e}}d{\'{e}}ric Havet and
Dorian Mazauric and
Ignasi Sau and
R{\'{e}}mi Watrigant},
title = {Complexity dichotomies for the MinimumF-Overlay problem},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {133--142},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.010},
doi = {10.1016/J.JDA.2018.11.010},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CohenHMSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AboulkerFHJRS18,
author = {Pierre Aboulker and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Jean{-}Florent Raymond and
Ignasi Sau},
title = {A Tight Erd{\"{o}}s-P{\'{o}}sa Function for Wheel Minors},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {2302--2312},
year = {2018},
url = {https://doi.org/10.1137/17M1153169},
doi = {10.1137/17M1153169},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/AboulkerFHJRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AraujoBS18,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Julien Baste and
Ignasi Sau},
title = {Ruling out {FPT} algorithms for Weighted Coloring on forests},
journal = {Theor. Comput. Sci.},
volume = {729},
pages = {11--19},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.03.013},
doi = {10.1016/J.TCS.2018.03.013},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AraujoBS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlvesDFKSS18,
author = {Sancrey Rodrigues Alves and
Konrad K. Dabrowski and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {On the (parameterized) complexity of recognizing well-covered (\emph{r},
\emph{{\(\mathscr{l}\)}})-graph},
journal = {Theor. Comput. Sci.},
volume = {746},
pages = {36--48},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.06.024},
doi = {10.1016/J.TCS.2018.06.024},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlvesDFKSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BasteST18,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {A Complexity Dichotomy for Hitting Small Planar Minors Parameterized
by Treewidth},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {2:1--2:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.2},
doi = {10.4230/LIPICS.IPEC.2018.2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BasteST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AraujoCLSSS18,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Carlos Vin{\'{\i}}cius G. C. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
Ana Silva},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Dual Parameterization of Weighted Coloring},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.12},
doi = {10.4230/LIPICS.IPEC.2018.12},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/AraujoCLSSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AraujoCMSS18,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Ana Karolinna Maia and
Ignasi Sau and
Ana Silva},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {On the Complexity of Finding Internally Vertex-Disjoint Long Directed
Paths},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {66--79},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_6},
doi = {10.1007/978-3-319-77404-6\_6},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/AraujoCMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03884,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Cl{\'{a}}udia Linhares Sales and
Ignasi Sau and
Ana Silva},
title = {Weighted proper orientations of trees and graphs of bounded treewidth},
journal = {CoRR},
volume = {abs/1804.03884},
year = {2018},
url = {http://arxiv.org/abs/1804.03884},
eprinttype = {arXiv},
eprint = {1804.03884},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03884.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-00858,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza and
Rubens Sucupira},
title = {Maximum cuts in edge-colored graphs},
journal = {CoRR},
volume = {abs/1805.00858},
year = {2018},
url = {http://arxiv.org/abs/1805.00858},
eprinttype = {arXiv},
eprint = {1805.00858},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-00858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-06699,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Carlos Vin{\'{\i}}cius G. C. Lima and
Vin{\'{\i}}cius Fernandes dos Santos and
Ignasi Sau and
Ana Silva},
title = {Dual parameterization of Weighted Coloring},
journal = {CoRR},
volume = {abs/1805.06699},
year = {2018},
url = {http://arxiv.org/abs/1805.06699},
eprinttype = {arXiv},
eprint = {1805.06699},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-06699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GarneroST17,
author = {Valentin Garnero and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {A linear kernel for planar red-blue dominating set},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {536--547},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.09.045},
doi = {10.1016/J.DAM.2016.09.045},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GarneroST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/FariaKSS17,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
Rubens Sucupira},
title = {Improved kernels for Signed Max Cut parameterized above lower bound
on (r, l)-graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {1},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-1-14},
doi = {10.23638/DMTCS-19-1-14},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/FariaKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Chatzidimitriou17,
author = {Dimitris Chatzidimitriou and
Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Minors in graphs of large {\textTheta}\({}_{\mbox{r}}\)-girth},
journal = {Eur. J. Comb.},
volume = {65},
pages = {106--121},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.04.011},
doi = {10.1016/J.EJC.2017.04.011},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Chatzidimitriou17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SucupiraFKSS17,
author = {Rubens Sucupira and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {Maximum Cuts in Edge-colored Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {87--92},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.016},
doi = {10.1016/J.ENDM.2017.10.016},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SucupiraFKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AraujoBS17,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Julien Baste and
Ignasi Sau},
title = {Ruling out {FPT} algorithms for Weighted Coloring on forests},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {195--200},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.034},
doi = {10.1016/J.ENDM.2017.10.034},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AraujoBS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BasteBKS17,
author = {Julien Baste and
Fairouz Beggas and
Hamamache Kheddouci and
Ignasi Sau},
title = {On the parameterized complexity of the Edge Monitoring problem},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {39--44},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.008},
doi = {10.1016/J.IPL.2017.01.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BasteBKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KimPST17,
author = {Eun Jung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Parameterized algorithms for min-max multiway cut and list digraph
homomorphism},
journal = {J. Comput. Syst. Sci.},
volume = {86},
pages = {191--206},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.01.003},
doi = {10.1016/J.JCSS.2017.01.003},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KimPST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CohenGKPSTW17,
author = {Nathann Cohen and
Daniel Gon{\c{c}}alves and
Eun Jung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos and
Mathias Weller},
title = {A polynomial-time algorithm for Outerplanar Diameter Improvement},
journal = {J. Comput. Syst. Sci.},
volume = {89},
pages = {315--327},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.05.016},
doi = {10.1016/J.JCSS.2017.05.016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/CohenGKPSTW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BasteFKS17,
author = {Julien Baste and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau},
title = {Parameterized Complexity Dichotomy for (r, {\(\mathscr{l}\)})-Vertex
Deletion},
journal = {Theory Comput. Syst.},
volume = {61},
number = {3},
pages = {777--794},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9716-y},
doi = {10.1007/S00224-016-9716-Y},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BasteFKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MontejanoS17,
author = {Luis Pedro Montejano and
Ignasi Sau},
title = {On the complexity of computing the k-restricted edge-connectivity
of a graph},
journal = {Theor. Comput. Sci.},
volume = {662},
pages = {31--39},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.12.006},
doi = {10.1016/J.TCS.2016.12.006},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MontejanoS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GozupekOPSS17,
author = {Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom},
title = {Parameterized complexity of the {MINCCA} problem on graphs of bounded
decomposability},
journal = {Theor. Comput. Sci.},
volume = {690},
pages = {91--103},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.06.013},
doi = {10.1016/J.TCS.2017.06.013},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GozupekOPSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CohenHMSW17,
author = {Nathann Cohen and
Fr{\'{e}}d{\'{e}}ric Havet and
Dorian Mazauric and
Ignasi Sau and
R{\'{e}}mi Watrigant},
editor = {Ljiljana Brankovic and
Joe Ryan and
William F. Smyth},
title = {Complexity Dichotomies for the Minimum {\(\mathscr{F}\)} -Overlay
Problem},
booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10765},
pages = {116--127},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-78825-8\_10},
doi = {10.1007/978-3-319-78825-8\_10},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/CohenHMSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BasteGPSST17,
author = {Julien Baste and
Didem G{\"{o}}z{\"{u}}pek and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom and
Dimitrios M. Thilikos},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Parameterized Complexity of Finding a Spanning Tree with Minimum Reload
Cost Diameter},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.3},
doi = {10.4230/LIPICS.IPEC.2017.3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BasteGPSST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BasteST17,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded
Treewidth},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.4},
doi = {10.4230/LIPICS.IPEC.2017.4},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BasteST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BougeretS17,
author = {Marin Bougeret and
Ignasi Sau},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels
Beyond Sparse Graphs?},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {10:1--10:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.10},
doi = {10.4230/LIPICS.IPEC.2017.10},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BougeretS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BasteNS17,
author = {Julien Baste and
Marc Noy and
Ignasi Sau},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {On the Number of Labeled Graphs of Bounded Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {88--99},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_7},
doi = {10.1007/978-3-319-68705-6\_7},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BasteNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BasteRS17,
author = {Julien Baste and
Dieter Rautenbach and
Ignasi Sau},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Uniquely Restricted Matchings and Edge Colorings},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {100--112},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_8},
doi = {10.1007/978-3-319-68705-6\_8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BasteRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteGPSST17,
author = {Julien Baste and
Didem G{\"{o}}z{\"{u}}pek and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom and
Dimitrios M. Thilikos},
title = {Parameterized complexity of finding a spanning tree with minimum reload
cost diameter},
journal = {CoRR},
volume = {abs/1703.01686},
year = {2017},
url = {http://arxiv.org/abs/1703.01686},
eprinttype = {arXiv},
eprint = {1703.01686},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BasteGPSST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenHMSW17,
author = {Nathann Cohen and
Fr{\'{e}}d{\'{e}}ric Havet and
Dorian Mazauric and
Ignasi Sau and
R{\'{e}}mi Watrigant},
title = {Complexity Dichotomies for the Minimum F-Overlay Problem},
journal = {CoRR},
volume = {abs/1703.05156},
year = {2017},
url = {http://arxiv.org/abs/1703.05156},
eprinttype = {arXiv},
eprint = {1703.05156},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/CohenHMSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AraujoBS17,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Julien Baste and
Ignasi Sau},
title = {Ruling out {FPT} algorithms for Weighted Coloring on forests},
journal = {CoRR},
volume = {abs/1703.09726},
year = {2017},
url = {http://arxiv.org/abs/1703.09726},
eprinttype = {arXiv},
eprint = {1703.09726},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AraujoBS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteST17,
author = {Julien Baste and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Hitting minors on bounded treewidth graphs. I. General upper bounds},
journal = {CoRR},
volume = {abs/1704.07284},
year = {2017},
url = {http://arxiv.org/abs/1704.07284},
eprinttype = {arXiv},
eprint = {1704.07284},
timestamp = {Fri, 12 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BasteST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlvesDFKSS17,
author = {Sancrey Rodrigues Alves and
Konrad Kazimierz Dabrowski and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton S. Souza},
title = {On the (parameterized) complexity of recognizing well-covered (r,
l)-graphs},
journal = {CoRR},
volume = {abs/1705.09177},
year = {2017},
url = {http://arxiv.org/abs/1705.09177},
eprinttype = {arXiv},
eprint = {1705.09177},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AlvesDFKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AraujoCMSS17,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Ana Karolinna Maia and
Ignasi Sau and
Ana Silva},
title = {On the complexity of finding internally vertex-disjoint long directed
paths},
journal = {CoRR},
volume = {abs/1706.09066},
year = {2017},
url = {http://arxiv.org/abs/1706.09066},
eprinttype = {arXiv},
eprint = {1706.09066},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AraujoCMSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-06282,
author = {Pierre Aboulker and
Samuel Fiorini and
Tony Huynh and
Gwena{\"{e}}l Joret and
Jean{-}Florent Raymond and
Ignasi Sau},
title = {A tight Erd{\H{o}}s-P{\'{o}}sa function for wheel minors},
journal = {CoRR},
volume = {abs/1710.06282},
year = {2017},
url = {http://arxiv.org/abs/1710.06282},
eprinttype = {arXiv},
eprint = {1710.06282},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-06282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RaymondST16,
author = {Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An edge variant of the Erd{\H{o}}s-P{\'{o}}sa property},
journal = {Discret. Math.},
volume = {339},
number = {8},
pages = {2027--2035},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2016.03.004},
doi = {10.1016/J.DISC.2016.03.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RaymondST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/0002LPRRSS16,
author = {Eun Jung Kim and
Alexander Langer and
Christophe Paul and
Felix Reidl and
Peter Rossmanith and
Ignasi Sau and
Somnath Sikdar},
title = {Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {21:1--21:41},
year = {2016},
url = {https://doi.org/10.1145/2797140},
doi = {10.1145/2797140},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/0002LPRRSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BastePSS16,
author = {Julien Baste and
Christophe Paul and
Ignasi Sau and
C{\'{e}}line Scornavacca},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Efficient {FPT} Algorithms for (Strict) Compatibility of Unrooted
Phylogenetic Trees},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {53--64},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_5},
doi = {10.1007/978-3-319-41168-2\_5},
timestamp = {Sun, 02 Oct 2022 15:53:30 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BastePSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/AlvesDFKSS16,
author = {Sancrey Rodrigues Alves and
Konrad Kazimierz Dabrowski and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
U{\'{e}}verton dos Santos Souza},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {On the (Parameterized) Complexity of Recognizing Well-Covered (r,
l)-graphs},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10043},
pages = {423--437},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_31},
doi = {10.1007/978-3-319-48749-6\_31},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/AlvesDFKSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GozupekOPSS16,
author = {Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom},
editor = {Pinar Heggernes},
title = {Parameterized Complexity of the {MINCCA} Problem on Graphs of Bounded
Decomposability},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {195--206},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_17},
doi = {10.1007/978-3-662-53536-3\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GozupekOPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BastePSS16,
author = {Julien Baste and
Christophe Paul and
Ignasi Sau and
C{\'{e}}line Scornavacca},
title = {Efficient {FPT} algorithms for (strict) compatibility of unrooted
phylogenetic trees},
journal = {CoRR},
volume = {abs/1604.03008},
year = {2016},
url = {http://arxiv.org/abs/1604.03008},
eprinttype = {arXiv},
eprint = {1604.03008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BastePSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteNS16,
author = {Julien Baste and
Marc Noy and
Ignasi Sau},
title = {The number of labeled graphs of bounded treewidth},
journal = {CoRR},
volume = {abs/1604.07273},
year = {2016},
url = {http://arxiv.org/abs/1604.07273},
eprinttype = {arXiv},
eprint = {1604.07273},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BasteNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GozupekOPSS16,
author = {Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom},
title = {Parameterized complexity of the {MINCCA} problem on graphs of bounded
decomposability},
journal = {CoRR},
volume = {abs/1605.00532},
year = {2016},
url = {http://arxiv.org/abs/1605.00532},
eprinttype = {arXiv},
eprint = {1605.00532},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GozupekOPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BougeretS16,
author = {Marin Bougeret and
Ignasi Sau},
title = {How much does a treedepth modulator help to obtain polynomial kernels
beyond sparse graphs?},
journal = {CoRR},
volume = {abs/1609.08095},
year = {2016},
url = {http://arxiv.org/abs/1609.08095},
eprinttype = {arXiv},
eprint = {1609.08095},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BougeretS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GarneroPST16,
author = {Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Explicit linear kernels for packing problems},
journal = {CoRR},
volume = {abs/1610.06131},
year = {2016},
url = {http://arxiv.org/abs/1610.06131},
eprinttype = {arXiv},
eprint = {1610.06131},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GarneroPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteRS16,
author = {Julien Baste and
Dieter Rautenbach and
Ignasi Sau},
title = {Uniquely restricted matchings and edge colorings},
journal = {CoRR},
volume = {abs/1611.06815},
year = {2016},
url = {http://arxiv.org/abs/1611.06815},
eprinttype = {arXiv},
eprint = {1611.06815},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BasteRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GarneroPST15,
author = {Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Explicit Linear Kernels via Dynamic Programming},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {4},
pages = {1864--1894},
year = {2015},
url = {https://doi.org/10.1137/140968975},
doi = {10.1137/140968975},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GarneroPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BasteS15,
author = {Julien Baste and
Ignasi Sau},
title = {The role of planarity in connectivity problems parameterized by treewidth},
journal = {Theor. Comput. Sci.},
volume = {570},
pages = {1--14},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.12.010},
doi = {10.1016/J.TCS.2014.12.010},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BasteS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Cohen0KPSTW15,
author = {Nathann Cohen and
Daniel Gon{\c{c}}alves and
Eunjung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos and
Mathias Weller},
editor = {Lev D. Beklemishev and
Daniil V. Musatov},
title = {A Polynomial-Time Algorithm for Outerplanar Diameter Improvement},
booktitle = {Computer Science - Theory and Applications - 10th International Computer
Science Symposium in Russia, {CSR} 2015, Listvyanka, Russia, July
13-17, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9139},
pages = {123--142},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20297-6\_9},
doi = {10.1007/978-3-319-20297-6\_9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/Cohen0KPSTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/0002PST15,
author = {Eun Jung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Parameterized Algorithms for Min-Max Multiway Cut and List Digraph
Homomorphism},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {78--89},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.78},
doi = {10.4230/LIPICS.IPEC.2015.78},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/0002PST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KimOPST15,
author = {Eunjung Kim and
Sang{-}il Oum and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Laura Sanit{\`{a}} and
Martin Skutella},
title = {An {FPT} 2-Approximation for Tree-cut Decomposition},
booktitle = {Approximation and Online Algorithms - 13th International Workshop,
{WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9499},
pages = {35--46},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28684-6\_4},
doi = {10.1007/978-3-319-28684-6\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KimOPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Chatzidimitriou15,
author = {Dimitris Chatzidimitriou and
Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Laura Sanit{\`{a}} and
Martin Skutella},
title = {An O({\textbackslash}log {\textbackslash}mathrmOPT) {O} {(} log {OPT}
{)} -Approximation for Covering/Packing Minor Models of {\texttheta}
{\_}r {\texttheta} r},
booktitle = {Approximation and Online Algorithms - 13th International Workshop,
{WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9499},
pages = {122--132},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28684-6\_11},
doi = {10.1007/978-3-319-28684-6\_11},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/Chatzidimitriou15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MontejanoS15,
author = {Luis Pedro Montejano and
Ignasi Sau},
editor = {Ernst W. Mayr},
title = {On the Complexity of Computing the k-restricted Edge-connectivity
of a Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {219--233},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_16},
doi = {10.1007/978-3-662-53174-7\_16},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MontejanoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MontejanoS15,
author = {Luis Pedro Montejano and
Ignasi Sau},
title = {On the complexity of computing the k-restricted edge-connectivity
of a graph},
journal = {CoRR},
volume = {abs/1502.07659},
year = {2015},
url = {http://arxiv.org/abs/1502.07659},
eprinttype = {arXiv},
eprint = {1502.07659},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MontejanoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteFKS15,
author = {Julien Baste and
Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau},
title = {Parameterized complexity dichotomy for (r, {\(\mathscr{l}\)})-Vertex
Deletion},
journal = {CoRR},
volume = {abs/1504.05515},
year = {2015},
url = {http://arxiv.org/abs/1504.05515},
eprinttype = {arXiv},
eprint = {1504.05515},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BasteFKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KimOPST15,
author = {Eunjung Kim and
Sang{-}il Oum and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An {FPT} 2-Approximation for Tree-Cut Decomposition},
journal = {CoRR},
volume = {abs/1509.04880},
year = {2015},
url = {http://arxiv.org/abs/1509.04880},
eprinttype = {arXiv},
eprint = {1509.04880},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/KimOPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KimPST15,
author = {Eunjung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Parameterized Algorithms for Min-Max Multiway Cut and List Digraph
Homomorphism},
journal = {CoRR},
volume = {abs/1509.07404},
year = {2015},
url = {http://arxiv.org/abs/1509.07404},
eprinttype = {arXiv},
eprint = {1509.07404},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/KimPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Chatzidimitriou15a,
author = {Dimitris Chatzidimitriou and
Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Minors in graphs of large {\textdollar}{\texttheta}\({}_{\mbox{r}}\)-girth},
journal = {CoRR},
volume = {abs/1510.03041},
year = {2015},
url = {http://arxiv.org/abs/1510.03041},
eprinttype = {arXiv},
eprint = {1510.03041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Chatzidimitriou15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Chatzidimitriou15,
author = {Dimitris Chatzidimitriou and
Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An O(log OPT)-approximation for covering and packing minor models
of {\textdollar}{\texttheta}\({}_{\mbox{r}}\)},
journal = {CoRR},
volume = {abs/1510.03945},
year = {2015},
url = {http://arxiv.org/abs/1510.03945},
eprinttype = {arXiv},
eprint = {1510.03945},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/Chatzidimitriou15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FariaKSS15,
author = {Lu{\'{e}}rbio Faria and
Sulamita Klein and
Ignasi Sau and
Rubens Sucupira},
title = {Improved kernels for Signed Max Cut parameterized above lower bound
on (r, l)-graphs},
journal = {CoRR},
volume = {abs/1512.05223},
year = {2015},
url = {http://arxiv.org/abs/1512.05223},
eprinttype = {arXiv},
eprint = {1512.05223},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/FariaKSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BousquetGMPST14,
author = {Nicolas Bousquet and
Daniel Gon{\c{c}}alves and
George B. Mertzios and
Christophe Paul and
Ignasi Sau and
St{\'{e}}phan Thomass{\'{e}}},
title = {Parameterized Domination in Circle Graphs},
journal = {Theory Comput. Syst.},
volume = {54},
number = {1},
pages = {45--72},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9478-8},
doi = {10.1007/S00224-013-9478-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BousquetGMPST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JoretPSST14,
author = {Gwena{\"{e}}l Joret and
Christophe Paul and
Ignasi Sau and
Saket Saurabh and
St{\'{e}}phan Thomass{\'{e}}},
title = {Hitting and Harvesting Pumpkins},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {3},
pages = {1363--1390},
year = {2014},
url = {https://doi.org/10.1137/120883736},
doi = {10.1137/120883736},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JoretPSST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RueST14,
author = {Juanjo Ru{\'{e}} and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Dynamic programming for graphs on surfaces},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {2},
pages = {8:1--8:26},
year = {2014},
url = {https://doi.org/10.1145/2556952},
doi = {10.1145/2556952},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/RueST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BasteS14,
author = {Julien Baste and
Ignasi Sau},
editor = {Marek Cygan and
Pinar Heggernes},
title = {The Role of Planarity in Connectivity Problems Parameterized by Treewidth},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {63--74},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_6},
doi = {10.1007/978-3-319-13524-3\_6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BasteS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CrayS14,
author = {Henri Perret du Cray and
Ignasi Sau},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Improved {FPT} Algorithms for Weighted Independent Set in Bull-Free
Graphs},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {282--293},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_24},
doi = {10.1007/978-3-319-13524-3\_24},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CrayS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GarneroPST14,
author = {Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Explicit Linear Kernels via Dynamic Programming},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {312--324},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.312},
doi = {10.4230/LIPICS.STACS.2014.312},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GarneroPST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen0KPSTW14,
author = {Nathann Cohen and
Daniel Gon{\c{c}}alves and
Eun Jung Kim and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos and
Mathias Weller},
title = {A Polynomial-time Algorithm for Outerplanar Diameter Improvement},
journal = {CoRR},
volume = {abs/1403.5702},
year = {2014},
url = {http://arxiv.org/abs/1403.5702},
eprinttype = {arXiv},
eprint = {1403.5702},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cohen0KPSTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CrayS14,
author = {Henri Perret du Cray and
Ignasi Sau},
title = {Improved {FPT} algorithms for weighted independent set in bull-free
graphs},
journal = {CoRR},
volume = {abs/1407.1706},
year = {2014},
url = {http://arxiv.org/abs/1407.1706},
eprinttype = {arXiv},
eprint = {1407.1706},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CrayS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GarneroST14,
author = {Valentin Garnero and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {A linear kernel for planar red-blue dominating set},
journal = {CoRR},
volume = {abs/1408.6388},
year = {2014},
url = {http://arxiv.org/abs/1408.6388},
eprinttype = {arXiv},
eprint = {1408.6388},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GarneroST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PelegSS13,
author = {David Peleg and
Ignasi Sau and
Mordechai Shalom},
title = {On approximating the \emph{d}-girth of a graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2587--2596},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.022},
doi = {10.1016/J.DAM.2013.04.022},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PelegSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RueST13,
author = {Juanjo Ru{\'{e}} and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Asymptotic enumeration of non-crossing partitions on surfaces},
journal = {Discret. Math.},
volume = {313},
number = {5},
pages = {635--649},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2012.12.011},
doi = {10.1016/J.DISC.2012.12.011},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RueST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0002LPRRSS13,
author = {Eun Jung Kim and
Alexander Langer and
Christophe Paul and
Felix Reidl and
Peter Rossmanith and
Ignasi Sau and
Somnath Sikdar},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {613--624},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_52},
doi = {10.1007/978-3-642-39206-1\_52},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0002LPRRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/GarneroST13,
author = {Valentin Garnero and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {A linear kernel for planar red-blue dominating set},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {117--120},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/GarneroST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RaymondST13,
author = {Jean{-}Florent Raymond and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An edge variant of the Erd{\H{o}}s-P{\'{o}}sa property},
journal = {CoRR},
volume = {abs/1311.1108},
year = {2013},
url = {http://arxiv.org/abs/1311.1108},
eprinttype = {arXiv},
eprint = {1311.1108},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/RaymondST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasteS13,
author = {Julien Baste and
Ignasi Sau},
title = {The role of planarity in connectivity problems parameterized by treewidth},
journal = {CoRR},
volume = {abs/1312.2889},
year = {2013},
url = {http://arxiv.org/abs/1312.2889},
eprinttype = {arXiv},
eprint = {1312.2889},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BasteS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GarneroPST13,
author = {Valentin Garnero and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Explicit linear kernels via dynamic programming},
journal = {CoRR},
volume = {abs/1312.6585},
year = {2013},
url = {http://arxiv.org/abs/1312.6585},
eprinttype = {arXiv},
eprint = {1312.6585},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GarneroPST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AdlerDFST12,
author = {Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Fast Minor Testing in Planar Graphs},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {69--84},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9563-9},
doi = {10.1007/S00453-011-9563-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AdlerDFST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AminiPPSS12,
author = {Omid Amini and
David Peleg and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau and
Saket Saurabh},
title = {On the approximability of some degree-constrained subgraph problems},
journal = {Discret. Appl. Math.},
volume = {160},
number = {12},
pages = {1661--1679},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.03.025},
doi = {10.1016/J.DAM.2012.03.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AminiPPSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SauSZ12,
author = {Ignasi Sau and
Petra Sparl and
Janez Zerovnik},
title = {Simpler multicoloring of triangle-free hexagonal graphs},
journal = {Discret. Math.},
volume = {312},
number = {1},
pages = {181--187},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.07.031},
doi = {10.1016/J.DISC.2011.07.031},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SauSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AminiSS12,
author = {Omid Amini and
Ignasi Sau and
Saket Saurabh},
title = {Parameterized complexity of finding small degree-constrained subgraphs},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {70--83},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.05.001},
doi = {10.1016/J.JDA.2011.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AminiSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermondCMPSD12,
author = {Jean{-}Claude Bermond and
David Coudert and
Joanna Moulierac and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau and
Fernando Solano Donado},
title = {{GMPLS} label space minimization through hypergraph layouts},
journal = {Theor. Comput. Sci.},
volume = {444},
pages = {3--16},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.01.033},
doi = {10.1016/J.TCS.2012.01.033},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BermondCMPSD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/MertziosSSZ12,
author = {George B. Mertzios and
Ignasi Sau and
Mordechai Shalom and
Shmuel Zaks},
title = {Placing regenerators in optical networks to satisfy multiple sets
of requests},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {20},
number = {6},
pages = {1870--1879},
year = {2012},
url = {https://doi.org/10.1109/TNET.2012.2186462},
doi = {10.1109/TNET.2012.2186462},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/MertziosSSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/RueST12,
author = {Juanjo Ru{\'{e}} and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Dynamic Programming for H-minor-free Graphs},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {86--97},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_8},
doi = {10.1007/978-3-642-32241-9\_8},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/RueST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BousquetGMPST12,
author = {Nicolas Bousquet and
Daniel Gon{\c{c}}alves and
George B. Mertzios and
Christophe Paul and
Ignasi Sau and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Parameterized Domination in Circle 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 = {308--319},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_31},
doi = {10.1007/978-3-642-34611-8\_31},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BousquetGMPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-3728,
author = {Nicolas Bousquet and
Daniel Gon{\c{c}}alves and
George B. Mertzios and
Christophe Paul and
Ignasi Sau and
St{\'{e}}phan Thomass{\'{e}}},
title = {Parameterized Domination in Circle Graphs},
journal = {CoRR},
volume = {abs/1205.3728},
year = {2012},
url = {http://arxiv.org/abs/1205.3728},
eprinttype = {arXiv},
eprint = {1205.3728},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-3728.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0835,
author = {Eun Jung Kim and
Alexander Langer and
Christophe Paul and
Felix Reidl and
Peter Rossmanith and
Ignasi Sau and
Somnath Sikdar},
title = {Linear kernels and single-exponential algorithms via protrusion decompositions},
journal = {CoRR},
volume = {abs/1207.0835},
year = {2012},
url = {http://arxiv.org/abs/1207.0835},
eprinttype = {arXiv},
eprint = {1207.0835},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-0978,
author = {Valentin Garnero and
Ignasi Sau},
title = {A linear kernel for planar total dominating set},
journal = {CoRR},
volume = {abs/1211.0978},
year = {2012},
url = {http://arxiv.org/abs/1211.0978},
eprinttype = {arXiv},
eprint = {1211.0978},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-0978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SauT11,
author = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {On self-duality of branchwidth in graphs of bounded genus},
journal = {Discret. Appl. Math.},
volume = {159},
number = {17},
pages = {2184--2186},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.06.028},
doi = {10.1016/J.DAM.2011.06.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SauT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BermondMS11,
author = {Jean{-}Claude Bermond and
Xavier Mu{\~{n}}oz and
Ignasi Sau},
title = {Traffic grooming in bidirectional {WDM} ring networks},
journal = {Networks},
volume = {58},
number = {1},
pages = {20--35},
year = {2011},
url = {https://doi.org/10.1002/net.20410},
doi = {10.1002/NET.20410},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermondMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MertziosSZ11,
author = {George B. Mertzios and
Ignasi Sau and
Shmuel Zaks},
title = {The Recognition of Tolerance and Bounded Tolerance Graphs},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {5},
pages = {1234--1257},
year = {2011},
url = {https://doi.org/10.1137/090780328},
doi = {10.1137/090780328},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MertziosSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MunozLS11,
author = {Xavier Mu{\~{n}}oz and
Zhentao Li and
Ignasi Sau},
title = {Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a
Priori Placement of the ADMs},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {4},
pages = {1490--1505},
year = {2011},
url = {https://doi.org/10.1137/090775440},
doi = {10.1137/090775440},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MunozLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AdlerDFST11,
author = {Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Faster parameterized algorithms for minor containment},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7018--7028},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.015},
doi = {10.1016/J.TCS.2011.09.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AdlerDFST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JoretPSST11,
author = {Gwena{\"{e}}l Joret and
Christophe Paul and
Ignasi Sau and
Saket Saurabh and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Hitting and Harvesting Pumpkins},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {394--407},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_34},
doi = {10.1007/978-3-642-23719-5\_34},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/JoretPSST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/PelegSS11,
author = {David Peleg and
Ignasi Sau and
Mordechai Shalom},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {On Approximating the \emph{d}-Girth of a Graph},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {467--481},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_39},
doi = {10.1007/978-3-642-18381-2\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/PelegSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2477,
author = {Juanjo Ru{\'{e}} and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Asymptotic Enumeration of Non-crossing Partitions on Surfaces},
journal = {CoRR},
volume = {abs/1104.2477},
year = {2011},
url = {http://arxiv.org/abs/1104.2477},
eprinttype = {arXiv},
eprint = {1104.2477},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2477.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2486,
author = {Juanjo Ru{\'{e}} and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Dynamic Programming for Graphs on Surfaces},
journal = {CoRR},
volume = {abs/1104.2486},
year = {2011},
url = {http://arxiv.org/abs/1104.2486},
eprinttype = {arXiv},
eprint = {1104.2486},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2486.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2704,
author = {Gwena{\"{e}}l Joret and
Christophe Paul and
Ignasi Sau and
Saket Saurabh and
St{\'{e}}phan Thomass{\'{e}}},
title = {Hitting and Harvesting Pumpkins},
journal = {CoRR},
volume = {abs/1105.2704},
year = {2011},
url = {http://arxiv.org/abs/1105.2704},
eprinttype = {arXiv},
eprint = {1105.2704},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2704.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SauT10,
author = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Subexponential parameterized algorithms for degree-constrained subgraph
problems on planar graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {330--338},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2010.02.002},
doi = {10.1016/J.JDA.2010.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SauT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/join/CoudertGS10,
author = {David Coudert and
Fr{\'{e}}d{\'{e}}ric Giroire and
Ignasi Sau},
title = {Circuits in Graphs through a prescribed Set of Ordered vertices},
journal = {J. Interconnect. Networks},
volume = {11},
number = {3-4},
pages = {121--141},
year = {2010},
url = {https://doi.org/10.1142/S0219265910002763},
doi = {10.1142/S0219265910002763},
timestamp = {Fri, 05 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/join/CoudertGS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BermondCGQS10,
author = {Jean{-}Claude Bermond and
Charles J. Colbourn and
Lucia Gionfriddo and
Gaetano Quattrocchi and
Ignasi Sau},
title = {Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {2},
pages = {400--419},
year = {2010},
url = {https://doi.org/10.1137/080744190},
doi = {10.1137/080744190},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BermondCGQS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AdlerDFST10,
author = {Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Fast Minor Testing in Planar 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 = {97--109},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_9},
doi = {10.1007/978-3-642-15775-2\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AdlerDFST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MertziosSSZ10,
author = {George B. Mertzios and
Ignasi Sau and
Mordechai Shalom and
Shmuel Zaks},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Placing Regenerators in Optical Networks to Satisfy Multiple Sets
of Requests},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6199},
pages = {333--344},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14162-1\_28},
doi = {10.1007/978-3-642-14162-1\_28},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MertziosSSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RueST10,
author = {Juanjo Ru{\'{e}} and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Dynamic Programming for Graphs on Surfaces},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {372--383},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_32},
doi = {10.1007/978-3-642-14165-2\_32},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/RueST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/SauSZ10,
author = {Ignasi Sau and
Mordechai Shalom and
Shmuel Zaks},
editor = {Boaz Patt{-}Shamir and
T{\'{\i}}naz Ekim},
title = {Traffic Grooming in Star Networks via Matching Techniques},
booktitle = {Structural Information and Communication Complexity, 17th International
Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6058},
pages = {41--56},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13284-1\_5},
doi = {10.1007/978-3-642-13284-1\_5},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/SauSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MertziosSZ10,
author = {George B. Mertzios and
Ignasi Sau and
Shmuel Zaks},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {The Recognition of Tolerance and Bounded Tolerance Graphs},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {585--596},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2487},
doi = {10.4230/LIPICS.STACS.2010.2487},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MertziosSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AdlerDFST10,
author = {Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Haim Kaplan},
title = {Faster Parameterized Algorithms for Minor Containment},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {322--333},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_31},
doi = {10.1007/978-3-642-13731-0\_31},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AdlerDFST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/10/CinklerCFMMMSSZ10,
author = {Tibor Cinkler and
David Coudert and
Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli and
Xavier Mu{\~{n}}oz and
Ignasi Sau and
Mordechai Shalom and
Shmuel Zaks},
editor = {Arie Koster and
Xavier Mu{\~{n}}oz},
title = {Traffic Grooming: Combinatorial Results and Practical Resolutions},
booktitle = {Graphs and Algorithms in Communication Networks: Studies in Broadband,
Optical, Wireless and Ad Hoc Networks},
series = {Texts in Theoretical Computer Science. An {EATCS} Series},
pages = {63--94},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-02250-0\_2},
doi = {10.1007/978-3-642-02250-0\_2},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/10/CinklerCFMMMSSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/10/SauZ10,
author = {Ignasi Sau and
Janez Zerovnik},
editor = {Arie Koster and
Xavier Mu{\~{n}}oz},
title = {Permutation Routing and (\emph{{\(\mathscr{l}\)}}, \emph{k})-Routing
on Plane Grids},
booktitle = {Graphs and Algorithms in Communication Networks: Studies in Broadband,
Optical, Wireless and Ad Hoc Networks},
series = {Texts in Theoretical Computer Science. An {EATCS} Series},
pages = {265--279},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-02250-0\_10},
doi = {10.1007/978-3-642-02250-0\_10},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/sp/10/SauZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-3251,
author = {George B. Mertzios and
Ignasi Sau and
Shmuel Zaks},
title = {The Recognition of Tolerance and Bounded Tolerance Graphs},
journal = {CoRR},
volume = {abs/1001.3251},
year = {2010},
url = {http://arxiv.org/abs/1001.3251},
eprinttype = {arXiv},
eprint = {1001.3251},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-3251.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SauT09,
author = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Subexponential Parameterized Algorithms for Bounded-Degree Connected
Subgraph Problems on Planar Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {59--66},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.009},
doi = {10.1016/J.ENDM.2009.02.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SauT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/join/HucSZ09,
author = {Florian Huc and
Ignasi Sau and
Janez Zerovnik},
title = {(\emph{l}, k)-ROUTING {ON} {PLANE} {GRIDS}},
journal = {J. Interconnect. Networks},
volume = {10},
number = {1-2},
pages = {27--57},
year = {2009},
url = {https://doi.org/10.1142/S0219265909002431},
doi = {10.1142/S0219265909002431},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/join/HucSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MertziosSZ09,
author = {George B. Mertzios and
Ignasi Sau and
Shmuel Zaks},
title = {A New Intersection Model and Improved Algorithms for Tolerance Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {4},
pages = {1800--1813},
year = {2009},
url = {https://doi.org/10.1137/09075994X},
doi = {10.1137/09075994X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MertziosSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AminiPS09,
author = {Omid Amini and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau},
title = {Hardness and approximation of traffic grooming},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3751--3760},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.028},
doi = {10.1016/J.TCS.2009.04.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AminiPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/SauT09,
author = {Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {On Self-Duality of Branchwidth in Graphs of Bounded Genus},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {19--22},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=31},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/SauT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/CoudertGS09,
author = {David Coudert and
Fr{\'{e}}d{\'{e}}ric Giroire and
Ignasi Sau},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Edge-Simple Circuits through 10 Ordered Vertices in Square Grids},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {134--145},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_16},
doi = {10.1007/978-3-642-10217-2\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/CoudertGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/BermondCMPRSD09,
author = {Jean{-}Claude Bermond and
David Coudert and
Joanna Moulierac and
St{\'{e}}phane P{\'{e}}rennes and
Herv{\'{e}} Rivano and
Ignasi Sau and
Fernando Solano Donado},
editor = {Luigi Fratta and
Henning Schulzrinne and
Yutaka Takahashi and
Otto Spaniol},
title = {{MPLS} Label Stacking on the Line Network},
booktitle = {{NETWORKING} 2009, 8th International {IFIP-TC} 6 Networking Conference,
Aachen, Germany, May 11-15, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5550},
pages = {809--820},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-01399-7\_63},
doi = {10.1007/978-3-642-01399-7\_63},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/networking/BermondCMPRSD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BermondCMPSD09,
author = {Jean{-}Claude Bermond and
David Coudert and
Joanna Moulierac and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau and
Fernando Solano Donado},
editor = {Shay Kutten and
Janez Zerovnik},
title = {Designing Hypergraph Layouts to {GMPLS} Routing Strategies},
booktitle = {Structural Information and Communication Complexity, 16th International
Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5869},
pages = {57--71},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11476-2\_6},
doi = {10.1007/978-3-642-11476-2\_6},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BermondCMPSD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LiS09,
author = {Zhentao Li and
Ignasi Sau},
editor = {Christophe Paul and
Michel Habib},
title = {Graph Partitioning and Traffic Grooming with Bounded Degree Request
Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {250--261},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_22},
doi = {10.1007/978-3-642-11409-0\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/LiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MertziosSZ09,
author = {George B. Mertzios and
Ignasi Sau and
Shmuel Zaks},
editor = {Christophe Paul and
Michel Habib},
title = {A New Intersection Model and Improved Algorithms for Tolerance Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {285--295},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_25},
doi = {10.1007/978-3-642-11409-0\_25},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MertziosSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/ZerovnikS08,
author = {Janez Zerovnik and
Ignasi Sau},
title = {An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal
Networks},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {10},
number = {3},
year = {2008},
url = {https://doi.org/10.46298/dmtcs.443},
doi = {10.46298/DMTCS.443},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/ZerovnikS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AminiSS08,
author = {Omid Amini and
Ignasi Sau and
Saket Saurabh},
editor = {Martin Grohe and
Rolf Niedermeier},
title = {Parameterized Complexity of the Smallest Degree-Constrained Subgraph
Problem},
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 = {13--29},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79723-4\_4},
doi = {10.1007/978-3-540-79723-4\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/AminiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AminiPPSS08,
author = {Omid Amini and
David Peleg and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau and
Saket Saurabh},
editor = {Evripidis Bampis and
Martin Skutella},
title = {Degree-Constrained Subgraph Problems: Hardness and Approximation Results},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {29--42},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_3},
doi = {10.1007/978-3-540-93980-1\_3},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AminiPPSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MunozS08,
author = {Xavier Mu{\~{n}}oz and
Ignasi Sau},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Traffic Grooming in Unidirectional {WDM} Rings with Bounded Degree
Request Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {300--311},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_27},
doi = {10.1007/978-3-540-92248-3\_27},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/MunozS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AminiPS07,
author = {Omid Amini and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau},
editor = {Takeshi Tokuyama},
title = {Hardness and Approximation of Traffic Grooming},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {561--573},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_49},
doi = {10.1007/978-3-540-77120-3\_49},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AminiPS07.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:41 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:
