default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBinh-Minh Bui-Xuan
Person information
- affiliation: LIRMM Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Lina Azerouk, Binh-Minh Bui-Xuan, Camille Palisoc, Maria Potop-Butucaru, Massinissa Tighilt:
Distributed computation of temporal twins in periodic undirected time-varying graphs. CoRR abs/2404.17195 (2024)- 2022
- [j12]Binh-Minh Bui-Xuan, Hugo Hourcade
, Cédric Miachon:
Computing small temporal modules in time logarithmic in history length. Soc. Netw. Anal. Min. 12(1): 19 (2022) - [c11]Juan Villacis-Llobet, Binh-Minh Bui-Xuan, Maria Potop-Butucaru:
Foremost Non-stop Journey Arrival in Linear Time. SIROCCO 2022: 283-301 - 2021
- [c10]Timothé Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan:
Temporal Matching on Geometric Graph Data. CIAC 2021: 394-408 - 2020
- [j11]Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux:
Temporal matching. Theor. Comput. Sci. 806: 184-196 (2020) - [c9]Binh-Minh Bui-Xuan, Hugo Hourcade, Cédric Miachon:
Computing Temporal Twins in Time Logarithmic in History Length. COMPLEX NETWORKS (2) 2020: 651-663
2010 – 2019
- 2019
- [i8]Binh-Minh Bui-Xuan, Pierre Meyer, Antoine Roux:
Lightweight FEC: Rectangular Codes with Minimum Feedback Information. CoRR abs/1904.02076 (2019) - 2018
- [i7]Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux:
Temporal Matching. CoRR abs/1812.08615 (2018) - 2013
- [j10]Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle:
Feedback vertex set on graphs of low clique-width. Eur. J. Comb. 34(3): 666-679 (2013) - [j9]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511: 66-76 (2013) - [i6]Binh-Minh Bui-Xuan, Nick S. Jones:
How modular structure can simplify tasks on networks. CoRR abs/1305.4760 (2013) - [i5]Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy:
A Note on Graphs of Linear Rank-Width 1. CoRR abs/1306.1345 (2013) - 2012
- [j8]Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao:
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5): 688-711 (2012) - 2011
- [j7]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-width of graphs. Theor. Comput. Sci. 412(39): 5187-5204 (2011) - [c8]Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342 - 2010
- [j6]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. 158(7): 809-819 (2010) - [c7]Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle:
On the Boolean-Width of a Graph: Structure and Applications. WG 2010: 159-170
2000 – 2009
- 2009
- [j5]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157(9): 1993-2009 (2009) - [j4]Binh-Minh Bui-Xuan, Michel Habib:
Unifying the representation of symmetric crossing families and weakly partitive families. Electron. Notes Discret. Math. 34: 329-333 (2009) - [c6]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA 2009: 113-124 - [c5]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-Width of Graphs. IWPEC 2009: 61-74 - [i4]Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions. CoRR abs/0903.4796 (2009) - 2008
- [b1]Binh-Minh Bui-Xuan:
Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms. Montpellier 2 University, France, 2008 - [j3]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008) - [c4]Binh-Minh Bui-Xuan, Michel Habib:
A Representation Theorem for Union-Difference Families and Application. LATIN 2008: 492-503 - 2007
- [c3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC 2007: 52-64 - 2006
- [j2]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. 27: 13-14 (2006) - [c2]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG 2006: 278-288 - [i3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms. CoRR abs/cs/0603048 (2006) - [i2]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Unifying two Graph Decompositions with Modular Decomposition. CoRR abs/cs/0604065 (2006) - [i1]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic Aspects of a Novel Modular Decomposition Theory. CoRR abs/cs/0611019 (2006) - 2005
- [c1]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155 - 2003
- [j1]Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry:
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. Int. J. Found. Comput. Sci. 14(2): 267-285 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-04 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
