![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 36 matches
- 2024
- 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) - 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
- Maria Chudnovsky
, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl
, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - 2022
- Fan-Shuo Tseng
, Mantsawee Sanpayao
, Tsang-Yi Wang
, Ming-Xian Zhong
:
Low-Complexity High-Resolution Frequency Estimation of Multi-Sinusoidal Signals. IEEE Trans. Instrum. Meas. 71: 1-12 (2022) - 2021
- Maria Chudnovsky
, Shenwei Huang, Sophie Spirkl
, Mingxian Zhong
:
List 3-Coloring Graphs with No Induced P6+rP3. Algorithmica 83(1): 216-251 (2021) - 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
- 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) - 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) - 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) - Clifford Stein, Mingxian Zhong
:
Scheduling When You Do Not Know the Number of Machines. ACM Trans. Algorithms 16(1): 9:1-9:20 (2020) - Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020) - 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) - 2019
- Maria Chudnovsky
, Oliver Schaudt, Sophie Spirkl
, Maya Stein
, Mingxian Zhong
:
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81(8): 3186-3199 (2019) - Mingxiang Wen, Xiang Qu, Yanyan Zhu, Lingfang Tian, Zhongqin Shen, Xiulin Yang, Xianqing Shi:
Exploration of Novel Biomarkers in Vasculitis by Integrated Bioinfomatic Approaches. J. Comput. Biol. 26(12): 1448-1457 (2019) - 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 - Sophie Spirkl, Maria Chudnovsky, Mingxian Zhong:
Four-coloring P6-free graphs. SODA 2019: 1239-1256 - 2018
- Mingxian Zhong:
Some Problems in Graph Theory and Scheduling. Columbia University, USA, 2018 - 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) - 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) - Zhongyuan Zhao, Gang Chen, Mingxiang Dai:
Distributed event-triggered scheme for a convex optimization problem in multi-agent systems. Neurocomputing 284: 90-98 (2018) - Clifford Stein, Mingxian Zhong:
Scheduling When You Don't Know the Number of Machines. SODA 2018: 1261-1273 - Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. CoRR abs/1802.02282 (2018) - Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring P6-free graphs. II. Finding an excellent precoloring. CoRR abs/1802.02283 (2018) - 2017
- 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) - Maria Chudnovsky
, Oliver Schaudt, Sophie Spirkl
, Maya Stein
, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. WG 2017: 193-205 - 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
- Gang Chen, Zhongyuan Zhao, Mingxiang Dai:
An optimal active power control strategy of islanded microgrid with diverse communication delays. ICARCV 2016: 1-6 - Maria Chudnovsky
, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA 2016: 1774-1783 - Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately coloring graphs without long induced paths. CoRR abs/1606.02967 (2016) - 2015
- Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR abs/1504.06979 (2015)
skipping 6 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-06-22 07:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint