generated by bibbase.org
  2024 (2)
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number. van Bevern, R., & Skachkov, D. A. Operations Research Letters, 52: 107065. 2024.
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number [link] preprint   doi   link   bibtex   1 download  
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. van Bevern, R., Kirilin, A. M., Skachkov, D. A., Smirnov, P. V., & Tsidulko, O. Journal of Computer and System Sciences, 139: 103479. 2024.
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU [link] preprint   doi   link   bibtex  
  2023 (2)
On data reduction for dynamic vector bin packing. van Bevern, R., Melnikov, A., Smirnov, P., & Tsidulko, O. Operations Research Letters, 51: 446-452. 2023.
On data reduction for dynamic vector bin packing [link] preprint   doi   link   bibtex   1 download  
Polynomial-time data reduction for weighted problems beyond additive goal functions. Bentert, M., van Bevern, R., Fluschnik, T., Nichterlein, A., & Niedermeier, R. Discrete Applied Mathematics, 328: 117–133. March 2023.
Polynomial-time data reduction for weighted problems beyond additive goal functions [link] preprint   doi   link   bibtex  
  2022 (1)
Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments. Bentert, M., van Bevern, R., Nichterlein, A., Niedermeier, R., & Smirnov, P. V. INFORMS Journal on Computing, 34(1): 55–75. 2022.
Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments [link] code   Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments [link] slides   Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments [link] preprint   doi   link   bibtex   abstract  
  2021 (3)
Special Issue on Computer Science Symposium in Russia (2019). van Bevern, R., & Kucherov, G. Theory of Computing Systems, 65(3): 441–443. April 2021.
doi   link   bibtex   4 downloads  
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable. Afanasev, V. A., van Bevern, R., & Tsidulko, O. Operations Research Letters, 49(2): 270–277. 2021.
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable [link] preprint   The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable [link] poster   The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable [link] slides   doi   link   bibtex   abstract   1 download  
Representative families for matroid intersections, with applications to location, packing, and covering problems. van Bevern, R., Tsidulko, O., & Zschoche, P. Discrete Applied Mathematics, 298: 110-128. 2021.
Representative families for matroid intersections, with applications to location, packing, and covering problems [link] preprint   Representative families for matroid intersections, with applications to location, packing, and covering problems [link] slides   doi   link   bibtex   abstract   6 downloads  
  2020 (5)
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem. van Bevern, R., & Slugina, V. A. Historia Mathematica, 53: 118-127. 2020.
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem [link] preprint   A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem [link] poster   A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem [link] slides   doi   link   bibtex   abstract   9 downloads  
H-Index Manipulation by Undoing Merges. van Bevern, R., Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M., & Walsh, T. Quantitative Science Studies, 1(4): 1529–1552. 2020.
H-Index Manipulation by Undoing Merges [link] preprint   H-Index Manipulation by Undoing Merges [link] code   H-Index Manipulation by Undoing Merges [link] poster   doi   link   bibtex   abstract   4 downloads  
On approximate data reduction for the Rural Postman Problem: Theory and experiments. van Bevern, R., Fluschnik, T., & Tsidulko, O. Networks, 76(4): 485-508. 2020.
On approximate data reduction for the Rural Postman Problem: Theory and experiments [link] preprint   On approximate data reduction for the Rural Postman Problem: Theory and experiments [link] poster   On approximate data reduction for the Rural Postman Problem: Theory and experiments [link] slides   On approximate data reduction for the Rural Postman Problem: Theory and experiments [link] code   doi   link   bibtex   abstract   6 downloads  
Optimal-size problem kernels for $d$-Hitting Set in linear time and space. van Bevern, R., & Smirnov, P. V. Information Processing Letters,105998. 2020.
Optimal-size problem kernels for $d$-Hitting Set in linear time and space [link] preprint   Optimal-size problem kernels for $d$-Hitting Set in linear time and space [link] code   Optimal-size problem kernels for $d$-Hitting Set in linear time and space [link] poster   doi   link   bibtex   abstract   6 downloads  
Parameterized algorithms and data reduction for the short secluded $s$-$t$-path problem. van Bevern, R., Fluschnik, T., & Tsidulko, O. Networks, 75(1): 34-63. 2020.
Parameterized algorithms and data reduction for the short secluded $s$-$t$-path problem [link] preprint   doi   link   bibtex   abstract   1 download  
  2019 (5)
CSR 2019. van Bevern, R., & Kucherov, G., editors. Volume 11532, of Lecture Notes in Computer Science.Springer. 2019.
doi   link   bibtex   1 download  
Inductive $k$-independent graphs and $c$-colorable subgraphs in scheduling: A review. Bentert, M., van Bevern, R., & Niedermeier, R. Journal of Scheduling, 22(1): 3–20. 2019.
Inductive $k$-independent graphs and $c$-colorable subgraphs in scheduling: A review [link] preprint   Inductive $k$-independent graphs and $c$-colorable subgraphs in scheduling: A review [link] poster   doi   link   bibtex   abstract  
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times. van Bevern, R. A., Pyatkin, A. V., & Sevastyanov, S. V. Siberian Electronic Mathematical Reports, 16: 42–84. 2019.
doi   link   bibtex   abstract   2 downloads  
On $(1+ɛ)$-approximate data reduction for the Rural Postman Problem. van Bevern, R., Fluschnik, T., & Tsidulko, O. In Khachay, M., Kochetov, Y., & Pardalos, P., editor(s), MOTOR 2019, volume 11548, of Lecture Notes in Computer Science, pages 279–294. Springer, 2019.
On $(1+ɛ)$-approximate data reduction for the Rural Postman Problem [link] preprint   On $(1+ɛ)$-approximate data reduction for the Rural Postman Problem [link] slides   doi   link   bibtex   abstract  
Fixed-parameter algorithms for maximum-profit facility location under matroid constraints. van Bevern, R., Tsidulko, O., & Zschoche, P. In Heggernes, P., editor(s), CIAC 2019, volume 11485, of Lecture Notes in Computer Science, pages 62–74. Springer, 2019.
doi   link   bibtex   abstract   2 downloads  
  2018 (4)
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. Discrete Optimzation, 30: 20–50. 2018.
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs [link] preprint   doi   link   bibtex   abstract  
Parameterized algorithms and data reduction for safe convoy routing. van Bevern, R., Fluschnik, T., & Tsidulko, O. In Borndörfer, R., & Storandt, S., editor(s), ATMOS 2018, volume 65, of OpenAccess Series in Informatics (OASIcs), pages 10:1–10:19. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.
doi   link   bibtex   abstract  
Parameterized complexity of machine scheduling: 15 open problems. Mnich, M., & van Bevern, R. Computers & Operations Research, 100: 254–261. 2018.
Parameterized complexity of machine scheduling: 15 open problems [link] preprint   Parameterized complexity of machine scheduling: 15 open problems [link] slides   doi   link   bibtex   abstract   2 downloads  
Parameterizing edge modification problems above lower bounds. van Bevern, R., Froese, V., & Komusiewicz, C. Theory of Computing Systems, 62(3): 739–770. 2018.
Parameterizing edge modification problems above lower bounds [link] preprint   Parameterizing edge modification problems above lower bounds [pdf] slides   doi   link   bibtex   abstract   3 downloads  
  2017 (6)
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. Bentert, M., van Bevern, R., Nichterlein, A., & Niedermeier, R. In Anta, A. F., Jurdzinski, T., Mosteiro, M. A., & Zhang, Y., editor(s), ALGOSENSORS 2017, volume 10718, of Lecture Notes in Computer Science, pages 26–40. Springer, 2017.
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks [link] slides   doi   link   bibtex   abstract  
A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments. van Bevern, R., Komusiewicz, C., & Sorge, M. Networks, 70(3): 262–278. 2017.
A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments [link] preprint   A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments [pdf] slides   A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments [link] code   doi   link   bibtex   abstract  
Finding Secluded Places of Special Interest in Graphs. van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. In Guo, J., & Hermelin, D., editor(s), IPEC 2016, volume 63, of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1–5:16. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017.
doi   link   bibtex   abstract  
Partitioning perfect graphs into stars. van Bevern, R., Bredereck, R., Bulteau, L., Chen, J., Froese, V., Niedermeier, R., & Woeginger, G. J. Journal of Graph Theory, 85(2): 297–335. 2017.
Partitioning perfect graphs into stars [link] preprint   doi   link   bibtex   abstract  
Fixed-parameter algorithms for DAG Partitioning. van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A., & Suchý, O. Discrete Applied Mathematics, 220: 134–160. 2017.
Fixed-parameter algorithms for DAG Partitioning [link] preprint   Fixed-parameter algorithms for DAG Partitioning [link] code   doi   link   bibtex   abstract  
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. van Bevern, R., Niedermeier, R., & Suchý, O. Journal of Scheduling, 20(3): 255–265. 2017.
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack [link] preprint   A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack [pdf] slides   doi   link   bibtex   abstract   1 download  
  2016 (7)
Twins in Subdivision Drawings of Hypergraphs. van Bevern, R., Kanj, I., Komusiewicz, C., Niedermeier, R., & Sorge, M. In Hu, Y., & Nöllenburg, M., editor(s), GD 2016, volume 9801, of Lecture Notes in Computer Science, pages 67–80. Springer, 2016.
Twins in Subdivision Drawings of Hypergraphs [link] preprint   doi   link   bibtex   abstract  
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. van Bevern, R., Komusiewicz, C., Niedermeier, R., Sorge, M., & Walsh, T. Artificial Intelligence, 240: 19–35. 2016.
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments [link] preprint   H-Index Manipulation by Merging Articles: Models, Theory, and Experiments [link] code   doi   link   bibtex   abstract  
Precedence-constrained scheduling problems parameterized by partial order width. van Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., & Woeginger, G. J. In Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., & Pardalos, P., editor(s), DOOR 2016, volume 9869, of Lecture Notes in Computer Science, pages 105-120. Springer, 2016.
Precedence-constrained scheduling problems parameterized by partial order width [link] preprint   Precedence-constrained scheduling problems parameterized by partial order width [pdf] slides   doi   link   bibtex   abstract   1 download  
H-Index Manipulation by Undoing Merges. van Bevern, R., Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M., & Walsh, T. In Kaminka, G. A., Fox, M., Bouquet, P., Hüllermeier, E., Dignum, V., Dignum, F., & van Harmelen, F., editor(s), ECAI 2016, volume 285, of Frontiers in Artificial Intelligence and Applications, pages 895–903. IOS Press, 2016.
doi   link   bibtex   abstract  
Parameterizing edge modification problems above lower bounds. van Bevern, R., Froese, V., & Komusiewicz, C. In Kulikov, A. S., & Woeginger, G. J., editor(s), CSR 2016, volume 9691, of Lecture Notes in Computer Science, pages 57-72. Springer, 2016.
Parameterizing edge modification problems above lower bounds [pdf] slides   doi   link   bibtex   abstract  
Completing partial schedules for Open Shop with unit processing times and routing. van Bevern, R., & Pyatkin, A. V. In Kulikov, A. S., & Woeginger, G. J., editor(s), CSR 2016, volume 9691, of Lecture Notes in Computer Science, pages 73-87. Springer, 2016.
Completing partial schedules for Open Shop with unit processing times and routing [pdf] slides   doi   link   bibtex   abstract  
Exploiting hidden structure in selecting dimensions that distinguish vectors. Froese, V., van Bevern, R., Niedermeier, R., & Sorge, M. Journal of Computer and System Sciences, 82(3): 521–535. 2016.
Exploiting hidden structure in selecting dimensions that distinguish vectors [link] preprint   doi   link   bibtex   abstract  
  2015 (8)
Approximability and parameterized complexity of multicover by $c$-intervals. van Bevern, R., Chen, J., Hüffner, F., Kratsch, S., Talmon, N., & Woeginger, G. J. Information Processing Letters, 115(10): 744–749. 2015.
Approximability and parameterized complexity of multicover by $c$-intervals [pdf] preprint   doi   link   bibtex   abstract  
Interval scheduling and colorful independent sets. van Bevern, R., Mnich, M., Niedermeier, R., & Weller, M. Journal of Scheduling, 18(5): 449-469. 2015.
Interval scheduling and colorful independent sets [link] preprint   Interval scheduling and colorful independent sets [link] code   doi   link   bibtex   abstract   1 download  
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. van Bevern, R., Komusiewicz, C., & Sorge, M. In Italiano, G. F., & Schmidt, M., editor(s), ATMOS 2015, volume 48, of OpenAccess Series in Informatics (OASIcs), pages 130–143. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015.
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems [pdf] slides   Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems [link] code   doi   link   bibtex   abstract  
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. van Bevern, R., Feldmann, A. E., Sorge, M., & Suchý, O. Theory of Computing Systems, 57(1): 1-35. 2015.
On the Parameterized Complexity of Computing Balanced Partitions in Graphs [link] preprint   On the Parameterized Complexity of Computing Balanced Partitions in Graphs [pdf] slides   doi   link   bibtex   abstract  
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. van Bevern, R., Komusiewicz, C., Niedermeier, R., Sorge, M., & Walsh, T. In Yang, Q., & Wooldridge, M. J., editor(s), IJCAI 2015, pages 808–814. AAAI Press, 2015.
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments [link]Paper   link   bibtex   abstract  
Network-Based Vertex Dissolution. van Bevern, R., Bredereck, R., Chen, J., Froese, V., Niedermeier, R., & Woeginger, G. J. SIAM Journal on Discrete Mathematics, 29(2): 888-914. 2015.
Network-Based Vertex Dissolution [link] preprint   doi   link   bibtex   abstract  
Myhill-Nerode Methods for Hypergraphs. van Bevern, R., Downey, R. G., Fellows, M. R., Gaspers, S., & Rosamond, F. A. Algorithmica, 73(4): 696-729. 2015.
Myhill-Nerode Methods for Hypergraphs [link] preprint   Myhill-Nerode Methods for Hypergraphs [pdf] slides   doi   link   bibtex   abstract  
Complexity of arc routing problems. van Bevern, R., Niedermeier, R., Sorge, M., & Weller, M. In Corberán, Á., & Laporte, G., editor(s), Arc Routing, volume 20, of MOS-SIAM Series on Optimization, 2, pages 19–52. SIAM, February 2015.
doi   link   bibtex  
  2014 (4)
Towards Optimal and Expressive Kernelization for $d$-Hitting Set. van Bevern, R. Algorithmica, 70(1): 129-147. 2014.
Towards Optimal and Expressive Kernelization for $d$-Hitting Set [link] preprint   Towards Optimal and Expressive Kernelization for $d$-Hitting Set [pdf] slides   Towards Optimal and Expressive Kernelization for $d$-Hitting Set [link] code   doi   link   bibtex   abstract  
Network-Based Dissolution. van Bevern, R., Bredereck, R., Chen, J., Froese, V., Niedermeier, R., & Woeginger, G. J. In Csuhaj-Varjú, E., Dietzfelbinger, M., & Ésik, Z., editor(s), MFCS 2014, volume 8635, of Lecture Notes in Computer Science, pages 69-80. Springer, 2014.
doi   link   bibtex   abstract  
Star Partitions of Perfect Graphs. van Bevern, R., Bredereck, R., Bulteau, L., Chen, J., Froese, V., Niedermeier, R., & Woeginger, G. J. In Esparza, J., Fraigniaud, P., Husfeldt, T., & Koutsoupias, E., editor(s), ICALP 2014, volume 8572, of Lecture Notes in Computer Science, pages 174-185. Springer, 2014.
doi   link   bibtex   abstract  
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. van Bevern, R., Hartung, S., Nichterlein, A., & Sorge, M. Operations Research Letters, 42(4): 290-292. 2014.
Constant-factor approximations for Capacitated Arc Routing without triangle inequality [link] preprint   doi   link   bibtex   abstract  
  2013 (4)
Myhill-Nerode Methods for Hypergraphs. van Bevern, R., Fellows, M. R., Gaspers, S., & Rosamond, F. A. In Cai, L., Cheng, S., & Lam, T., editor(s), ISAAC 2013, volume 8283, of Lecture Notes in Computer Science, pages 372-382. Springer, 2013.
Myhill-Nerode Methods for Hypergraphs [pdf] slides   doi   link   bibtex   abstract  
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. Froese, V., van Bevern, R., Niedermeier, R., & Sorge, M. In Chatterjee, K., & Sgall, J., editor(s), MFCS 2013, volume 8087, of Lecture Notes in Computer Science, pages 445-456. Springer, 2013.
doi   link   bibtex   abstract  
On the Parameterized Complexity of Computing Graph Bisections. van Bevern, R., Feldmann, A. E., Sorge, M., & Suchý, O. In Brandstädt, A., Jansen, K., & Reischuk, R., editor(s), WG 2013, volume 8165, of Lecture Notes in Computer Science, pages 76-87. Springer, 2013.
On the Parameterized Complexity of Computing Graph Bisections [pdf] slides   doi   link   bibtex   abstract  
Parameterized Complexity of DAG Partitioning. van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A., & Suchý, O. In Spirakis, P. G., & Serna, M., editor(s), CIAC 2013, volume 7878, of Lecture Notes in Computer Science, pages 49-60. Springer, 2013.
doi   link   bibtex   abstract  
  2012 (5)
Interval Scheduling and Colorful Independent Sets. van Bevern, R., Mnich, M., Niedermeier, R., & Weller, M. In Chao, K., Hsu, T., & Lee, D., editor(s), ISAAC 2012, volume 7676, of Lecture Notes in Computer Science, pages 247–256. Springer, 2012.
doi   link   bibtex   abstract   1 download  
A new view on Rural Postman based on Eulerian Extension and Matching. Sorge, M., van Bevern, R., Niedermeier, R., & Weller, M. Journal of Discrete Algorithms, 16: 12–33. 2012.
A new view on Rural Postman based on Eulerian Extension and Matching [pdf] preprint   doi   link   bibtex   abstract  
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. van Bevern, R., Hartung, S., Kammer, F., Niedermeier, R., & Weller, M. In Marx, D., & Rossmanith, P., editor(s), IPEC 2011, volume 7112, of Lecture Notes in Computer Science, pages 194–206. Springer, 2012.
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs [pdf] preprint   Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs [pdf] slides   doi   link   bibtex   abstract  
Towards Optimal and Expressive Kernelization for $d$-Hitting Set. van Bevern, R. In Gudmundsson, J., Mestre, J., & Viglas, T., editor(s), COCOON 2012, volume 7434, of Lecture Notes in Computer Science, pages 121-132. Springer, 2012.
Towards Optimal and Expressive Kernelization for $d$-Hitting Set [pdf] slides   doi   link   bibtex   abstract  
Approximation and Tidying—A Problem Kernel for $s$-Plex Cluster Vertex Deletion. van Bevern, R., Moser, H., & Niedermeier, R. Algorithmica, 62(3-4): 930-950. 2012.
Approximation and Tidying—A Problem Kernel for $s$-Plex Cluster Vertex Deletion [pdf] preprint   Approximation and Tidying—A Problem Kernel for $s$-Plex Cluster Vertex Deletion [pdf] slides   doi   link   bibtex   abstract  
  2011 (2)
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. Betzler, N., van Bevern, R., Fellows, M. R., Komusiewicz, C., & Niedermeier, R. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5): 1296-1308. 2011.
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks [pdf] preprint   Parameterized Algorithmics for Finding Connected Motifs in Biological Networks [link] code   doi   link   bibtex   abstract  
From Few Components to an Eulerian Graph by Adding Arcs. Sorge, M., van Bevern, R., Niedermeier, R., & Weller, M. In Kolman, P., & Kratochvíl, J., editor(s), WG 2011, volume 6986, of Lecture Notes in Computer Science, pages 307–318. Springer, 2011.
From Few Components to an Eulerian Graph by Adding Arcs [pdf] preprint   doi   link   bibtex   abstract   1 download  
  2010 (2)
Measuring Indifference: Unit Interval Vertex Deletion. van Bevern, R., Komusiewicz, C., Moser, H., & Niedermeier, R. In Thilikos, D. M., editor(s), WG 2010, volume 6410, of Lecture Notes in Computer Science, pages 232–243. Springer, 2010.
Measuring Indifference: Unit Interval Vertex Deletion [pdf] preprint   Measuring Indifference: Unit Interval Vertex Deletion [pdf] slides   doi   link   bibtex   abstract  
Kernelization through Tidying—A Case Study Based on $s$-Plex Cluster Vertex Deletion. van Bevern, R., Moser, H., & Niedermeier, R. In López-Ortiz, A., editor(s), LATIN 2010, volume 6034, of Lecture Notes in Computer Science, pages 527-538. Springer, 2010.
Kernelization through Tidying—A Case Study Based on $s$-Plex Cluster Vertex Deletion [pdf] slides   doi   link   bibtex   abstract