Остановите войну!
for scientists:
default search action
Markus Chimani
- > Home > Persons > Markus Chimani
Publications
- 2015
- [j23]Markus Chimani, Carsten Gutwenger:
Hypergraph and Minor Crossing Number Problems. J. Graph Algorithms Appl. 19(1): 191-222 (2015) - 2013
- [r2]Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Crossings and Planarization. Handbook of Graph Drawing and Visualization 2013: 43-85 - [r1]Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, Petra Mutzel:
The Open Graph Drawing Framework (OGDF). Handbook of Graph Drawing and Visualization 2013: 543-569 - 2012
- [j12]Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. J. Graph Algorithms Appl. 16(3): 729-757 (2012) - 2011
- [j10]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. J. Graph Algorithms Appl. 15(1): 127-155 (2011) - [c28]Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. GD 2011: 87-98 - 2010
- [j8]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-free upward crossing minimization. ACM J. Exp. Algorithmics 15 (2010) - [c22]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong:
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. GD 2010: 141-152 - 2009
- [j6]Markus Chimani, Carsten Gutwenger:
Non-planar core reduction of graphs. Discret. Math. 309(7): 1838-1855 (2009) - [j5]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on exact crossing minimization using column generation. ACM J. Exp. Algorithmics 14 (2009) - [c19]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. GD 2009: 94-106 - [c18]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf:
Inserting a vertex into a planar graph. SODA 2009: 375-383 - 2008
- [j3]Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5(2): 373-388 (2008) - [c13]Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel:
Computing Maximum C-Planar Subgraphs. GD 2008: 114-120 - [c11]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 - 2007
- [j2]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
On the Minimum Cut of Planarizations. Electron. Notes Discret. Math. 28: 177-184 (2007) - [c7]Markus Chimani, Carsten Gutwenger:
Algorithms for the Hypergraph and the Minor Crossing Number Problems. ISAAC 2007: 184-195 - 2006
- [c6]Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on Exact Crossing Minimization Using Column Generation. WEA 2006: 303-315 - 2005
- [c3]Carsten Gutwenger, Markus Chimani:
Non-planar Core Reduction of Graphs. GD 2005: 223-234
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-04-17 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint