The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "René van Bevern" ( http://dblp.L3S.de/Authors/René_van_Bevern )

  Author page on DBLP  Author page in RDF  Community of René van Bevern in ASPL-2

Publication years (Num. hits)
2009-2013 (18) 2014-2015 (23) 2016-2017 (21) 2018-2019 (11)
Publication types (Num. hits)
article(46) inproceedings(25) phdthesis(1) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 74 publication records. Showing 73 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Matthias Bentert, René van Bevern, Rolf Niedermeier Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. Search on Bibsonomy J. Scheduling The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. Search on Bibsonomy MOTOR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René van Bevern, Gregory Kucherov (eds.) Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. Search on Bibsonomy CIAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, René van Bevern Parameterized complexity of machine scheduling: 15 open problems. Search on Bibsonomy Computers & OR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1René van Bevern, Vincent Froese, Christian Komusiewicz Parameterizing Edge Modification Problems Above Lower Bounds. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko On (1+ε)-approximate problem kernels for the Rural Postman Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko Parameterized algorithms and data reduction for safe convoy routing. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche Facility location under matroid constraints: fixed-parameter algorithms and applications. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  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
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko Parameterized Algorithms and Data Reduction for Safe Convoy Routing. Search on Bibsonomy ATMOS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, René van Bevern, Rolf Niedermeier (Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Matthias Mnich, René van Bevern Parameterized complexity of machine scheduling: 15 open problems. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý Fixed-parameter algorithms for DAG Partitioning. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1René van Bevern, Rolf Niedermeier, Ondrej Suchý A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. Search on Bibsonomy J. Scheduling The full citation details ... 2017 DBLP  DOI  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
1René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Partitioning Perfect Graphs into Stars. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. Search on Bibsonomy ALGOSENSORS The full citation details ... 2017 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 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
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
1René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý Fixed-Parameter Algorithms for DAG Partitioning. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Artem V. Pyatkin Completing partial schedules for Open Shop with unit processing times and routing. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger Precedence-constrained scheduling problems parameterized by partial order width. 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
1René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. Search on Bibsonomy DOOR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Vincent Froese, Christian Komusiewicz Parameterizing Edge Modification Problems Above Lower Bounds. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Artem V. Pyatkin Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  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
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
1René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger Approximability and parameterized complexity of multicover by c-intervals. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Network-Based Vertex Dissolution. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond Myhill-Nerode Methods for Hypergraphs. Search on Bibsonomy Algorithmica 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, Vincent Froese, Christian Komusiewicz Parameterizing edge modification problems above lower bounds. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Rolf Niedermeier, Ondrej Suchý A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. 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
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval scheduling and colorful independent sets. Search on Bibsonomy J. Scheduling 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
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
1René van Bevern Towards Optimal and Expressive Kernelization for d-Hitting Set. Search on Bibsonomy Algorithmica 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
1René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Network-Based Dissolution. 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
1René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Star Partitions of Perfect Graphs. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval scheduling and colorful independent sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Star Partitions of Perfect Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger Network-Based Dissolution. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René van Bevern Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications. Search on Bibsonomy 2014   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
1René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond Myhill-Nerode Methods for Hypergraphs. 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
1René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý Parameterized Complexity of DAG Partitioning. Search on Bibsonomy CIAC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1René van Bevern, Hannes Moser, Rolf Niedermeier Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2012 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
1René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval Scheduling and Colorful Independent Sets. Search on Bibsonomy ISAAC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1René van Bevern Towards Optimal and Expressive Kernelization for d-Hitting Set. Search on Bibsonomy COCOON The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1René van Bevern Towards Optimal and Expressive Kernelization for d-Hitting Set 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
1René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier Measuring Indifference: Unit Interval Vertex Deletion. Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1René van Bevern, Hannes Moser, Rolf Niedermeier Kernelization through Tidying. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1René van Bevern Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
Displaying result #1 - #73 of 73 (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