Clément Dallard

J. Comb. Theory B, January, 2024

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Finding k-community structures in special graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.

[BibT_eX]

[DOI]

Sebastian Wiederrecht

CoRR, 2024

Detecting K2, 3 as an induced minor.

[BibT_eX]

[DOI]

CoRR, 2024

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction.

[BibT_eX]

[DOI]

CoRR, 2024

Detecting K2,3 as an Induced Minor.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Computing Tree Decompositions with Small Independence Number.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Allocation of indivisible items with individual preference graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., July, 2023

Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems.

[BibT_eX]

[DOI]

Niklas Paulsen

Theor. Comput. Sci., June, 2023

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph.

[BibT_eX]

[DOI]

CoRR, 2023

Functionality of box intersection graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Conditions for minimally tough graphs.

[BibT_eX]

[DOI]

CoRR, 2022

On Constrained Intersection Representations of Graphs and Digraphs.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Colourful components in k-caterpillars and planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Tree decompositions with bounded independence number and their algorithmic applications.

[BibT_eX]

[DOI]

CoRR, 2021

Graphs with at most two moplexes.

[BibT_eX]

[DOI]

CoRR, 2021

On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.

[BibT_eX]

[DOI]

Algorithmica, 2021

Graphs with Two Moplexes.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Vertex Cover at Distance on H-Free Graphs.

[BibT_eX]

[DOI]

Mirza Krbezlija

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

Graphs without a partition into two proportionally dense subgraphs.

[BibT_eX]

[DOI]

Cristina Bazgan

Inf. Process. Lett., 2020

Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure.

[BibT_eX]

[DOI]

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

2019

Proportionally dense subgraph of maximum size: Complexity and approximation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Complexity of Scheduling for DARP with Soft Ride Times.

[BibT_eX]

[DOI]