default search action
Marco Gärtler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c15]Asif Ahmad, Chen Song
, Ruomu Tan, Marco Gärtler, Benjamin Klöpper:
Active Learning Application for Recognizing Steps in Chemical Batch Production. ETFA 2022: 1-4 - 2021
- [c14]Marco Gärtler, Benedikt Schmidt:
Practical Challenges of Virtual Assistants and Voice Interfaces in Industrial Applications. HICSS 2021: 1-10 - [c13]Benedikt Schmidt, Reuben Borrison, Marco Gärtler
Practical Aspects for Exploration and Analysis of Manual Interventions in Process Plants. INDIN 2021: 1-6
2010 – 2019
- 2018
- [c12]Benedikt Schmidt, Reuben Borrison, Andrew Cohen, Marcel Dix, Marco Gärtler
Industrial Virtual Assistants: Challenges and Opportunities. UbiComp/ISWC Adjunct 2018: 794-801 - 2012
- [j5]Carla Binucci
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - 2010
- [j4]Robert Görke, Marco Gaertler
Computational Aspects of Lucidity-Driven Graph Clustering. J. Graph Algorithms Appl. 14(2): 165-197 (2010)
2000 – 2009
- 2009
- [c11]Carla Binucci
Drawing Trees in a Streaming Model. GD 2009: 292-303 - 2008
- [j3]Michael Baur, Marco Gaertler
Augmenting k-core generation with preferential attachment. Networks Heterog. Media 3(2): 277-294 (2008) - [j2]Ulrik Brandes, Daniel Delling, Marco Gaertler
On Modularity Clustering. IEEE Trans. Knowl. Data Eng. 20(2): 172-188 (2008) - [c10]Daniel Delling, Marco Gaertler
Engineering Comparators for Graph Clusterings. AAIM 2008: 131-142 - 2007
- [b1]Marco Gaertler:
Algorithmic aspects of clustering: theory, experimental evaluation, and applications in network analysis and visualization. Karlsruhe Institute of Technology, 2007 - [j1]Ulrik Brandes, Marco Gaertler
Engineering graph clustering: Models and experimental evaluation. ACM J. Exp. Algorithmics 12: 1.1:1-1.1:26 (2007) - [c9]Marco Gaertler
Significance-Driven Graph Clustering. AAIM 2007: 11-26 - [c8]Robert Görke, Marco Gaertler
LunarVis - Analytic Visualizations of Large Graphs. GD 2007: 352-364 - [c7]Bastian Katz, Marco Gaertler
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. SOFSEM (1) 2007: 330-341 - [c6]Ulrik Brandes, Daniel Delling, Marco Gaertler
On Finding Graph Clusterings with Maximum Modularity. WG 2007: 121-132 - 2005
- [c5]Marco Gaertler
A Hybrid Model for Drawing Dynamic and Evolving Graphs. GD 2005: 189-200 - [i1]Marco Gaertler, Dorothea Wagner:
A Hybrid Model for Drawing Dynamic and Evolving Graphs. Algorithmic Aspects of Large and Complex Networks 2005 - 2004
- [c4]Marco Gaertler
Clustering. Network Analysis 2004: 178-215 - [c3]Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Drawing the AS Graph in 2.5 Dimensions. GD 2004: 43-48 - 2003
- [c2]Ulrik Brandes, Marco Gaertler
Experiments on Graph Clustering Algorithms. ESA 2003: 568-579 - 2001
- [c1]Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler
Visone. GD 2001: 463-464
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-06-24 20:12 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: