Michel Habib

Order, April, 2024

\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., February, 2024

Quasilinear-time eccentricities computation, and more, on median graphs.

[BibT_eX]

[DOI]

CoRR, 2024

A novel edge connectivity based on edge partition for hypercube and folded hypercube.

[BibT_eX]

[DOI]

Meirun Chen

Cheng-Kuan Lin

Appl. Math. Comput., 2024

2023

A new graph parameter to measure linearity.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Diagnosability for a family of matching composition networks.

[BibT_eX]

[DOI]

Meirun Chen

Cheng-Kuan Lin

J. Supercomput., May, 2023

Pattern detection in ordered graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

2022

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs.

[BibT_eX]

[DOI]

Mengchuan Zou

Theor. Comput. Sci., 2022

Connectivity for some families of composition networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Guiding Random Walks by Effective Resistance for Effective Node Embedding.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition and Artificial Intelligence, 2022

2021

Graph Classes and Forbidden Patterns on Three Vertices.

[BibT_eX]

[DOI]

Laurent Feuilloley

SIAM J. Discret. Math., 2021

Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Fast Diameter Computation within Split Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

Classifying grounded intersection graphs via ordered forbidden patterns.

[BibT_eX]

[DOI]

Laurent Feuilloley

CoRR, 2021

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs.

[BibT_eX]

[DOI]

CoRR, 2021

(α, β)-Modules in Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Diameter in linear time for constant-dimension median graphs.

[BibT_eX]

[DOI]

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

2020

Maximum Induced Matching Algorithms via Vertex Ordering Characterizations.

[BibT_eX]

[DOI]

Algorithmica, 2020

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.

[BibT_eX]

[DOI]

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

Approximating Modular Decomposition Is Hard.

[BibT_eX]

[DOI]

Mengchuan Zou

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

When an optimal dominating set with given constraints exists.

[BibT_eX]

[DOI]

Omid Etesami

Narges Ghareghani

Mohammad Reza Hooshmandasl

Reza Naserasr

Pouyeh Sharifani

Theor. Comput. Sci., 2019

Fast approximation of eccentricities and distances in hyperbolic graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.

[BibT_eX]

[DOI]

CoRR, 2019

A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications.

[BibT_eX]

[DOI]

Mengchuan Zou

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

2018

Representation of lattices via set-colored posets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates.

[BibT_eX]

[DOI]

Feodor F. Dragan

CoRR, 2018

Fast Approximation of Centrality and Distances in Hyperbolic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

A new LBFS-based algorithm for cocomparability graph recognition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Towards A Unified View of Linear Structure on Graph Classes.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Unified View of Graph Searching and LDFS-Based Certifying Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

On the Power of Graph Searching for Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Preface.

[BibT_eX]

[DOI]

Mourad Baïou

RAIRO Oper. Res., 2016

A tie-break model for graph search.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Algorithmic aspects of switch cographs.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Discret. Appl. Math., 2016

Read networks and k-laminar graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Maximal cliques structure for cocomparability graphs and applications.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.

[BibT_eX]

[DOI]

Michele Borassi

Pierluigi Crescenzi

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

A tie-break model for graph search.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Influence of the tie-break rule on the end-vertex problem.

[BibT_eX]

[DOI]

Pierre Charbit

Discret. Math. Theor. Comput. Sci., 2014

Into the Square - On the Complexity of Quadratic-Time Solvable Problems.

[BibT_eX]

[DOI]

Michele Borassi

Pierluigi Crescenzi

CoRR, 2014

Computing H-Joins with Application to 2-Modular Decomposition.

[BibT_eX]

[DOI]

Algorithmica, 2014

Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs.

[BibT_eX]

[DOI]

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

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Unique perfect phylogeny is intractable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On computing the diameter of real-world undirected graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs.

[BibT_eX]

[DOI]

Barnaby Dalton

SIAM J. Comput., 2013

The Arboreal Jump Number of an Order.

[BibT_eX]

[DOI]

Adriana P. Figueiredo

Sulamita Klein

Jayme Luiz Szwarcfiter

