default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingxian Zhong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Maria Chudnovsky
, Sophie Spirkl, Mingxian Zhong:
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring. SIAM J. Comput. 53(1): 111-145 (2024)- [j12]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring. SIAM J. Comput. 53(1): 146-187 (2024) - 2023
- [j11]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - 2021
- [j10]Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong:
List 3-Coloring Graphs with No Induced P6+rP3. Algorithmica 83(1): 216-251 (2021) - [j9]Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850: 98-115 (2021) - 2020
- [j8]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s. Discret. Math. 343(11): 112086 (2020) - [j7]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B 140: 45-83 (2020) - [j6]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. 34(1): 431-469 (2020) - [j5]Clifford Stein, Mingxian Zhong:
Scheduling When You Do Not Know the Number of Machines. ACM Trans. Algorithms 16(1): 9:1-9:20 (2020) - [i10]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020) - [i9]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s. CoRR abs/2006.03009 (2020)
2010 – 2019
- 2019
- [j4]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81(8): 3186-3199 (2019) - [c5]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-Coloring in Hereditary Classes of Graphs. ESA 2019: 31:1-31:15 - [c4]Sophie Spirkl, Maria Chudnovsky, Mingxian Zhong:
Four-coloring P6-free graphs. SODA 2019: 1239-1256 - 2018
- [b1]Mingxian Zhong:
Some Problems in Graph Theory and Scheduling. Columbia University, USA, 2018 - [j3]Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38(4): 779-801 (2018) - [j2]Maria Chudnovsky, Paul D. Seymour, Sophie Spirkl, Mingxian Zhong:
Triangle-free graphs with no six-vertex induced path. Discret. Math. 341(8): 2179-2196 (2018) - [c3]Clifford Stein, Mingxian Zhong:
Scheduling When You Don't Know the Number of Machines. SODA 2018: 1261-1273 - [i8]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. CoRR abs/1802.02282 (2018) - [i7]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring P6-free graphs. II. Finding an excellent precoloring. CoRR abs/1802.02283 (2018) - 2017
- [j1]Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-Coloring P6-Free Graphs with No Induced 5-Cycles. J. Graph Theory 84(3): 262-285 (2017) - [c2]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. WG 2017: 193-205 - [i6]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR abs/1703.05684 (2017) - 2016
- [c1]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA 2016: 1774-1783 - [i5]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately coloring graphs without long induced paths. CoRR abs/1606.02967 (2016) - 2015
- [i4]Maria Chudnovsky, Peter Maceli, Mingxian Zhong:
Three-coloring graphs with no induced seven-vertex path II : using a triangle. CoRR abs/1503.03573 (2015) - [i3]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR abs/1504.06979 (2015) - 2014
- [i2]Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-coloring $P_6$-free graphs with no induced 5-cycles. CoRR abs/1407.2487 (2014) - [i1]Maria Chudnovsky, Peter Maceli, Mingxian Zhong:
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case. CoRR abs/1409.5164 (2014)
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-04-25 05:51 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:
