default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Daniel Schulze
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Sören Domrös, Reinhard von Hanxleden, Miro Spönemann, Ulf Rüegg, Christoph Daniel Schulze:
The Eclipse Layout Kernel. CoRR abs/2311.00533 (2023)
2010 – 2019
- 2019
- [b1]Christoph Daniel Schulze:
Text in Diagrams: Challenges to and Opportunities of Automatic Layout. University of Kiel, Germany, 2019 - 2018
- [c13]Christoph Daniel Schulze, Nis Wechselberg, Reinhard von Hanxleden
:
Edge Label Placement in Layered Graph Drawing. Diagrams 2018: 71-78 - [c12]Christoph Daniel Schulze, Gregor Hoops, Reinhard von Hanxleden:
Automatic Layout and Label Management for Compact UML Sequence Diagrams. VL/HCC 2018: 187-191 - 2016
- [c11]Ulf Rüegg, Christoph Daniel Schulze, Daniel Grevismühl, Reinhard von Hanxleden:
Using One-Dimensional Compaction for Smaller Graph Drawings. Diagrams 2016: 212-218 - [c10]Christoph Daniel Schulze, Christina Plöger, Reinhard von Hanxleden:
On Comments in Visual Languages. Diagrams 2016: 219-225 - [c9]Ulf Rüegg, Rajneesh Lakkundi, Ashwin Prasad, Anand Kodaganur, Christoph Daniel Schulze, Reinhard von Hanxleden:
Incremental diagram layout for automated model migration. MoDELS 2016: 185-195 - [c8]Christoph Daniel Schulze:
Two Opportunities and Challenges of Automatic Layout in Visual Languages. SRC@MoDELS 2016 - [c7]Christoph Daniel Schulze, Yella Lasch, Reinhard von Hanxleden:
Label management: Keeping complex diagrams usable. VL/HCC 2016: 3-11 - 2015
- [c6]Ulf Rüegg, Christoph Daniel Schulze, John Julian Carstens, Reinhard von Hanxleden:
Size- and Port-Aware Horizontal Node Coordinate Assignment. GD 2015: 139-150 - 2014
- [j1]Christoph Daniel Schulze, Miro Spönemann, Reinhard von Hanxleden:
Drawing layered graphs with port constraints. J. Vis. Lang. Comput. 25(2): 89-106 (2014) - [c5]Miro Spönemann, Christoph Daniel Schulze, Ulf Rüegg, Reinhard von Hanxleden:
Counting Crossings for Layered Hypergraphs. Diagrams 2014: 9-15 - [c4]Christoph Daniel Schulze, Reinhard von Hanxleden:
Automatic layout in the face of unattached comments. VL/HCC 2014: 41-44 - [c3]Christoph Daniel Schulze, Miro Spönemann, Christian Schneider, Reinhard von Hanxleden:
Two applications for transient views in software development environments. VL/HCC 2014: 219-220 - 2013
- [c2]Miro Spönemann, Christoph Daniel Schulze, Christian Motika, Christian Schneider, Reinhard von Hanxleden:
KIELER: Building on automatic layout for pragmatics-aware modeling. VL/HCC 2013: 195-196 - 2012
- [c1]Lars Kristian Klauske, Christoph Daniel Schulze, Miro Spönemann, Reinhard von Hanxleden:
Improved Layout for Data Flow Diagrams with Port Constraints. Diagrams 2012: 65-79
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 13:03 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:
