Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Julien Baste
@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/cec/JuvignyBLDJ23,
author = {Corentin Juvigny and
Julien Baste and
Guillaume Lozenguez and
Arnaud Doniec and
Laetitia Jourdan},
title = {A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising
from Selective Deconstruction},
booktitle = {{IEEE} Congress on Evolutionary Computation, {CEC} 2023, Chicago,
IL, USA, July 1-5, 2023},
pages = {1--8},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/CEC53210.2023.10254125},
doi = {10.1109/CEC53210.2023.10254125},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cec/JuvignyBLDJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-12783,
author = {Julien Baste},
title = {The Leafed Induced Subtree in chordal and bounded treewidth graphs},
journal = {CoRR},
volume = {abs/2301.12783},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.12783},
doi = {10.48550/ARXIV.2301.12783},
eprinttype = {arXiv},
eprint = {2301.12783},
timestamp = {Wed, 01 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-12783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/BasteFJMOPR22,
author = {Julien Baste and
Michael R. Fellows and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Mateus de Oliveira Oliveira and
Geevarghese Philip and
Frances A. Rosamond},
title = {Diversity of solutions: An exploration through the lens of fixed-parameter
tractability theory},
journal = {Artif. Intell.},
volume = {303},
pages = {103644},
year = {2022},
url = {https://doi.org/10.1016/j.artint.2021.103644},
doi = {10.1016/J.ARTINT.2021.103644},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/BasteFJMOPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BasteT22,
author = {Julien Baste and
Dimitrios M. Thilikos},
title = {Contraction Bidimensionality of Geometric Intersection Graphs},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {510--531},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00912-w},
doi = {10.1007/S00453-021-00912-W},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BasteT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BasteFR22,
author = {Julien Baste and
Maximilian F{\"{u}}rst and
Dieter Rautenbach},
title = {Acyclic matchings in graphs of bounded maximum degree},
journal = {Discret. Math.},
volume = {345},
number = {7},
pages = {112885},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112885},
doi = {10.1016/J.DISC.2022.112885},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BasteFR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BasteER22,
author = {Julien Baste and
Stefan Ehard and
Dieter Rautenbach},
title = {Non-monotone target sets for threshold values restricted to {\textdollar}0{\textdollar},
{\textdollar}1{\textdollar}, and the vertex degree},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {24},
number = {1},
year = {2022},
url = {https://doi.org/10.46298/dmtcs.6844},
doi = {10.46298/DMTCS.6844},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BasteER22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dexa/CastillonBSH22,
author = {Antoine Castillon and
Julien Baste and
Hamida Seba and
Mohammed Haddad},
editor = {Christine Strauss and
Alfredo Cuzzocrea and
Gabriele Kotsis and
A Min Tjoa and
Ismail Khalil},
title = {Quasi-Clique Mining for Graph Summarization},
booktitle = {Database and Expert Systems Applications - 33rd International Conference,
{DEXA} 2022, Vienna, Austria, August 22-24, 2022, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {13427},
pages = {310--315},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-12426-6\_29},
doi = {10.1007/978-3-031-12426-6\_29},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dexa/CastillonBSH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ssci/JuvignyBLDJ22,
author = {Corentin Juvigny and
Julien Baste and
Guillaume Lozenguez and
Arnaud Doniec and
Laetitia Jourdan},
editor = {Hisao Ishibuchi and
Chee{-}Keong Kwoh and
Ah{-}Hwee Tan and
Dipti Srinivasan and
Chunyan Miao and
Anupam Trivedi and
Keeley A. Crockett},
title = {Towards hybridization of multi-agent simulation and metaheuristics
applied to selective deconstruction},
booktitle = {{IEEE} Symposium Series on Computational Intelligence, {SSCI} 2022,
Singapore, December 4-7, 2022},
pages = {767--773},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/SSCI51031.2022.10022117},
doi = {10.1109/SSCI51031.2022.10022117},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ssci/JuvignyBLDJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-09751,
author = {Julien Baste and
Dimitrios M. Thilikos},
title = {Contraction Bidimensionality of Geometric Intersection Graphs},
journal = {CoRR},
volume = {abs/2207.09751},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.09751},
doi = {10.48550/ARXIV.2207.09751},
eprinttype = {arXiv},
eprint = {2207.09751},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-09751.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BasteFHMR21,
author = {Julien Baste and
Maximilian F{\"{u}}rst and
Michael A. Henning and
Elena Mohr and
Dieter Rautenbach},
title = {Bounding and approximating minimum maximal matchings in regular graphs},
journal = {Discret. Math.},
volume = {344},
number = {3},
pages = {112243},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112243},
doi = {10.1016/J.DISC.2020.112243},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BasteFHMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BasteGST21,
author = {Julien Baste and
Didem G{\"{o}}z{\"{u}}pek and
Mordechai Shalom and
Dimitrios M. Thilikos},
title = {Minimum Reload Cost Graph Factors},
journal = {Theory Comput. Syst.},
volume = {65},
number = {5},
pages = {815--838},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-10012-x},
doi = {10.1007/S00224-020-10012-X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BasteGST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-11559,
author = {Abd Errahmane Kiouche and
Julien Baste and
Mohammed Haddad and
Hamida Seba},
title = {A Neighborhood-preserving Graph Summarization},
journal = {CoRR},
volume = {abs/2101.11559},
year = {2021},
url = {https://arxiv.org/abs/2101.11559},
eprinttype = {arXiv},
eprint = {2101.11559},
timestamp = {Sun, 31 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-11559.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/dam/BasteFHMR20,
author = {Julien Baste and
Maximilian F{\"{u}}rst and
Michael A. Henning and
Elena Mohr and
Dieter Rautenbach},
title = {Domination versus edge domination},
journal = {Discret. Appl. Math.},
volume = {285},
pages = {343--349},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.05.030},
doi = {10.1016/J.DAM.2020.05.030},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BasteFHMR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BasteFR20,
author = {Julien Baste and
Maximilian F{\"{u}}rst and
Dieter Rautenbach},
title = {Linear programming based approximation for unweighted induced matchings
- Breaking the {\(\Delta\)} barrier},
journal = {Discret. Optim.},
volume = {38},
pages = {100593},
year = {2020},
url = {https://doi.org/10.1016/j.disopt.2020.100593},
doi = {10.1016/J.DISOPT.2020.100593},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BasteFR20.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/BasteBR20,
author = {Julien Baste and
Binh{-}Minh Bui{-}Xuan and
Antoine Roux},
title = {Temporal matching},
journal = {Theor. Comput. Sci.},
volume = {806},
pages = {184--196},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.03.026},
doi = {10.1016/J.TCS.2019.03.026},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BasteBR20.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/cocoon/BasteFR20,
author = {Julien Baste and
Maximilian F{\"{u}}rst and
Dieter Rautenbach},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {Approximating Maximum Acyclic Matchings by Greedy and Local Search
Strategies},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {542--553},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_44},
doi = {10.1007/978-3-030-58150-3\_44},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BasteFR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BasteFJMOPR20,
author = {Julien Baste and
Michael R. Fellows and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Mateus de Oliveira Oliveira and
Geevarghese Philip and
Frances A. Rosamond},
editor = {Christian Bessiere},
title = {Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter
Tractability Theory},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {1119--1125},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/156},
doi = {10.24963/IJCAI.2020/156},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/BasteFJMOPR20.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}
}
@article{DBLP:journals/corr/abs-2007-03959,
author = {Julien Baste and
Stefan Ehard and
Dieter Rautenbach},
title = {Non-monotone target sets for threshold values restricted to 0, 1,
and the vertex degree},
journal = {CoRR},
volume = {abs/2007.03959},
year = {2020},
url = {https://arxiv.org/abs/2007.03959},
eprinttype = {arXiv},
eprint = {2007.03959},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-03959.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BasteJMPR19,
author = {Julien Baste and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Geevarghese Philip and
G{\"{u}}nter Rote},
title = {{FPT} Algorithms for Diverse Collections of Hitting Sets},
journal = {Algorithms},
volume = {12},
number = {12},
pages = {254},
year = {2019},
url = {https://doi.org/10.3390/a12120254},
doi = {10.3390/A12120254},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BasteJMPR19.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/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}
}
@inproceedings{DBLP:conf/sofsem/BasteGST19,
author = {Julien Baste and
Didem G{\"{o}}z{\"{u}}pek and
Mordechai Shalom and
Dimitrios M. Thilikos},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {Minimum Reload Cost Graph Factors},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {67--80},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_7},
doi = {10.1007/978-3-030-10801-4\_7},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BasteGST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-07410,
author = {Julien Baste and
Michael R. Fellows and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Mateus de Oliveira Oliveira and
Geevarghese Philip and
Frances A. Rosamond},
title = {Diversity in Combinatorial Optimization},
journal = {CoRR},
volume = {abs/1903.07410},
year = {2019},
url = {http://arxiv.org/abs/1903.07410},
eprinttype = {arXiv},
eprint = {1903.07410},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-07410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-12500,
author = {Julien Baste},
title = {Composing dynamic programming tree-decomposition-based algorithms},
journal = {CoRR},
volume = {abs/1904.12500},
year = {2019},
url = {http://arxiv.org/abs/1904.12500},
eprinttype = {arXiv},
eprint = {1904.12500},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-12500.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-1911-05032,
author = {Julien Baste and
Lars Jaffke and
Tom{\'{a}}s Masar{\'{\i}}k and
Geevarghese Philip and
G{\"{u}}nter Rote},
title = {{FPT} Algorithms for Diverse Collections of Hitting Sets},
journal = {CoRR},
volume = {abs/1911.05032},
year = {2019},
url = {http://arxiv.org/abs/1911.05032},
eprinttype = {arXiv},
eprint = {1911.05032},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-05032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BasteR18,
author = {Julien Baste and
Dieter Rautenbach},
title = {Degenerate matchings and edge colorings},
journal = {Discret. Appl. Math.},
volume = {239},
pages = {38--44},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.01.002},
doi = {10.1016/J.DAM.2018.01.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BasteR18.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/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}
}
@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}
}
@article{DBLP:journals/corr/abs-1810-11700,
author = {Julien Baste and
Didem G{\"{o}}z{\"{u}}pek and
Mordechai Shalom and
Dimitrios M. Thilikos},
title = {Minimum Reload Cost Graph Factors},
journal = {CoRR},
volume = {abs/1810.11700},
year = {2018},
url = {http://arxiv.org/abs/1810.11700},
eprinttype = {arXiv},
eprint = {1810.11700},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-11700.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-08615,
author = {Julien Baste and
Binh{-}Minh Bui{-}Xuan and
Antoine Roux},
title = {Temporal Matching},
journal = {CoRR},
volume = {abs/1812.08615},
year = {2018},
url = {http://arxiv.org/abs/1812.08615},
eprinttype = {arXiv},
eprint = {1812.08615},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-08615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Baste17,
author = {Julien Baste},
title = {Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth:
aspects algorithmiques, combinatoires et pratiques)},
school = {University of Montpellier, France},
year = {2017},
url = {https://tel.archives-ouvertes.fr/tel-02078814},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Baste17.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/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}
}
@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/BasteT17,
author = {Julien Baste and
Dimitrios M. Thilikos},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Contraction-Bidimensionality of Geometric Intersection Graphs},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.5},
doi = {10.4230/LIPICS.IPEC.2017.5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BasteT17.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/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}
}
@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}
}
@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/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/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}
}
@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}
}
@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}
}
@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}
}
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:44 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:
