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
- Torsten Ueckerdt
Karlsruhe Institute of Technology, Germany
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 148 matches
- 2024
- Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski:
Primal-Dual Cops and Robber. Comput. Geom. Topol. 3(2): 4:1-4:12 (2024) - Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44(2): 417-427 (2024) - Tim Planken, Torsten Ueckerdt:
Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. SoCG 2024: 74:1-74:14 - Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. CoRR abs/2401.05892 (2024) - Kolja Knauer, Torsten Ueckerdt:
Partitioning a Planar Graph into two Triangle-Forests. CoRR abs/2401.15394 (2024) - Torsten Ueckerdt:
A Note on Polychromatic Colorings of Shift-Chains. CoRR abs/2405.05296 (2024) - 2023
- Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan:
Colouring bottomless rectangles and arborescences. Comput. Geom. 115: 102020 (2023) - Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. SIAM J. Discret. Math. 37(4): 2312-2331 (2023) - Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CCCG 2023: 77-88 - Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. ESA 2023: 9:1-9:15 - Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS 2023: 1937-1952 - Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt:
Cops and Robber - When Capturing Is Not Surrounding. WG 2023: 403-416 - Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt:
Primal-Dual Cops and Robber. CoRR abs/2301.05514 (2023) - Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight bound on treedepth in terms of pathwidth and longest path. CoRR abs/2302.02995 (2023) - Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt:
Cops and Robber - When Capturing is not Surrounding. CoRR abs/2302.10577 (2023) - Kolja Knauer, Torsten Ueckerdt:
Clustered independence and bounded treewidth. CoRR abs/2303.13655 (2023) - Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CoRR abs/2303.17028 (2023) - Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. CoRR abs/2306.17073 (2023) - Tim Planken, Torsten Ueckerdt:
Shallow Hitting Edge Sets in Uniform Hypergraphs. CoRR abs/2307.05757 (2023) - Tim Planken, Torsten Ueckerdt:
Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. CoRR abs/2310.19982 (2023) - Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt:
The Density Formula: One Lemma to Bound Them All. CoRR abs/2311.06193 (2023) - 2022
- Michael Kaufmann, Torsten Ueckerdt:
The Density of Fan-Planar Graphs. Electron. J. Comb. 29(1) (2022) - Torsten Ueckerdt, David R. Wood, Wendy Yi:
An Improved Planar Graph Product Structure Theorem. Electron. J. Comb. 29(2) (2022) - Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. SoCG 2022: 38:1-38:14 - Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. SoCG 2022: 39:1-39:15 - Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. ESA 2022: 62:1-62:14 - Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. SODA 2022: 963-978 - Vera Chekan, Torsten Ueckerdt:
Polychromatic Colorings of Unions of Geometric Hypergraphs. WG 2022: 144-157 - Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. CoRR abs/2203.07686 (2022) - Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. CoRR abs/2204.11750 (2022)
skipping 118 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-14 02:38 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