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 99 matches
- 2025
- Daniel Král', Ander Lamaison:
Planar graph with twin-width seven. Eur. J. Comb. 123: 103749 (2025) - 2024
- Hugues Déprés:
Twin-width: lower bounds and approximation algorithms. (Twin-width: bornes inférieures et algorithmes d'approximation). École normale supérieure de Lyon, France, 2024 - Colin Geniet:
Twin-Width, logical and combinatorial characterisations. (Twin-width : Caractérisations logiques et combinatoires). École normale supérieure de Lyon, France, 2024 - Jakub Balabán, Petr Hlinený, Jan Jedelský:
Twin-width and transductions of proper k-mixed-thin graphs. Discret. Math. 347(8): 113876 (2024) - Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond:
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347(1): 113750 (2024) - Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115: 103772 (2024) - Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk:
Twin-Width IV: Ordered Graphs and Matrices. J. ACM 71(3): 21 (2024) - Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. Log. Methods Comput. Sci. 20(3) (2024) - Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. 53(5): 1602-1640 (2024) - Martin Grohe, Daniel Neuen:
Isomorphism for Tournaments of Small Twin Width. ICALP 2024: 78:1-78:20 - Jakub Balabán, Robert Ganian, Mathis Rocton:
Twin-Width Meets Feedback Edges and Vertex Integrity. IPEC 2024: 3:1-3:22 - Daniel Král, Kristýna Pekárková, Kenny Storgel:
Twin-Width of Graphs on Surfaces. MFCS 2024: 66:1-66:15 - Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov:
A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) 2024: 444-456 - Jakub Balabán, Robert Ganian, Mathis Rocton:
Computing Twin-Width Parameterized by the Feedback Edge Number. STACS 2024: 7:1-7:19 - Édouard Bonnet, Kristóf Huszár:
On the twin-width of smooth manifolds. CoRR abs/2407.10174 (2024) - Jakub Balabán, Robert Ganian, Mathis Rocton:
Twin-Width Meets Feedback Edges and Vertex Integrity. CoRR abs/2407.15514 (2024) - 2023
- Chaoqun Song, Xiaohui Shen, Junchao Xia:
A Digital Twin Model for Automatic Width Control of Hot Rolling Mill. IEEE Access 11: 90613-90621 (2023) - William Pettersson, John Sylvester:
Bounds on the Twin-Width of Product Graphs. Discret. Math. Theor. Comput. Sci. 25(1) (2023) - Édouard Bonnet, Hugues Déprés:
Twin-width can be exponential in treewidth. J. Comb. Theory B 161: 1-14 (2023) - Michal Pilipczuk, Marek Sokolowski:
Graphs of bounded twin-width are quasi-polynomially χ-bounded. J. Comb. Theory B 161: 382-406 (2023) - Colin Geniet, Stéphan Thomassé:
First Order Logic and Twin-Width in Tournaments. ESA 2023: 53:1-53:14 - Petr Hlinený, Jan Jedelský:
Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. ICALP 2023: 75:1-75:18 - André Schidler, Stefan Szeider:
Computing Twin-width with SAT and Branch & Bound. IJCAI 2023: 2013-2021 - Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski:
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC 2023: 11:1-11:13 - Irene Heinrich, Simon Raßmann:
Twin-Width of Graphs with Tree-Structured Decompositions. IPEC 2023: 25:1-25:17 - Wojciech Przybyszewski:
Distal Combinatorial Tools for Graphs of Bounded Twin-Width. LICS 2023: 1-13 - Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA 2023: 3229-3244 - Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant:
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. STACS 2023: 10:1-10:15 - Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé:
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. STACS 2023: 15:1-15:16 - André Schidler, Stefan Szeider:
Computing twin-width with SAT and branch & bound - Results. Zenodo, 2023
skipping 69 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 2025-01-23 05:24 CET 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