default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThi Ha Duong Phan
Person information
- affiliation: Pierre and Marie Curie University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan, Adrien Richard:
Dividing Permutations in the Semiring of Functional Digraphs. AUTOMATA 2024: 95-107- [i10]Duy Hieu Do, Thi Ha Duong Phan:
An improvement on the Louvain algorithm using random walks. CoRR abs/2403.08313 (2024) - 2023
- [j16]Tien Dat Dang, Duy Hieu Do, Thi Ha Duong Phan:
Community detection in directed graphs using stationary distribution and hitting times methods. Soc. Netw. Anal. Min. 13(1): 80 (2023) - 2022
- [c10]Thi Ha Duong Phan:
A Survey on the Stability of (Extended) Linear Sand Pile Model. Automata and Complexity 2022: 253-281 - 2021
- [j15]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and enhanced inclusion-minimal cograph completion. Discret. Appl. Math. 288: 138-151 (2021) - [i9]Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. CoRR abs/2103.04447 (2021) - [i8]Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the Termination of Some Biclique Operators on Multipartite Graphs. CoRR abs/2103.04451 (2021) - 2020
- [i7]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and Enhanced Inclusion-Minimal Cograph Completion. CoRR abs/2001.07765 (2020)
2010 – 2019
- 2018
- [i6]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR abs/1803.05414 (2018) - 2017
- [c9]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and Enhanced Inclusion-Minimal Cograph Completion. COCOA (1) 2017: 210-224 - 2016
- [j14]Christophe Crespelle, Tien-Nam Le
, Kévin Perrot, Thi Ha Duong Phan:
Linearity is strictly more powerful than contiguity for encoding graphs. Discret. Math. 339(8): 2168-2177 (2016) - 2015
- [j13]Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the termination of some biclique operators on multipartite graphs. Discret. Appl. Math. 195: 59-73 (2015) - [j12]Christophe Crespelle, Thi Ha Duong Phan, The Hung Tran:
Termination of the iterated strong-factor operator on multipartite graphs. Theor. Comput. Sci. 571: 67-77 (2015) - [c8]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS 2015: 212-223 - 2014
- [j11]Enrico Formenti, Van Trung Pham, Thi Ha Duong Phan, Tran Thi Thu Huong:
Fixed-point forms of the parallel symmetric sandpile model. Theor. Comput. Sci. 533: 1-14 (2014) - 2013
- [j10]Van Trung Pham, Thi Ha Duong Phan:
Lattices generated by Chip Firing Game models: Criteria and recognition algorithms. Eur. J. Comb. 34(5): 812-832 (2013) - [j9]Robert Cori, Thi Ha Duong Phan, Tran Thi Thu Huong:
Signed Chip Firing Games and symmetric Sandpile Models on the cycles. RAIRO Theor. Informatics Appl. 47(2): 133-146 (2013) - [c7]Thi Ha Duong Phan, Nguyen-Ngoc Doanh, Kévin Perrot:
Effects of migration of three competing species on their distributions in multizone environment. RIVF 2013: 227-232 - 2012
- [c6]Le Manh Ha, Van Trung Pham, Thi Ha Duong Phan:
A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games. RIVF 2012: 1-6 - [i5]Van Trung Pham, Thi Ha Duong Phan:
Lattices generated by Chip Firing Game models: characterizations and recognition algorithm. CoRR abs/1205.6256 (2012) - [i4]Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham:
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. CoRR abs/1207.0654 (2012) - 2011
- [c5]Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham:
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. Automata 2011: 17-28 - [i3]Enrico Formenti, Van Trung Pham, Ha Duong Phan, Tran Thi Thu Huong:
Fixed point forms of the parallel symmetric sandpile model. CoRR abs/1109.0825 (2011) - 2010
- [j8]Thi Ha Duong Phan, Tran Thi Thu Huong:
On the stability of Sand Piles Model. Theor. Comput. Sci. 411(3): 594-601 (2010) - [c4]Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. COCOA (1) 2010: 1-10 - [c3]Ngoc Doanh Nguyen, Thi Ha Duong Phan, Thi Anh Ngoc Nguyen, Alexis Drogoul, Jean-Daniel Zucker:
Disk Graph-Based Model: A Graph Theoretical Approach for Linking Agent-Based Models and Dynamical Systems. RIVF 2010: 1-4 - [p1]Le Manh Ha, Nguyen Anh Tam, Thi Ha Duong Phan:
Algorithmic Aspects of the Reachability of Conflicting Chip Firing Game. Advances in Intelligent Information and Database Systems 2010: 359-370
2000 – 2009
- 2009
- [j7]Matthieu Latapy, Thi Ha Duong Phan:
The lattice of integer partitions and its infinite extension. Discret. Math. 309(6): 1357-1367 (2009) - [c2]Le Manh Ha, Pham Tra An, Thi Ha Duong Phan:
On the Relation Between Chip Firing Games and Petri Nets. RIVF 2009: 1-8 - 2008
- [j6]Thi Ha Duong Phan:
Two sided Sand Piles Model and unimodal sequences. RAIRO Theor. Informatics Appl. 42(3): 631-646 (2008) - 2007
- [j5]Minh Ha Le, Thi Ha Duong Phan:
Strict partitions and discrete dynamical systems. Theor. Comput. Sci. 389(1-2): 82-90 (2007) - 2004
- [j4]Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan:
Sandpile models and lattices: a comprehensive survey. Theor. Comput. Sci. 322(2): 383-407 (2004) - 2002
- [j3]Eric Goles Ch., Michel Morvan, Ha Duong Phan:
Sandpiles and order structure of integer partitions. Discret. Appl. Math. 117(1-3): 51-64 (2002) - [j2]Eric Goles Ch., Michel Morvan, Ha Duong Phan:
The structure of a linear chip firing game and related models. Theor. Comput. Sci. 270(1-2): 827-841 (2002) - 2001
- [j1]Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan:
Structure of some sand piles model. Theor. Comput. Sci. 262(1): 525-556 (2001) - [c1]Clémence Magnien, Ha Duong Phan, Laurent Vuillon:
Characterization of Lattices Induced by (extended) Chip Firing Games. DM-CCG 2001: 229-244 - 2000
- [i2]Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan:
Structure of some sand pile model. CoRR cs.DM/0008002 (2000) - [i1]Eric Goles Ch., Michel Morvan, Ha Duong Phan:
Lattice Structure and Convergence of a Game of Cards. CoRR cs.DM/0010036 (2000)
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-07-21 21:14 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:
