Binh-Minh Bui-Xuan

37 papers B 7C 2Misc 1Journal 23Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Model checking with temporal graphs and their derivative. CoRR Binh-Minh Bui-Xuan, Florent Krasnopol, Bruno Monasson, Nathalie Sznajder
2026	J	`jnl`	The Price of Universal Temporal Reachability. CoRR Binh-Minh Bui-Xuan, Nhat-Minh Nguyen, Sébastien Tixeuil, Yukiko Yamauchi
2025	—	`conf`	Distributed Computation of Temporal Twins in Periodic Undirected Time-Varying Graphs. NETYS Massinissa Tighilt, Lina Azerouk, Camille Palisoc, Binh-Minh Bui-Xuan, Maria Potop-Butucaru
2025	B	`conf`	Geometric Swarm Flocking with OWC Constraints. NCA Kerrian Aziza, Massinissa Tighilt, Binh-Minh Bui-Xuan
2024	J	`jnl`	Distributed computation of temporal twins in periodic undirected time-varying graphs. CoRR Lina Azerouk, Binh-Minh Bui-Xuan, Camille Palisoc, Maria Potop-Butucaru, Massinissa Tighilt
2022	J	`jnl`	Computing small temporal modules in time logarithmic in history length. Soc. Netw. Anal. Min. Binh-Minh Bui-Xuan, Hugo Hourcade, Cédric Miachon
2022	B	`conf`	Foremost Non-stop Journey Arrival in Linear Time. SIROCCO Juan Villacis-Llobet, Binh-Minh Bui-Xuan, Maria Potop-Butucaru
2021	C	`conf`	Temporal Matching on Geometric Graph Data. CIAC Timothé Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan
2020	—	`conf`	Computing Temporal Twins in Time Logarithmic in History Length. COMPLEX NETWORKS (2) Binh-Minh Bui-Xuan, Hugo Hourcade, Cédric Miachon
2020	J	`jnl`	Temporal matching. Theor. Comput. Sci. Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
2019	J	`jnl`	Lightweight FEC: Rectangular Codes with Minimum Feedback Information. CoRR Binh-Minh Bui-Xuan, Pierre Meyer, Antoine Roux
2018	J	`jnl`	Temporal Matching. CoRR Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
2013	J	`jnl`	A Note on Graphs of Linear Rank-Width 1. CoRR Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
2013	J	`jnl`	Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2013	J	`jnl`	Feedback vertex set on graphs of low clique-width. Eur. J. Comb. Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle
2013	J	`jnl`	How modular structure can simplify tasks on networks CoRR Binh-Minh Bui-Xuan, Nick S. Jones
2012	J	`jnl`	Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao
2011	Misc	`conf`	A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
2011	J	`jnl`	Boolean-width of graphs. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2010	J	`jnl`	H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2010	B	`conf`	On the Boolean-Width of a Graph: Structure and Applications. WG Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle
2009	J	`jnl`	Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2009	—	`conf`	Boolean-Width of Graphs. IWPEC Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2009	J	`jnl`	Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions CoRR Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2009	C	`conf`	Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
2009	J	`jnl`	Unifying the representation of symmetric crossing families and weakly partitive families. Electron. Notes Discret. Math. Binh-Minh Bui-Xuan, Michel Habib
2008	B	`conf`	A Representation Theorem for Union-Difference Families and Application. LATIN Binh-Minh Bui-Xuan, Michel Habib
2008	J	`jnl`	Competitive graph searches. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
2008	—	`—`	Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms. Binh-Minh Bui-Xuan
2007	B	`conf`	Unifying Two Graph Decompositions with Modular Decomposition. ISAAC Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Algorithmic Aspects of a Novel Modular Decomposition Theory CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	B	`conf`	Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Homogeneity vs. Adjacency: generalising some graph decomposition algorithms CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Unifying two Graph Decompositions with Modular Decomposition CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2005	B	`conf`	Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
2003	J	`jnl`	Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. Int. J. Found. Comput. Sci. Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry