The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Manuel Sorge" ( http://dblp.L3S.de/Authors/Manuel_Sorge )

  Author page on DBLP  Author page in RDF  Community of Manuel Sorge in ASPL-2

Publication years (Num. hits)
2009-2014 (21) 2015-2016 (26) 2017-2018 (25) 2019 (12)
Publication types (Num. hits)
article(52) inproceedings(31) phdthesis(1)
Venues (Conferences, Journals, ...)
CoRR(32) J. Comput. Syst. Sci.(4) ESA(3) IPEC(3) Algorithmica(2) CIAC(2) Discrete Applied Mathematics(2) ISAAC(2) ISCO(2) SEA(2) SOFSEM(2) WG(2) Acta Inf.(1) Artif. Intell.(1) ASONAM(1) ATMOS(1) More (+10 of total 37)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 85 publication records. Showing 84 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset Problem. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The parameterized complexity of the minimum shared edges problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The complexity of routing with collision avoidance. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shaohua Li, Marcin Pilipczuk, Manuel Sorge Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Jiehua Chen, Piotr Skowron, Manuel Sorge Matchings under Preferences: Strength of Stability and Trade-offs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge Packing directed circuits quarter-integrally. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Anne-Sophie Himmel, Clemens Hoffmann 0002, Pascal Kunz, Vincent Froese, Manuel Sorge Computational complexity aspects of point visibility graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the computational complexity of multilayer subgraph detection. Search on Bibsonomy Network Science The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Piotr Skowron, Manuel Sorge Matchings under Preferences: Strength of Stability and Trade-Offs. Search on Bibsonomy EC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge Packing Directed Circuits Quarter-Integrally. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Danny Hermelin, Manuel Sorge On Computing Centroids According to the p-Norms of Hamming Distance Vectors. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. Search on Bibsonomy CIAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jiehua Chen, Danny Hermelin, Manuel Sorge A Note on Clustering Aggregation. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Efficient Algorithms for Measuring the Funnel-likeness of DAGs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jiehua Chen, Danny Hermelin, Manuel Sorge On Computing Centroids According to the p-Norms of Hamming Distance Vectors. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge Matching algorithms for assigning orthologs after genome duplication events. Search on Bibsonomy Computational Biology and Chemistry The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Search on Bibsonomy Discrete Optimization The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý Cluster Editing in Multi-Layer and Temporal Graphs. Search on Bibsonomy ISAAC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion How Hard Is It to Satisfy (Almost) All Roommates?. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. Search on Bibsonomy ISCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Clemens Hoffmann 0002, Hendrik Molter, Manuel Sorge The Parameterized Complexity of Centrality Improvement in Networks. Search on Bibsonomy SOFSEM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion How hard is it to satisfy (almost) all roommates? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Anne-Sophie Himmel, Clemens Hoffmann 0002, Pascal Kunz, Vincent Froese, Manuel Sorge Algorithmic Aspects of Point Visibility Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The Complexity of Routing with Few Collisions. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Clemens Hoffmann 0002, Hendrik Molter, Manuel Sorge The Parameterized Complexity of Centrality Improvement in Networks. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý A Parameterized View on Multi-Layer Cluster Editing. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Manuel Sorge A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Search on Bibsonomy Networks The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Search on Bibsonomy Social Netw. Analys. Mining The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The Complexity of Routing with Few Collisions. Search on Bibsonomy FCT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the Computational Complexity of Multi-layer Subgraph Detection. Search on Bibsonomy CIAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuel Sorge Be sparse! Be dense! Be robust!: elements of parameterized algorithmics. Search on Bibsonomy 2017   RDF
1René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh H-index manipulation by merging articles: Models, theory, and experiments. Search on Bibsonomy Artif. Intell. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge Exploiting hidden structure in selecting dimensions that distinguish vectors. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Enumerating Maximal Cliques in Temporal Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh h-Index Manipulation by Undoing Merges. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the Computational Complexity of Multi-Layer Subgraph Detection. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Till Fluschnik, Manuel Sorge The Minimum Shared Edges Problem on Planar Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý Finding Secluded Places of Special Interest in Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh h-Index Manipulation by Undoing Merges. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Twins in Subdivision Drawings of Hypergraphs. Search on Bibsonomy Graph Drawing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Enumerating maximal cliques in temporal graphs. Search on Bibsonomy ASONAM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý Finding Secluded Places of Special Interest in Graphs. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Twins in Subdivision Drawings of Hypergraphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Manuel Sorge Approximation algorithms for mixed, windy, and capacitated arc routing problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Christian Komusiewicz, Manuel Sorge An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Manuel Sorge, Kolja Stahl Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. Search on Bibsonomy SEA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Manuel Sorge Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. Search on Bibsonomy ATMOS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, Manuel Sorge Finding Highly Connected Subgraphs. Search on Bibsonomy SOFSEM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem. Search on Bibsonomy FSTTCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. Search on Bibsonomy IJCAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Stefan Kratsch, Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller Exploiting a hypergraph model for finding Golomb rulers. Search on Bibsonomy Acta Inf. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh On Google Scholar H-Index Manipulation by Merging Articles. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Stefan Kratsch, Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset problem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Yann Disser, Stefan Kratsch, Manuel Sorge The Minimum Feasible Tileset Problem. Search on Bibsonomy WAOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Manuel Sorge A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. Search on Bibsonomy ISAAC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý On the Parameterized Complexity of Computing Graph Bisections. Search on Bibsonomy WG The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller A new view on Rural Postman based on Eulerian Extension and Matching. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hannes Moser, Rolf Niedermeier, Manuel Sorge Exact combinatorial algorithms and experiments for finding maximum k-plexes. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller Exploiting a Hypergraph Model for Finding Golomb Rulers. Search on Bibsonomy ISCO The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Manuel Sorge Finding Dense Subgraphs of Sparse Graphs. Search on Bibsonomy IPEC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manuel Sorge On Making Directed Graphs Eulerian Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller From Few Components to an Eulerian Graph by Adding Arcs. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller A New View on Rural Postman Based on Eulerian Extension and Matching. Search on Bibsonomy IWOCA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Manuel Sorge Algorithmic Aspects of Golomb Ruler Construction Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Hannes Moser, Rolf Niedermeier, Manuel Sorge Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. Search on Bibsonomy SEA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #84 of 84 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license