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
no 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 197 matches
- 2024
- Jingxiang He, Ming Han:
Edge DP-Coloring in K4-Minor Free Graphs and Planar Graphs. Axioms 13(6): 375 (2024) - Olivier Fischer, Raphael Steiner:
On the choosability of -minor-free graphs. Comb. Probab. Comput. 33(2): 129-142 (2024) - János Barát:
On the number of edges in a K5-minor-free graph of given girth. Discret. Math. 347(7): 114042 (2024) - Nicolas Bousquet, Théo Pierron, Alexandra Wesolek:
A note on highly connected K2,-minor free graphs. Discret. Math. 347(7): 114005 (2024) - Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang:
The spectral radius of minor-free graphs. Eur. J. Comb. 118: 103875 (2024) - Jian-Bo Lv, Jiacong Fu, Jianxi Li:
Injective Chromatic Index of K4-Minor Free Graphs. Graphs Comb. 40(4): 77 (2024) - Pengcheng Liu, Zhao Zhang, Yingli Ran, Xiaohui Huang:
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs. Math. Struct. Comput. Sci. 34(3): 180-192 (2024) - Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS 2024: 68:1-68:12 - Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma:
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. MFCS 2024: 43:1-43:16 - Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA 2024: 5300-5331 - Tuukka Korhonen, Daniel Lokshtanov:
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. SODA 2024: 5249-5275 - Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA 2024: 296-313 - Hung Le, Christian Wulff-Nilsen:
VC Set Systems in Minor-free (Di)Graphs and Applications. SODA 2024: 5332-5360 - Arnold Filtser:
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications. CoRR abs/2401.14060 (2024) - Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma:
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. CoRR abs/2407.00237 (2024) - 2023
- Huixin Yin, Miaomiao Han, Murong Xu:
Strong Edge Coloring of K4(t)-Minor Free Graphs. Axioms 12(6): 556 (2023) - Jing Gu, Yiqiao Wang, Weifan Wang, Lina Zheng:
Strict neighbor-distinguishing index of K4-minor-free graphs. Discret. Appl. Math. 329: 87-95 (2023) - Xiaomin Zhou, Weihua Yang, Xiaxia Guan, Chengfu Qin:
A characterization of internally 4-connected {P10 - {V1, V2}}-minor-free graphs. Discuss. Math. Graph Theory 43(3): 731-742 (2023) - Michal Lason, Malgorzata Sulkowska:
Modularity of minor-free graphs. J. Graph Theory 102(4): 728-736 (2023) - János Barát:
Extremal K4-minor-free graphs without short cycles. Period. Math. Hung. 86(1): 108-114 (2023) - Zachary Friggstad, Ramin Mousavi:
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. APPROX/RANDOM 2023: 13:1-13:18 - Nicolas Bousquet, Théo Pierron, Alexandra Wesolek:
A note on highly connected K2, 𝓁-minor free graphs. CoRR abs/2301.02133 (2023) - Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR abs/2302.07033 (2023) - Hung Le, Christian Wulff-Nilsen:
VC Set Systems in Minor-free (Di)Graphs and Applications. CoRR abs/2304.01790 (2023) - Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR abs/2308.00555 (2023) - Tuukka Korhonen, Daniel Lokshtanov:
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. CoRR abs/2308.04795 (2023) - Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR abs/2310.20623 (2023) - 2022
- Raphael Steiner:
Disproof of a Conjecture by Woodall on the Choosability of $K_{s, t}$-Minor-Free Graphs. Electron. J. Comb. 29(3) (2022) - Wenjuan Wei, Fengxia Liu, Wei Xiong, Hong-Jian Lai:
On r-hued list coloring of K4(7)-minor free graphs. Discret. Appl. Math. 309: 301-309 (2022) - Fan Yang, Jian-Liang Wu, Huimin Song:
The linear arboricity of K5-minor free graphs. Discret. Appl. Math. 322: 49-60 (2022)
skipping 167 more matches
loading more results
failed to load more results, please try again later
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-09-26 10:56 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