default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVan Trung Pham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Libor Barto
, Michael Kompatscher, Miroslav Olsák, Van Trung Pham, Michael Pinsker:
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 19(2): 1950010:1-1950010:31 (2019)- 2017
- [j5]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction Problems. ACM Trans. Comput. Log. 18(3): 23:1-23:42 (2017) - [c4]Michael Kompatscher, Van Trung Pham:
A Complexity Dichotomy for Poset Constraint Satisfaction. STACS 2017: 47:1-47:12 - 2016
- [j4]Kévin Perrot, Van Trung Pham:
Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs. Electron. J. Comb. 23(1): 1 (2016) - [j3]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Reducts of the homogeneous Binary Branching C-Relation. J. Symb. Log. 81(4): 1255-1297 (2016) - [c3]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction. STACS 2016: 20:1-20:13 - [i7]Michael Kompatscher, Van Trung Pham:
A complexity dichotomy for poset constraint satisfaction. CoRR abs/1603.00082 (2016) - [i6]Libor Barto, Michael Kompatscher, Miroslav Olsák, Michael Pinsker, Van Trung Pham:
Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures. CoRR abs/1612.07551 (2016) - 2015
- [i5]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction. CoRR abs/1503.07310 (2015) - 2014
- [j2]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
- [j1]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) - [i4]Kévin Perrot, Van Trung Pham:
NP-hardness of minimum feedback arc set problem on Eulerian digraphs and minimum recurrent configuration problem of Chip-firing game. CoRR abs/1303.3708 (2013) - 2012
- [c2]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 - [i3]Van Trung Pham, Thi Ha Duong Phan:
Lattices generated by Chip Firing Game models: characterizations and recognition algorithm. CoRR abs/1205.6256 (2012) - [i2]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
- [c1]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 - [i1]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)
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 2025-01-21 00:06 CET 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:
