Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Christian Komusiewicz

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hannes Moser

> Home > Persons > Christian Komusiewicz

Publications

2012
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/ol/SchaferKMN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/SchaferKMN12
Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5): 883-891 (2012)
2010
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/HuffnerKMN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/HuffnerKMN10
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010)
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/BevernKMN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/BevernKMN10
René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243
2009
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/BrugmannKM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/BrugmannKM09
Daniel Brügmann, Christian Komusiewicz, Hannes Moser:
On Generating Triangle-Free Graphs. Electron. Notes Discret. Math. 32: 51-58 (2009)
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KomusiewiczHMN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KomusiewiczHMN09
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)
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/HuffnerKMN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/HuffnerKMN09
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)
2008
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoa/HuffnerKMN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/HuffnerKMN08
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/HuffnerKMN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/HuffnerKMN08
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722
2007
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/KomusiewiczHMN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/KomusiewiczHMN07
Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150

a service of

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.