default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTilo Wiedera
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Alan Arroyo
, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera:
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69(3): 745-770 (2023)- [j5]Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. J. Graph Algorithms Appl. 27(2): 71-94 (2023) - [c12]Markus Chimani, Niklas Troost, Tilo Wiedera:
A general approximation for multistage subgraph problems. LAGOS 2023: 334-342 - 2022
- [j4]Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. Algorithmica 84(8): 2135-2153 (2022) - [j3]Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. 42(5): 701-728 (2022) - [j2]Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera:
Properties of Large 2-Crossing-Critical Graphs. J. Graph Algorithms Appl. 26(1): 111-147 (2022) - 2021
- [b1]Tilo Wiedera:
Computing Measures of Non-Planarity. University of Osnabrück, Germany, 2021 - [c11]Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. GD 2021: 41-56 - [c10]Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. IWOCA 2021: 558-570 - [i10]Markus Chimani, Niklas Troost, Tilo Wiedera:
A General Approach to Approximate Multistage Subgraph Problems. CoRR abs/2107.02581 (2021) - [i9]Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. CoRR abs/2108.11443 (2021) - [i8]Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera:
Properties of Large 2-Crossing-Critical Graphs. CoRR abs/2112.04854 (2021) - 2020
- [c9]Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. ISCO 2020: 89-101 - [c8]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Inserting One Edge into a Simple Drawing Is Hard. WG 2020: 325-338 - [i7]Markus Chimani, Niklas Troost, Tilo Wiedera:
Approximating Multistage Matching Problems. CoRR abs/2002.06887 (2020) - [i6]Markus Chimani, Fritz Bökler, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. CoRR abs/2002.07012 (2020)
2010 – 2019
- 2019
- [j1]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. ACM J. Exp. Algorithmics 24(1): 2.1:1-2.1:21 (2019) - [c7]Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG 2019: 14:1-14:15 - [c6]Markus Chimani, Tilo Wiedera:
Stronger ILPs for the Graph Genus Problem. ESA 2019: 30:1-30:15 - [i5]Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR abs/1903.05363 (2019) - [i4]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Extending simple drawings with one edge is hard. CoRR abs/1909.07347 (2019) - 2018
- [c5]Markus Chimani, Tilo Wiedera:
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. ESA 2018: 19:1-19:14 - [c4]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. SEA 2018: 22:1-22:15 - [i3]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. CoRR abs/1804.07143 (2018) - [i2]Markus Chimani, Tilo Wiedera:
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. CoRR abs/1806.08283 (2018) - 2016
- [c3]Markus Chimani, Tilo Wiedera:
An ILP-based Proof System for the Crossing Number Problem. ESA 2016: 29:1-29:13 - [c2]Markus Chimani, Karsten Klein, Tilo Wiedera:
A Note on the Practicality of Maximal Planar Subgraph Algorithms. GD 2016: 357-364 - [c1]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. IWOCA 2016: 334-346 - [i1]Markus Chimani, Karsten Klein, Tilo Wiedera:
A Note on the Practicality of Maximal Planar Subgraph Algorithms. CoRR abs/1608.07505 (2016)
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 2025-01-09 12:50 CET 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:
