E-LIB Suche - Ergebnisse für: Minh, Bui Xuan Binh

1

Low Diameter Algebraic Graphs:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,

Hai, Bui Xuan ; Minh, Bui Xuan Binh ; Van Chua, Le. - p. 465-471 , 2021

Link: https://doi.org/10.1007/..

2

Foremost Non-stop Journey Arrival in Linear Time:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Villacis-Llobet, Juan ; Bui-Xuan, Binh-Minh ; Potop-Butucaru, Maria - p. 283-301 , 2022

Link: https://doi.org/10.1007/..

3

Computing small temporal modules in time logarithmic in his..:

Bui-Xuan, Binh-Minh ; Hourcade, Hugo ; Miachon, Cédric
Social Network Analysis and Mining. 12 (2021) 1 - p. , 2021

Link: https://doi.org/10.1007/..

4

Temporal Matching on Geometric Graph Data:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Picavet, Timothe ; Nguyen, Ngoc-Trung ; Bui-Xuan, Binh-Minh - p. 394-408 , 2021

Link: https://doi.org/10.1007/..

5

Computing Temporal Twins in Time Logarithmic in History Len..:

, In: Studies in Computational Intelligence; Complex Networks & Their Applications IX,

Bui-Xuan, Binh-Minh ; Hourcade, Hugo ; Miachon, Cédric - p. 651-663 , 2021

Link: https://doi.org/10.1007/..

6

Temporal matching:

Baste, Julien ; Bui-Xuan, Binh-Minh ; Roux, Antoine
Theoretical Computer Science. 806 (2020) - p. 184-196 , 2020

Link: https://doi.org/10.1016/..

7

How modular structure can simplify tasks on networks: param..:

Bui-Xuan, Binh-Minh ; Jones, Nick S.
Proceedings: Mathematical, Physical and Engineering Sciences. 470 (2014) 2170 - p. 1-8 , 2014

Link: https://www.jstor.org/st..

8

Fast dynamic programming for locally checkable vertex subse..:

Bui-Xuan, Binh-Minh ; Telle, Jan Arne ; Vatshelle, Martin
Theoretical Computer Science. 511 (2013) - p. 66-76 , 2013

Link: https://doi.org/10.1016/..

9

Feedback vertex set on graphs of low clique-width:

Bui-Xuan, Binh-Minh ; Suchý, Ondřej ; Telle, Jan Arne.
European Journal of Combinatorics. 34 (2013) 3 - p. 666-679 , 2013

Link: https://doi.org/10.1016/..

10

Tree-representation of set families and applications to com..:

Bui-Xuan, Binh-Minh ; Habib, Michel ; Rao, Michaël
European Journal of Combinatorics. 33 (2012) 5 - p. 688-711 , 2012

Link: https://doi.org/10.1016/..

11

Boolean-width of graphs:

Bui-Xuan, Binh-Minh ; Telle, Jan Arne ; Vatshelle, Martin
Theoretical Computer Science. 412 (2011) 39 - p. 5187-5204 , 2011

Link: https://doi.org/10.1016/..

12

H-join decomposable graphs and algorithms with runtime sing..:

Bui-Xuan, Binh-Minh ; Telle, Jan Arne ; Vatshelle, Martin
Discrete Applied Mathematics. 158 (2010) 7 - p. 809-819 , 2010

Link: https://doi.org/10.1016/..

13

Competitive graph searches:

Bui-Xuan, Binh-Minh ; Habib, Michel ; Paul, Christophe
Theoretical Computer Science. 393 (2008) 1-3 - p. 72-80 , 2008

Link: https://doi.org/10.1016/..

14

On Modular Decomposition Concepts: the case for Homogeneous..:

Bui-Xuan, Binh-Minh ; Habib, Michel ; Limouzy, Vincent.
Electronic Notes in Discrete Mathematics. 27 (2006) - p. 13-14 , 2006

Link: https://doi.org/10.1016/..

15

The effect of adverse childhood experiences on depression, ..:

Thai, Truc Thanh ; Cao, Phuong Le Tran ; Kim, Loan Xuan...
Asian Journal of Psychiatry. 53 (2020) - p. 102134 , 2020

Link: https://doi.org/10.1016/..