default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSepp Hartung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j14]René van Bevern
, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017)- [j13]Nimrod Talmon, Sepp Hartung:
The complexity of degree anonymization by graph contractions. Inf. Comput. 256: 212-225 (2017) - 2016
- [j12]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering under the Maximum Norm. Algorithms 9(1): 17 (2016) - [j11]Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622: 90-110 (2016) - 2015
- [j10]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185: 79-92 (2015) - [j9]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243: 249-262 (2015) - [j8]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81(4): 766-782 (2015) - [j7]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. 19(1): 155-190 (2015) - [j6]Sepp Hartung, André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM J. Discret. Math. 29(4): 1931-1960 (2015) - [j5]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607: 16-34 (2015) - 2014
- [j4]Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50: 409-446 (2014) - [j3]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42(4): 290-292 (2014) - 2013
- [j2]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica 67(1): 89-110 (2013) - [j1]Sepp Hartung, Rolf Niedermeier:
Incremental list coloring of graphs, parameterized by conservation. Theor. Comput. Sci. 494: 86-98 (2013)
Conference and Workshop Papers
- 2015
- [c18]Sepp Hartung, Holger H. Hoos:
Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing. LION 2015: 43-58 - [c17]Sepp Hartung, Nimrod Talmon:
The Complexity of Degree Anonymization by Graph Contractions. TAMC 2015: 260-271 - 2014
- [c16]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - [c15]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. ISAAC 2014: 298-309 - [c14]Sepp Hartung, Clemens Hoffmann, André Nichterlein:
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. SEA 2014: 376-387 - 2013
- [c13]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c12]Sepp Hartung, André Nichterlein:
On the Parameterized and Approximation Hardness of Metric Dimension. CCC 2013: 266-276 - [c11]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) 2013: 594-606 - [c10]Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC 2013: 152-162 - [c9]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
On Structural Parameterizations for the 2-Club Problem. SOFSEM 2013: 233-243 - [c8]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On Explaining Integer Vectors by Few Homogenous Segments. WADS 2013: 207-218 - 2012
- [c7]Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012: 1292-1298 - [c6]Sepp Hartung, André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. CiE 2012: 283-292 - [c5]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. IPEC 2012: 231-241 - 2011
- [c4]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC 2011: 614-623 - [c3]René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller:
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC 2011: 194-206 - 2010
- [c2]Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010: 457-462 - [c1]Sepp Hartung, Rolf Niedermeier:
Incremental List Coloring of Graphs, Parameterized by Conservation. TAMC 2010: 258-270
Informal and Other Publications
- 2016
- [i6]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - 2015
- [i5]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. CoRR abs/1512.05693 (2015) - 2014
- [i4]Sepp Hartung, Clemens Hoffmann, André Nichterlein:
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. CoRR abs/1402.6239 (2014) - [i3]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR abs/1404.3660 (2014) - 2013
- [i2]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On Structural Parameterizations for the 2-Club Problem. CoRR abs/1305.3735 (2013) - 2012
- [i1]Sepp Hartung, André Nichterlein:
On the Parameterized and Approximation Hardness of Metric Dimension. CoRR abs/1211.1636 (2012)
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:52 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:
