Julien Baste

SIAM J. Comput., August, 2023

The Leafed Induced Subtree in chordal and bounded treewidth graphs.

[BibT_eX]

[DOI]

CoRR, 2023

A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2023

2022

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.

[BibT_eX]

[DOI]

Stefan Ehard

Discret. Math. Theor. Comput. Sci., 2022

Acyclic matchings in graphs of bounded maximum degree.

[BibT_eX]

[DOI]

Maximilian Fürst

Discret. Math., 2022

Contraction Bidimensionality of Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Mateus de Oliveira Oliveira

Algorithmica, 2022

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.

[BibT_eX]

[DOI]

Geevarghese Philip

Frances A. Rosamond

Artif. Intell., 2022

Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2022

Quasi-Clique Mining for Graph Summarization.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2022

2021

Minimum Reload Cost Graph Factors.

[BibT_eX]

[DOI]

Didem Gözüpek

Mordechai Shalom

Theory Comput. Syst., 2021

Bounding and approximating minimum maximal matchings in regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

A Neighborhood-preserving Graph Summarization.

[BibT_eX]

[DOI]

Abd Errahmane Kiouche

Mohammed Haddad

Hamida Seba

CoRR, 2021

2020

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Temporal matching.

[BibT_eX]

[DOI]

Binh-Minh Bui-Xuan

Antoine Roux

Theor. Comput. Sci., 2020

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Parameterized complexity of finding a spanning tree with minimum reload cost diameter.

[BibT_eX]

[DOI]

Networks, 2020

Hitting minors on bounded treewidth graphs. III. Lower bounds.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.

[BibT_eX]

[DOI]

Maximilian Fürst

Discret. Optim., 2020

Domination versus edge domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.

[BibT_eX]

[DOI]

Maximilian Fürst

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Upper bounds on the uniquely restricted chromatic index.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Approximating maximum uniquely restricted matchings in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Composing dynamic programming tree-decomposition-based algorithms.

[BibT_eX]

[DOI]

Mateus de Oliveira Oliveira

CoRR, 2019

Diversity in Combinatorial Optimization.

[BibT_eX]

[DOI]

Geevarghese Philip

Frances A. Rosamond

CoRR, 2019

FPT Algorithms for Diverse Collections of Hitting Sets.

[BibT_eX]

[DOI]

Algorithms, 2019

2018

On the number of labeled graphs of bounded treewidth.

[BibT_eX]

[DOI]

Marc Noy

Eur. J. Comb., 2018

Degenerate matchings and edge colorings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

2017

Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques).

[BibT_eX]

[DOI]

PhD thesis, 2017

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

On the parameterized complexity of the Edge Monitoring problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Ruling out FPT algorithms for Weighted Coloring on forests.

[BibT_eX]

[DOI]

Júlio Araújo

Electron. Notes Discret. Math., 2017

Uniquely Restricted Matchings and Edge Colorings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

The role of planarity in connectivity problems parameterized by treewidth.

[BibT_eX]

[DOI]