default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoland Glantz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c13]Roland Glantz, Maria Predari, Henning Meyerhenke
:
Topology-induced Enhancement of Mappings. ICPP 2018: 9:1-9:10- [c12]Roland Glantz, Henning Meyerhenke:
Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach. SDM 2018: 1-9 - [i5]Roland Glantz, Maria Predari, Henning Meyerhenke:
Topology-induced Enhancement of Mappings. CoRR abs/1804.07131 (2018) - 2017
- [j6]Roland Glantz, Henning Meyerhenke:
On finding convex cuts in general, bipartite and plane graphs. Theor. Comput. Sci. 695: 54-73 (2017) - 2016
- [j5]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. ACM J. Exp. Algorithmics 21(1): 1.6:1-1.6:20 (2016) - [i4]Roland Glantz, Christian L. Staudt, Henning Meyerhenke:
Correspondences between partitions. CoRR abs/1603.04788 (2016) - 2015
- [c11]Roland Glantz, Henning Meyerhenke, Alexander Noe:
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures. PDP 2015: 236-243 - 2014
- [c10]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. SEA 2014: 364-375 - [i3]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-based Coarsening and Partitioning of Complex Networks. CoRR abs/1402.2782 (2014) - [i2]Roland Glantz, Henning Meyerhenke, Alexander Noe:
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures. CoRR abs/1411.0921 (2014) - 2013
- [c9]Roland Glantz, Henning Meyerhenke:
Finding All Convex Cuts of a Plane Graph in Cubic Time. CIAC 2013: 246-263 - [i1]Roland Glantz, Henning Meyerhenke:
Finding all Convex Cuts of a Plane Graph in Cubic Time. CoRR abs/1303.4349 (2013) - 2011
- [j4]Roland Glantz, Markus Hilpert:
Capillary Displacement in Totally Wetting And Infinitely Long Right Prisms. Multiscale Model. Simul. 9(4): 1765-1800 (2011)
2000 – 2009
- 2006
- [j3]Roland Glantz, Marcello Pelillo:
Graph polynomials from principal pivoting. Discret. Math. 306(24): 3253-3266 (2006) - 2004
- [j2]Roland Glantz, Marcello Pelillo, Walter G. Kropatsch:
Matching Segmentation Hierarchies. Int. J. Pattern Recognit. Artif. Intell. 18(3): 397-424 (2004) - 2003
- [j1]Paul Kammerer, Roland Glantz:
Segmentation of brush strokes by saliency preserving dual graph contraction. Pattern Recognit. Lett. 24(8): 1043-1050 (2003) - [c8]Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch:
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set. GbRPR 2003: 24-34 - [c7]Paolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo:
Swap Strategies for Graph Matching. GbRPR 2003: 142-153 - [c6]Roland Glantz, Marcello Pelillo:
Graph Polynomials, Principal Piovoting, and Maximum Independent Sets. GbRPR 2003: 166-177 - [c5]Roland Glantz, Marcello Pelillo, Walter G. Kropatsch:
Hierarchical matching of panoramic images. ICIAP 2003: 328-333 - 2002
- [c4]Yll Haxhimusa, Roland Glantz, Maamar Saib, Georg Langs, Walter G. Kropatsch:
Logarithmic Tapering Graph Pyramid. DAGM-Symposium 2002: 117-124 - 2001
- [c3]Roland Glantz, Walter G. Kropatsch:
Skeletons in the Framework of Graph Pyramids. IWVF 2001: 186-195 - [p1]Walter G. Kropatsch, Mark James Burge, Roland Glantz:
Graphs in Image Analysis. Digital Image Analysis 2001: 179-197 - 2000
- [c2]Roland Glantz, Walter G. Kropatsch:
Plane Embedding of Dually Contracted Graphs. DGCI 2000: 348-357 - [c1]Roland Glantz, Walter G. Kropatsch:
Guided Relinking of Graph Pyramids. SSPR/SPR 2000: 367-376
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-04-25 05:49 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:
