![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Alexander Dobler
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Alexander Dobler
, Martin Nöllenburg
:
Improving Temporal Treemaps by Minimizing Crossings. Comput. Graph. Forum 43(3) (2024) - [c6]Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The Complexity of Cluster Vertex Splitting and Company. SOFSEM 2024: 226-239 - [c5]Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms:
Minimizing Corners in Colored Rectilinear Grids. WALCOM 2024: 134-148 - [i10]Spela Kajzer, Alexander Dobler, Janja Jerebic, Martin Nöllenburg, Joachim Orthaber, Drago Bokal:
Graph drawing applications in combinatorial theory of maturity models. CoRR abs/2403.02026 (2024) - [i9]Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler:
Hoop Diagrams: A Set Visualization Method. CoRR abs/2406.13260 (2024) - 2023
- [j1]Markus Wallinger
, Alexander Dobler
, Martin Nöllenburg
:
LinSets.zip: Compressing Linear Set Diagrams. IEEE Trans. Vis. Comput. Graph. 29(6): 2875-2887 (2023) - [c4]Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler
, Laure Morelle, Amadeus Reinald, Mathis Rocton:
PACE Solver Description: Touiouidth. IPEC 2023: 38:1-38:4 - [c3]Alexander Dobler
, Martin Nöllenburg
:
Block Crossings in One-Sided Tanglegrams. WADS 2023: 386-400 - [i8]Markus Wallinger, Alexander Dobler, Martin Nöllenburg:
LinSets.zip: Compressing Linear Set Diagrams. CoRR abs/2302.08401 (2023) - [i7]Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms:
Crossing Minimization in Time Interval Storylines. CoRR abs/2302.14213 (2023) - [i6]Alexander Dobler, Martin Nöllenburg:
Block Crossings in One-Sided Tanglegrams. CoRR abs/2305.04682 (2023) - [i5]Alexander Dobler:
A Note on the Complexity of One-Sided Crossing Minimization of Trees. CoRR abs/2306.15339 (2023) - [i4]Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The Complexity of Cluster Vertex Splitting and Company. CoRR abs/2309.00504 (2023) - [i3]Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms:
Minimizing Corners in Colored Rectilinear Grids. CoRR abs/2311.14134 (2023) - 2022
- [c2]Alexander Dobler
, Martin Nöllenburg
:
On Computing Optimal Linear Diagrams. Diagrams 2022: 20-36 - [c1]Alexander Dobler
, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. ESA 2022: 44:1-44:18 - [i2]Alexander Dobler, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. CoRR abs/2203.03358 (2022) - [i1]Alexander Dobler, Martin Nöllenburg:
On Computing Optimal Linear Diagrams. CoRR abs/2206.08631 (2022)
Coauthor Index
![](https://dblp.dagstuhl.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.
last updated on 2024-07-20 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint