The following pages link to René van Bevern (Q247179):
Displaying 50 items.
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem (Q2181766) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints (Q2294041) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems (Q2849932) (← links)
- On the Parameterized Complexity of Computing Graph Bisections (Q2864292) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Towards Optimal and Expressive Kernelization for d-Hitting Set (Q2914317) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
- A New View on Rural Postman Based on Eulerian Extension and Matching (Q3111660) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- Kernelization through Tidying (Q3557047) (← links)
- h-Index Manipulation by Undoing Merges (Q4576225) (← links)
- (Q4634388) (← links)
- Parameterized Complexity of DAG Partitioning (Q4924637) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- (Q5271449) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments (Q6262800) (← links)
