Bernard Ries

Theor. Comput. Sci., 2024

On blockers and transversals of maximum independent sets in co-comparability graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Finding k-community structures in special graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

Finding Matching Cuts in H-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

Using edge contractions to reduce the semitotal domination number.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Maximizing Matching Cuts.

[BibT_eX]

[DOI]

CoRR, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

On the complexity of matching cut for graphs of bounded radius and H-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On some special classes of contact B0-VPG graphs.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Mariano Leonardo Rean

Discret. Appl. Math., 2022

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.

[BibT_eX]

[DOI]

CoRR, 2022

On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Locally Checkable Problems Parameterized by Clique-Width.

[BibT_eX]

[DOI]

Narmina Baghirova

Carolina Lucía Gonzalez

David Schindl

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

2021

Blocking total dominating sets via edge contractions.

[BibT_eX]

[DOI]

Felix Mann

Theor. Comput. Sci., 2021

Reducing the domination number of graphs via edge contractions and vertex deletions.

[BibT_eX]

[DOI]

Paloma T. Lima

Discret. Math., 2021

Reducing the domination number of (P3+kP2)-free graphs via one edge contraction.

[BibT_eX]

[DOI]

Felix Mann

Discret. Appl. Math., 2021

New progress in combinatorial optimization.

[BibT_eX]

[DOI]

Bo Chen

Silvano Martello

Discret. Appl. Math., 2021

CPG graphs: Some structural and hardness results.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.

[BibT_eX]

[DOI]

Andrea Munaro

Theor. Comput. Sci., 2020

Reducing the domination number of P3+kP2-free graphs via one edge contraction.

[BibT_eX]

[DOI]

Felix Mann

CoRR, 2020

On Some Subclasses of Split B1-EPG Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Classifying k-edge colouring for H-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Detecting strong cliques.

[BibT_eX]

[DOI]

Ademir Hujdurovic

Martin Milanic

Discret. Math., 2019

Critical vertices and edges in H-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Maximum eccentric connectivity index for graphs with given diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Proper circular arc graphs as intersection graphs of pathson a grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016.

[BibT_eX]

[DOI]

Yves Crama

Bernard Gendron

Discret. Appl. Math., 2019

CPG graphs: Some structural and hardness results.

[BibT_eX]

[DOI]

Andrea Munaro

CoRR, 2019

On the Parameterized Complexity of k-Edge Colouring.

[BibT_eX]

[DOI]

CoRR, 2019

Reducing the Domination Number of Graphs via Edge Contractions.

[BibT_eX]

[DOI]

Paloma T. Lima

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Blocking Dominating Sets for H-Free Graphs via Edge Contractions.

[BibT_eX]

[DOI]

Paloma T. Lima

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Contraction and deletion blockers for perfect graphs and H-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Dominating induced matchings in graphs containing no long claw.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Graphs vertex-partitionable into strong cliques.

[BibT_eX]

[DOI]

Ademir Hujdurovic

Martin Milanic

Discret. Math., 2018

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Planar CPG graphs.

[BibT_eX]

[DOI]

Nicolas Champseix

CoRR, 2018

Classifying k-Edge Colouring for H-free Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Proper circular arc graphs as intersection graphs of paths on a grid.

[BibT_eX]

[DOI]

CoRR, 2018

On some special classes of contact B0-VPG graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Mariano Leonardo Rean

CoRR, 2018

On contact graphs of paths on a grid.

[BibT_eX]

[DOI]

Zakir Deniz

CoRR, 2018

Upper Domination: Towards a Dichotomy Through Boundary Properties.

[BibT_eX]

[DOI]

Algorithmica, 2018

On Split B_1 B 1 -EPG Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Characterising Chordal Contact B_0 -VPG Graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

Mariano Leonardo Rean

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

On Contact Graphs of Paths on a Grid.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

On star and biclique edge-colorings.

[BibT_eX]

[DOI]

Simone Dantas

Marina Groshaus

André Luiz Pires Guedes

Raphael C. S. Machado

Diana Sasaki

Int. Trans. Oper. Res., 2017

Reducing the Chromatic Number by Vertex or Edge Deletions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.

[BibT_eX]

[DOI]

Guilherme Dias da Fonseca

Proceedings of the Theory and Applications of Models of Computation, 2017

2016

On the ratio between maximum weight perfect matchings and maximum weight matchings in grids.

[BibT_eX]

[DOI]

Diana Sasaki

Discret. Appl. Math., 2016

On the minimum and maximum selective graph coloring problems in some graph classes.

[BibT_eX]

[DOI]

Marc Demange

Tínaz Ekim

Discret. Appl. Math., 2016

A Boundary Property for Upper Domination.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Vote par approbation pour les élections à vainqueurs multiples. Une famille générale de règles, leur complexité algorithmique et leur manipulabilité.

[BibT_eX]

[DOI]

Nathanaël Barrot

Jérôme Lang

Rev. d'Intelligence Artif., 2015

On the maximum independent set problem in subclasses of subcubic graphs.

[BibT_eX]

[DOI]

Vadim V. Lozin

Jérôme Monnot

J. Discrete Algorithms, 2015

Blockers for the Stability Number and the Chromatic Number.

[BibT_eX]

[DOI]

Graphs Comb., 2015

On some applications of the selective graph coloring problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Advances in Combinatorial Optimization.

[BibT_eX]

[DOI]

Silvano Martello

Discret. Appl. Math., 2015

Coloring graphs characterized by a forbidden subgraph.

[BibT_eX]

[DOI]

Petr A. Golovach

Discret. Appl. Math., 2015

Finding a Perfect Phylogeny from Mixed Tumor Samples.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.

[BibT_eX]

Proceedings of the ICORES 2015, 2015

On the Minimum and Maximum Selective Graph Coloring Problems.

[BibT_eX]

Marc Demange

Tínaz Ekim

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Contraction Blockers for Graphs with Forbidden Induced Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

On the complexity of the selective graph coloring problem in some special classes of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Characterizations of cographs as intersection graphs of paths on a grid.

[BibT_eX]

[DOI]

Elad Cohen

Martin Charles Golumbic

Discret. Appl. Math., 2014

A Dichotomy for Upper Domination in Monogenic Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Optimal edge-coloring with edge rate constraints.

[BibT_eX]

[DOI]

Networks, 2013

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Martin Charles Golumbic

Graphs Comb., 2013

Packing and covering with linear programming: A survey.

[BibT_eX]

[DOI]

Denis Cornaz

Eur. J. Oper. Res., 2013

Perfectness of clustered graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2013

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

The firefighter problem with more than one firefighter on trees.

[BibT_eX]

[DOI]

Cristina Bazgan

Morgan Chopin

Discret. Appl. Math., 2013

Possible Winners in Approval Voting.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

A note on chromatic properties of threshold graphs.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2012

Colouring vertices of triangle-free graphs without forests.

[BibT_eX]

[DOI]

Discret. Math., 2012

Some properties of edge intersection graphs of single-bend paths on a grid.

[BibT_eX]

[DOI]

Andrei Asinowski

Discret. Math., 2012

Selective Graph Coloring in Some Special Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

A 2-approximation for the maximum satisfying bisection problem.

[BibT_eX]

[DOI]

Rico Zenklusen

Eur. J. Oper. Res., 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.

[BibT_eX]

[DOI]

Maria Chudnovsky

Yori Zwols

Discret. Appl. Math., 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.

[BibT_eX]

[DOI]

Maria Chudnovsky

Yori Zwols

Discret. Appl. Math., 2011

2010

Split-critical and uniquely split-colorable graphs.

[BibT_eX]

[DOI]

Tínaz Ekim

Discret. Math. Theor. Comput. Sci., 2010

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2010

Complexity of two coloring problems in cubic planar bipartite mixed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints.

[BibT_eX]

[DOI]

François-Xavier Meuwly

Nicolas Zufferey

Algorithmic Oper. Res., 2010

Colouring Vertices of Triangle-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

Degree-constrained edge partitioning in graphs arising from discrete tomography.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Some properties of edge intersection graphs of single bend paths on a grid.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Blockers and transversals.

[BibT_eX]

[DOI]

Discret. Math., 2009

Mixed graph edge coloring.

[BibT_eX]

[DOI]

Discret. Math., 2009

Graph coloring with cardinality constraints on the neighborhoods.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

On a graph coloring problem arising from discrete tomography.

[BibT_eX]

[DOI]

Networks, 2008

Addendum to "Bicolored Matchings in Some Classes of Graphs".

[BibT_eX]

[DOI]

Graphs Comb., 2008

On two coloring problems in mixed graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

On the use of graphs in discrete tomography.

[BibT_eX]

[DOI]

4OR, 2008

2007

Coloring some classes of mixed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2005

Bicolored matchings in some classes of graphs.

[BibT_eX]

[DOI]