default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHannes Moser
Person information
- affiliation: University of Jena, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j15]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica 51(7): 449-471 (2014)- 2013
- [j14]Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65(3): 517-544 (2013) - [j13]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27(1): 75-94 (2013) - 2012
- [j12]René van Bevern, Hannes Moser, Rolf Niedermeier:
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica 62(3-4): 930-950 (2012) - [j11]Hannes Moser, Rolf Niedermeier, Manuel Sorge:
Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. 24(3): 347-373 (2012) - [j10]Alexander Schäfer, Christian Komusiewicz
, Hannes Moser, Rolf Niedermeier:
Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5): 883-891 (2012) - [c17]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO 2012: 368-379 - 2011
- [j9]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77(6): 1141-1158 (2011) - [j8]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. ACM Trans. Comput. Theory 2(2): 5:1-5:23 (2011) - 2010
- [b1]Hannes Moser:
Finding optimal solutions for covering and matching problems. Friedrich Schiller University of Jena, 2010, ISBN 978-3-86955-243-9, pp. 1-207 - [j7]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010) - [c16]Eric Berberich, Matthias Hagen, Benjamin Hiller, Hannes Moser:
Experiments. Algorithm Engineering 2010: 325-388 - [c15]René van Bevern, Hannes Moser, Rolf Niedermeier:
Kernelization through Tidying. LATIN 2010: 527-538 - [c14]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension. WG 2010: 100-111 - [c13]René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243
2000 – 2009
- 2009
- [j6]Hannes Moser, Somnath Sikdar:
The parameterized complexity of the induced matching problem. Discret. Appl. Math. 157(4): 715-727 (2009) - [j5]Daniel Brügmann, Christian Komusiewicz, Hannes Moser:
On Generating Triangle-Free Graphs. Electron. Notes Discret. Math. 32: 51-58 (2009) - [j4]Hannes Moser, Dimitrios M. Thilikos:
Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2): 181-190 (2009) - [j3]Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38-40): 3640-3654 (2009) - [j2]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. 410(52): 5384-5397 (2009) - [c12]Jiong Guo, Hannes Moser, Rolf Niedermeier:
Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80 - [c11]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330 - [c10]Hannes Moser:
A Problem Kernelization for Graph Packing. SOFSEM 2009: 401-412 - [c9]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420 - [c8]Hannes Moser, Rolf Niedermeier, Manuel Sorge:
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA 2009: 233-244 - [i1]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. CoRR abs/0902.2149 (2009) - 2008
- [c7]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416 - [c6]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722 - 2007
- [j1]Jiong Guo, Falk Hüffner, Hannes Moser:
Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102(2-3): 62-65 (2007) - [c5]Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150 - [c4]Hannes Moser, Somnath Sikdar:
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. FAW 2007: 325-336 - [c3]Hannes Moser, Venkatesh Raman, Somnath Sikdar:
The Parameterized Complexity of the Unique Coverage Problem. ISAAC 2007: 621-631 - 2006
- [c2]Hannes Moser, Dimitrios M. Thilikos:
Parameterized Complexity of Finding Regular Induced Subgraphs. ACiD 2006: 107-118 - 2005
- [c1]Hannes Moser:
System J - Konzeption und prototypische Umsetzung eines Praktikums zur Datenbanksystementwicklung. BTW Studierenden-Programm 2005: 29-31
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:55 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:
