default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcus Krug
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j7]Thomas Bläsius
, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 68(4): 859-885 (2014)- [j6]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. J. Graph Algorithms Appl. 18(1): 35-76 (2014) - 2013
- [j5]Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic point-set embedding of trees. Comput. Geom. 46(8): 929-944 (2013) - [j4]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. 161(10-11): 1363-1366 (2013) - [j3]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. J. Comb. Optim. 26(4): 723-754 (2013) - [i2]Alexander Koch, Marcus Krug, Ignaz Rutter:
Graphs with Plane Outside-Obstacle Representations. CoRR abs/1306.2978 (2013) - 2012
- [b1]Marcus Krug:
Combinatorial and Geometric Aspects of Computational Network Construction: Algorithms and Complexity. Karlsruhe Institute of Technology, 2012 - [j2]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16: 34-52 (2012) - [c13]Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg:
Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. GD 2012: 553-554 - [i1]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. CoRR abs/1201.2551 (2012) - 2011
- [c12]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c11]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The Density Maximization Problem in Graphs. COCOON 2011: 25-36 - [c10]Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug:
Orthogeodesic Point-Set Embedding of Trees. GD 2011: 52-63 - [c9]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. GD 2011: 179-190 - [c8]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian Orthogeodesic Alternating Paths. IWOCA 2011: 170-181 - 2010
- [c7]Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner:
Synthetic Road Networks. AAIM 2010: 46-57 - [c6]Reinhard Bauer, Marcus Krug, Dorothea Wagner:
Enumerating and Generating Labeled k-degenerate Graphs. ANALCO 2010: 90-98 - [c5]Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner:
Preprocessing Speed-Up Techniques Is Hard. CIAC 2010: 359-370 - [c4]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. GD 2010: 92-104 - [c3]Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner:
Gateway Decompositions for Constrained Reachability Problems. SEA 2010: 449-461
2000 – 2009
- 2009
- [c2]Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff:
Manhattan-Geodesic Embedding of Planar Graphs. GD 2009: 207-218 - 2008
- [j1]Michael Baur, Marco Gaertler, Robert Görke, Marcus Krug, Dorothea Wagner:
Augmenting k-core generation with preferential attachment. Networks Heterog. Media 3(2): 277-294 (2008) - 2007
- [c1]Marcus Krug, Dorothea Wagner:
Minimizing the Area for Planar Straight-Line Grid Drawings. GD 2007: 207-212
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 2024-05-08 20:55 CEST 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:
