Christian Komusiewicz und Graphs Person-Info

( Ich bin Christian Komusiewicz)

(1 - 11 von 16

)

AGT Program

warwick.ac.uk

Room MS :10 – 16:35, Daniel Brügmann, Christian Komusiewicz and Hannes Moser Friedrich-Schiller-Universität Jena, On Generating Triangle-Free Graphs. 16:35 – 17:00, Kathie Cameron, Chinh Hoang and Benjamin Leveque Wilfrid Laurier University, Asteroids in rooted and directed path graphs.

Campus Event Calendar: Erik Jan Van Leeuwen ( in E )

domino.mpi-inf.mpg.de

Monopolar and 2-Subcolorable Graphs" by Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen (http://dx.doi.org LIPIcs.SWAT ), which appeared in SWAT and was selected for a ...

Algorithms and Data Structures: 14th International Symposium, WADS...

books.google.cz

... Victoria, BC, Canada, August 5-7, Proceedings Frank Dehne, Jörg- Rüdiger Sack, Ulrike Stege. Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes Falk Hüffner, Christian Komusiewicz, and André Nichterlein(B) Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, ...

Be sparse! Be dense! Be robust!: Elements of parameterized...

books.google.cz

[Kom+09] [Kom16] [Kos05] [Kra14] [KS03] [KS09] [KS11] [KS12] [KS15a] [KS15b] Christian Komusiewicz, Falk Hüffner, Hannes Moser, and Rolf Niedermeier. “ Isolation concepts for efficiently enumerating dense subgraphs.” In: Theoretical Computer Science –40 (2009), pp – (cit. on pp. 97,134, 137,

Christian Komusiewicz – ScienceOpen

www.science-open.com

Authors: René van Bevern, Christian Komusiewicz, Hendrik Molter … Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.

Theorietag Ilmenau

eiche.theoinf.tu-ilmenau.de

12:00 — 12:55 : Brötchen, Kaffee: 12:55 — 13:00 : Begrüßung: 13:00 — 13:30 : Christian Komusiewicz Editing Graphs into few Cliques: Complexity, Approximation

69. Workshop über Algorithmen und Komplexität (Theorietag) - PDF Free...

docplayer.net

3 Programm Donnerstag, :00 12:55 Brötchen, Kaffee 12:55 13:00 Begrüßung 13:00 13:30 Christian Komusiewicz Editing Graphs into few Cliques: Complexity, ...

ALGO Detailed Program

algo2015.upatras.gr

Towards Shortest Vertex-Disjoint Paths in Undirected Planar Graphs, Danny Hermelin, Moshe Kaspi, Christian Komusiewicz and Barak Navon. Parameterized ...

Kernelization algorithms for some link stream editing problems |...

www.fields.utoronto.ca

problem by adapting an algorithm for graphs (by Falk Hüffner, Christian Komusiewicz, and André Nichterlein). Further, we give ideas on how to similary adapt kernelization algorithms from graph problems to their link stream ...

Tomohiro Koana | PhD Student at TU Berlin

tomohirokoana.github.io

Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer. STACS | arXiv. A Refined Complexity Analysis of Fair Districting over Graphs.

WG Colloque international sur les concepts fondamentaux de...

www.univ-orleans.fr

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs; Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier ...

Alle Infos zum Namen "Christian Komusiewicz"

Verwandte Suchanfragen zu Christian Komusiewicz

André Nichterlein
Laurent Bulteau
Danny Hermelin

Hendrik Molter
Frank Sommer
Michael Fellows

Falk Hüffner
Iyad Kanj
Hannes Moser

Personen
Vorname "Christian" (95886)
Name "Komusiewicz" (5)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Impressum AGB Datenschutz

+1

Weltweit