Order, 2013

A general method for common intervals.

[BibT_eX]

[DOI]

Ismael Belghiti

CoRR, 2013

2012

Detecting 2-joins faster.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Constructing a Minimum phylogenetic Network from a Dense triplet Set.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2012

Reduced clique graphs of chordal graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Tree-representation of set families and applications to combinatorial decompositions.

[BibT_eX]

[DOI]

Michaël Rao

Eur. J. Comb., 2012

Polynomial-time recognition of clique-width ≤3 graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Algorithms for Some H-Join Decompositions.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Complexity issues for the sandwich homogeneous set problem.

[BibT_eX]

[DOI]

Arnaud Durand

Discret. Appl. Math., 2011

On a conjecture of compatibility of multi-states characters

[BibT_eX]

[DOI]

CoRR, 2011

On a Conjecture about Compatibility of Multi-states Characters.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

Unique Perfect Phylogeny Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

A survey of the algorithmic aspects of modular decomposition.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2010

Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time

[BibT_eX]

[DOI]

CoRR, 2010

Unique perfect phylogeny is NP-hard

[BibT_eX]

[DOI]

CoRR, 2010

2009

A Decomposition Theorem for Chordal Graphs and its Applications.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On some simplicial elimination schemes for chordal graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Unifying the representation of symmetric crossing families and weakly partitive families.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Algorithmic aspects of a general modular decomposition theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Polynomial-Time Algorithm for the Leafage of Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Diameter and Center Computations in Networks.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Competitive graph searches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A Simple Linear Time LexBFS Cograph Recognition Algorithm.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Fast computation of empirically tight bounds for the diameter of massive graphs.

[BibT_eX]

[DOI]

Clémence Magnien

Matthieu Latapy

ACM J. Exp. Algorithmics, 2008

A note on computing set overlap classes.

[BibT_eX]

[DOI]

Pierre Charbit

Mathieu Raffinot

Michaël Rao

Inf. Process. Lett., 2008

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

A Representation Theorem for Union-Difference Families and Application.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

On transitive orientations with restricted covering graphs.

[BibT_eX]

[DOI]

Maria Patricia Dobson

Marisa Gutierrez

Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2007

Can transitive orientation make sandwich problems easier?

[BibT_eX]

[DOI]

Discret. Math., 2007

Simple, linear-time modular decomposition

[BibT_eX]

[DOI]

CoRR, 2007

Unifying Two Graph Decompositions with Modular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Foreword.

[BibT_eX]

[DOI]

Volker Diekert

Theory Comput. Syst., 2006

On Modular Decomposition Concepts: the case for Homogeneous Relations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Algorithmic Aspects of a Novel Modular Decomposition Theory

[BibT_eX]

[DOI]

CoRR, 2006

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.

[BibT_eX]

[DOI]

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

2005

The number of Moore families on n=6.

[BibT_eX]

[DOI]

Discret. Math., 2005

A simple linear time algorithm for cograph recognition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Revisiting T. Uno and M. Yagiura's Algorithm .

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Computational aspects of the 2-dimension of partially ordered sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Bimodular Decomposition of Bipartite Graphs.

[BibT_eX]

[DOI]

Jean-Luc Fouquet

Jean-Marie Vanherpe

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

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Maximal Common Connected Sets of Interval Graphs.

[BibT_eX]

[DOI]

Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

A note on finding all homogeneous set sandwiches.

[BibT_eX]

[DOI]

Emmanuelle Lebhar

Inf. Process. Lett., 2003

2002

Graph Decompositions andFactorizing Permutations.

[BibT_eX]

[DOI]

Christian Capelle

Discret. Math. Theor. Comput. Sci., 2002

The perception of stop consonant sequences in dyslexic and normal children.

[BibT_eX]

[DOI]

Noël Nguyen

Ludovic Jankowski

Proceedings of the 7th International Conference on Spoken Language Processing, ICSLP2002, 2002

2001

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs.

[BibT_eX]

[DOI]

Guillaume Damiand

Theor. Comput. Sci., 2001

Linear time recognition of P4-indifference graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2001

Efficient algorithms on distributive lattices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Diameter determination on restricted graph families.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

Encoding of Multiple Inheritance Hierarchies and Partial Orders.

[BibT_eX]

[DOI]

Comput. Intell., 1999

1998

Diameter Determination on Restricted Graph Faminlies.

[BibT_eX]

[DOI]

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

A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

Representation of stereochemistry using combinatorial maps.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematical Chemistry, 1998

1997

Preface: Orders, Algorithms and Applications.

[BibT_eX]

[DOI]

Vincent Bouchitté

Michel Morvan

Theor. Comput. Sci., 1997

Gray Codes for the Ideals of Interval Orders.

[BibT_eX]

[DOI]

George Steiner

J. Algorithms, 1997

Graph decompositions and factorizing permutations.

[BibT_eX]

[DOI]

Christian Capelle

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

1996

Tree Structure for Distributive Lattices and its Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

A Linear Algorithm To Decompose Inheritance Graphs Into Modules.

[BibT_eX]

[DOI]

Marianne Huchard

Jeremy P. Spinrad

Algorithmica, 1995

Chordal Graphs and Their Clique Graphs.

[BibT_eX]

[DOI]

Philippe Galinier

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

1994

On the Interplay Between Interval Dimension and Dimension.

[BibT_eX]

[DOI]

Stefan Felsner

Rolf H. Möhring

SIAM J. Discret. Math., 1994

Bit-Vector Encoding for Partially Ordered Sets.

[BibT_eX]

[DOI]

Proceedings of the Orders, 1994

Proposal for a Monotonic Multiple Inheritance Linearization.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Conference on Object-Oriented Programming Systems, 1994

A New Linear Algorithm for Modular Decomposition.

[BibT_eX]

[DOI]

Alain Cournier

Proceedings of the Trees in Algebra and Programming, 1994

1993

On the calculation of transitive reduction - closure of orders.

[BibT_eX]

[DOI]

Michel Morvan

Jean-Xavier Rampon

Discret. Math., 1993

1992

An Efficient Algorithm to Recognize Prime Undirected Graphs.

[BibT_eX]

[DOI]

Alain Cournier

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

Monotonic Conflict Resolution Mechanisms for Inheritance.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Conference on Object-Oriented Programming Systems, 1992

1991

Interval dimension is a comparability invariant.

[BibT_eX]

[DOI]

David Kelly

Rolf H. Möhring

Discret. Math., 1991

1990

Remarks on Some Concurrency Measures.

[BibT_eX]

[DOI]

Michel Morvan

Jean-Xavier Rampon

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

1987

On some complexity properties of N-free posets and posets with bounded decomposition diameter.

[BibT_eX]

[DOI]

Rolf H. Möhring

Discret. Math., 1987

On Some Algorithms for Multiple Inheritance in Object-Oriented Programming.

[BibT_eX]

[DOI]

Roland Ducournau

Proceedings of the ECOOP'87 European Conference on Object-Oriented Programming, 1987

1986

CABRI, An Interactive System for Graph Manipulation.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985

1-Intersecting families.

[BibT_eX]

[DOI]

M. C. Maurer

Discret. Math., 1985

N-free posets as generalizations of series-parallel posets.

[BibT_eX]

[DOI]

Roland Jégou

Discret. Appl. Math., 1985

1984

On linear k-arboricity.

[BibT_eX]

[DOI]

Discret. Math., 1984

Jump number of dags having Dilworth number 2.

[BibT_eX]

[DOI]

Michel Chein

Discret. Appl. Math., 1984

1982

Some problems about linear arboricity.

[BibT_eX]

[DOI]

Bernard Péroche

Discret. Math., 1982

1981

Partitive hypergraphs.

[BibT_eX]

[DOI]

Michel Chein

M. C. Maurer

Discret. Math., 1981

1979

Nombre de sauts et graphes série-parallèles.

[BibT_eX]

[DOI]

Olivier Cogis

RAIRO Theor. Informatics Appl., 1979

On the X-join decomposition for undirected graphs.

[BibT_eX]

[DOI]