default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTanja Hartmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[p1]Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Clustering Evolving Networks. Algorithm Engineering 2016: 280-329- 2015
- [j3]Tanja Hartmann, Jonathan Rollin
, Ignaz Rutter:
Regular Augmentation of Planar Graphs. Algorithmica 73(2): 306-370 (2015) - [c8]Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, Tanja Hartmann, Dorothea Wagner:
Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs. SDM 2015: 100-108 - 2014
- [b1]Tanja Hartmann:
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering. Karlsruhe Institute of Technology, 2014 - [c7]Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg:
Simultaneous Embeddability of Two Partitions. GD 2014: 64-75 - [i5]Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Clustering Evolving Networks. CoRR abs/1401.3516 (2014) - [i4]Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg:
Simultaneous Embeddability of Two Partitions. CoRR abs/1408.6019 (2014) - 2013
- [j2]Robert Görke, Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Identifikation von Clustern in Graphen. Inform. Spektrum 36(2): 144-152 (2013) - [c6]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Hierarchies of Predominantly Connected Communities. WADS 2013: 365-377 - [i3]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Hierarchies of Predominantly Connected Communities. CoRR abs/1305.0757 (2013) - [i2]Tanja Hartmann, Dorothea Wagner:
Dynamic Gomory-Hu Tree Construction - fast and simple. CoRR abs/1310.0178 (2013) - 2012
- [j1]Robert Görke, Tanja Hartmann, Dorothea Wagner:
Dynamic Graph Clustering Using Minimum-Cut Trees. J. Graph Algorithms Appl. 16(2): 411-446 (2012) - [c5]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Complete hierarchical cut-clustering: A case study on expansion and modularity. Graph Partitioning and Graph Clustering 2012: 157-170 - [c4]Tanja Hartmann, Dorothea Wagner:
Fast and Simple Fully-Dynamic Cut Tree Construction. ISAAC 2012: 95-105 - [c3]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. ISAAC 2012: 402-412 - [i1]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. CoRR abs/1209.3865 (2012) - 2011
- [c2]Christof Doll, Tanja Hartmann, Dorothea Wagner:
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. WADS 2011: 338-349
2000 – 2009
- 2009
- [c1]Robert Görke, Tanja Hartmann, Dorothea Wagner:
Dynamic Graph Clustering Using Minimum-Cut Trees. WADS 2009: 339-350
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:38 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:
