Binh-Minh Bui-Xuan

Hugo Hourcade

Cédric Miachon

Soc. Netw. Anal. Min., 2022

Foremost Non-stop Journey Arrival in Linear Time.

[BibT_eX]

[DOI]

Juan Villacis-Llobet

Maria Potop-Butucaru

Proceedings of the Structural Information and Communication Complexity, 2022

2021

Temporal Matching on Geometric Graph Data.

[BibT_eX]

[DOI]

Timothé Picavet

Ngoc-Trung Nguyen

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Temporal matching.

[BibT_eX]

[DOI]

Julien Baste

Antoine Roux

Theor. Comput. Sci., 2020

Computing Temporal Twins in Time Logarithmic in History Length.

[BibT_eX]

[DOI]

Hugo Hourcade

Cédric Miachon

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Lightweight FEC: Rectangular Codes with Minimum Feedback Information.

[BibT_eX]

[DOI]

Pierre Meyer

Antoine Roux

CoRR, 2019

2013

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Feedback vertex set on graphs of low clique-width.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

How modular structure can simplify tasks on networks

[BibT_eX]

[DOI]

Nick S. Jones

CoRR, 2013

A Note on Graphs of Linear Rank-Width 1.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

CoRR, 2013

2012

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

[BibT_eX]

[DOI]

Michaël Rao

Eur. J. Comb., 2012

2011

Boolean-width of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

On the Boolean-Width of a Graph: Structure and Applications.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

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

Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions

[BibT_eX]

[DOI]

CoRR, 2009

Feedback Vertex Set on Graphs of Low Cliquewidth.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2008

Competitive graph searches.

[BibT_eX]

[DOI]

Christophe Paul

Theor. Comput. Sci., 2008

A Representation Theorem for Union-Difference Families and Application.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Unifying Two Graph Decompositions with Modular Decomposition.

[BibT_eX]

[DOI]

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

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

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

[BibT_eX]

[DOI]

Christophe Paul

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

2003

Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks.

[BibT_eX]

[DOI]