default search action
Hanjo Täubig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c12]Haris Aziz
, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig:
Welfare Maximization in Fractional Hedonic Games. IJCAI 2015: 461-467 - 2014
- [j7]Hanjo Täubig, Jeremias Weihmann:
Matrix power inequalities and the number of walks in graphs. Discret. Appl. Math. 176: 122-129 (2014) - [j6]Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid
SKIP+: A Self-Stabilizing Skip Graph. J. ACM 61(6): 36:1-36:26 (2014) - [j5]Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory Comput. Syst. 55(1): 110-135 (2014) - [c11]Harald Räcke, Chintan Shah, Hanjo Täubig:
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. SODA 2014: 227-238 - 2013
- [j4]Hanjo Täubig, Jeremias Weihmann, Sven Kosub
Inequalities for the Number of Walks in Graphs. Algorithmica 66(4): 804-828 (2013) - 2012
- [c10]Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann:
Inequalities for the Number of Walks in Graphs. ANALCO 2012: 26-39 - 2010
- [c9]Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. LATIN 2010: 294-305
2000 – 2009
- 2009
- [c8]Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. PODC 2009: 131-140 - [c7]Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid
Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. SSS 2009: 781-782 - 2008
- [j3]Stefan Eckhardt, Sven Kosub
Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407(1-3): 1-20 (2008) - 2007
- [b1]Hanjo Täubig:
Fast Structure Searching for Computational Proteomics (Schnelle Struktursuche für computer-basierte Proteomforschung). Technical University of Munich, Germany, 2007 - 2006
- [j2]Klaus Holzapfel, Sven Kosub
The complexity of detecting fixed-density clusters. Discret. Appl. Math. 154(11): 1547-1562 (2006) - [j1]Hanjo Täubig, Arno Buchner
PAST: fast structure-based searching in the PDB. Nucleic Acids Res. 34(Web-Server-Issue): 20-23 (2006) - [c6]Sven Kosub
Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111 - 2005
- [c5]Stefan Eckhardt, Sven Kosub
Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109 - 2004
- [c4]Frank Kammer, Hanjo Täubig:
Connectivity. Network Analysis 2004: 143-177 - [c3]Hanjo Täubig, Arno Buchner, Jan Griebsch:
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB. German Conference on Bioinformatics 2004: 65-74 - 2003
- [c2]Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212 - [c1]Alexander Hall, Hanjo Täubig:
Comparing Push- and Pull-Based Broadcasting. WEA 2003: 148-164
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 21:41 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: