• Postal addressShow on map

    PO Box 513, Department of Mathematics and Computer Science

    5600 MB Eindhoven

    Netherlands

  • AddressShow on map

    Groene Loper 5, MetaForum

    5612 AP Eindhoven

    Netherlands

Filter
Conference contribution

Search results

  • 2024

    Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

    Kowalik, Ł., Lassota, A., Majewski, K., Pilipczuk, M. & Sokołowski, M., 2024, Cover Image 2024 Symposium on Simplicity in Algorithms (SOSA). Society for Industrial and Applied Mathematics (SIAM), p. 279-285

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Parameterized algorithms for block-structured integer programs with large entries

    Cslovjecsek, J., Koutecký, M., Lassota, A., Pilipczuk, M. & Polak, A., 2024, SODA. SIAM Press, p. 740-751 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Stable and Dynamic Minimum Cuts

    de Berg, M., López Martínez, A. & Spieksma, F., 2024, WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Proceedings. Uehara, R., Yamanaka, K. & Yen, H.-C. (eds.). Springer, p. 273-287 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14549 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Tight Lower Bounds for Block-Structured Integer Programs

    Hunkenschröder, C., Klein, K.-M., Koutecký, M., Lassota, A. & Levin, A., 2024, IPCO. Springer, p. 224-237 14 p. (Lecture Notes in Computer Science; vol. 14679).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • 2023

    Finding Diverse Minimum s-t Cuts

    de Berg, M. T., López Martínez, A. & Spieksma, F. C. R., 2023, Proceedings 34th International Symposium on Algorithms and Computation. p. 24:1-24:17 17 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Handling Symmetries in Mixed-Integer Semidefinite Programs

    Hojny, C. & Pfetsch, M. E., 2023, Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 20th International Conference, CPAIOR 2023, Nice, France, May 29 - June 1, 2023. Cire, A. A. (ed.). p. 69-78 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13884 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • Stabilization of Capacitated Matching Games

    Verberk, L. P. A., Sanità, L. & Gerstbrein, M., 22 May 2023, Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings. Del Pia, A. & Kaibel, V. (eds.). p. 157-171 15 p. (Lecture Notes in Computer Science; vol. 13904).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
  • Stable Approximation Algorithms for Dominating Set and Independent Set.

    Berg, M. D., Sadhukhan, A. & Spieksma, F. C. R., Sept 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). p. 27:1-27:19 19 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 275).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • The Role of the Alphabet in Network Coding: An Optimization Approach

    Hojny, C., Kiliç, A. B. & Ravagnani, A., 2023, 2023 IEEE Information Theory Workshop, ITW 2023. Institute of Electrical and Electronics Engineers, p. 526-531 6 p. 10161662

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • 2022

    A Simple Method for Convex Optimization in the Oracle Model

    Dadush, D., Hojny, C., Huiberts, S. & Weltge, S., 2022, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings: 23rd International Conference, IPCO 2022 Eindhoven, The Netherlands, June 27-29,2022 Proceedings. Aardal, K. & Sanità, L. (eds.). p. 154-167 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13265 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)
  • Extending a conjecture of Graham and Lovász on the distance characteristic polynomial

    Abiad Monge, A., Brimkov, B., Hayat, S., Khramova, T. & Koolen, J. H., 2022, Discrete Mathematics Days 2022. Tabera Alonso, L. (ed.). Editorial Universidad de Cantabria: Santander, p. 11-16

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Integer Programming Formulations for Compact Single Round Robin Tournaments

    van Doornmalen, M. J., Spieksma, F. C. R., Hojny, C. & Lambers, R., 2022, Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2022.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
  • Isolation Schemes for Problems on Decomposable Graphs.

    Nederlof, J., Pilipczuk, M., Swennenhuis, C. M. F. & Wegrzycki, K., 1 Mar 2022, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022. Berenbrink, P. & Monmege, B. (eds.). p. 50:1-50:20 20 p. 50. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 219).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
  • Package Delivery Using Drones with Restricted Movement Areas

    Erlebach, T., Luo, K. & Spieksma, F. C. R., 1 Dec 2022, 33rd International Symposium on Algorithms and Computation, ISAAC 2022. Bae, S. W. & Park, H. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 248).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Package Delivery Using Drones with Restricted Movement Areas.

    Erlebach, T., Luo, K. & Spieksma, F. C. R., 1 Dec 2022, 33rd International Symposium on Algorithms and Computation, ISAAC 2022. Bae, S. W. & Park, H. (eds.). p. 49:1-49:16 16 p. 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 248).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space.

    Bodlaender, H. L., Groenland, C., Nederlof, J. & Swennenhuis, C. M. F., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. p. 193-204 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    11 Citations (Scopus)
  • Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem.

    Berg, M. D., Sadhukhan, A. & Spieksma, F. C. R., 1 Jun 2022, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022. Czumaj, A. & Xin, Q. (eds.). p. 15:1-15:21 21 p. 15. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 227).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • 2021

    A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.

    Nederlof, J., Pawlewicz, J., Swennenhuis, C. M. F. & Wegrzycki, K., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). p. 1682-1701 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    6 Citations (Scopus)
  • A Hybrid Model to Find Schedules for Double Round Robin Tournaments With Side Constraints

    van Doornmalen, M. J., Hojny, C., Lambers, R. & Spieksma, F. C. R., 2021, Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021. de Causmaecker, P., Özcan, E. & Vanden Berghe, G. (eds.). p. 412-419

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
  • Computational Aspects of Relaxation Complexity

    Averkov, G., Hojny, C. & Schymura, M., 2021, Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Proceedings. Singh, M. & Williamson, D. P. (eds.). p. 368-382 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12707 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • Improved approximations for min sum vertex cover and generalized min sum set cover

    Bansal, N., Batra, J., Farhadi, M. & Tetali, P., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, Inc, p. 986-1005 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    10 Citations (Scopus)
  • Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors

    Nederlof, J. & Wegrzycki, K., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). p. 1670-1683 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    9 Citations (Scopus)
  • K-forrelation optimally separates Quantum and classical query complexity

    Bansal, N. & Sinha, M., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, Inc, p. 1303-1316 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    16 Citations (Scopus)
  • Minimum scan cover and variants - Theory and experiments

    Buchin, K., Fekete, S. P., Hill, A., Kleist, L., Kostitsyna, I., Krupke, D., Lambers, R. & Struijs, M., 1 Jun 2021, 19th International Symposium on Experimental Algorithms, SEA 2021. Coudert, D. & Natale, E. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 190).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Non-uniform geometric set cover and scheduling on multiple machines

    Bansal, N. & Batra, J., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, Inc, p. 3011-3021 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
  • Online Bin Packing with Overload Cost

    Luo, K. & Spieksma, F. C. R., 2021, Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings. Mudgal, A. & Subramanian, C. R. (eds.). Springer, p. 3-15 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12601 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
  • Online discrepancy minimization for stochastic arrivals

    Bansal, N., Jiang, H., Meka, R., Singla, S. & Sinha, M., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, Inc, p. 2842-2861 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    11 Citations (Scopus)
  • On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.

    Mannens, I., Nederlof, J., Swennenhuis, C. M. F. & Szilágyi, K., 2021, Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Revised Selected Papers. Kowalik, L., Pilipczuk, M. & Rzazewski, P. (eds.). p. 52-79 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12911 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
  • Parameterized Complexities of Dominating and Independent Set Reconfiguration.

    Bodlaender, H. L., Groenland, C. & Swennenhuis, C. M. F., 1 Nov 2021, 16th International Symposium on Parameterized and Exact Computation, IPEC 2021. Golovach, P. A. & Zehavi, M. (eds.). p. 9:1-9:16 16 p. 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 214).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    8 Citations (Scopus)
  • The Traveling Social Golfer Problem: The Case of the Volleyball Nations League

    Lambers, R., Rothuizen, L. & Spieksma, F. C. R., 2021, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 18th International Conference, CPAIOR 2021, Proceedings. Stuckey, P. J. (ed.). Springer, p. 149-162 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12735 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)
  • To Close Is Easier Than To Open: Dual Parameterization To k-Median.

    Byrka, J., Dudycz, S., Manurangsi, P., Marcinkowski, J. & Wlodarczyk, M., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (eds.). Springer, p. 113-126 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12806 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • 2020

    Approximation Algorithms for Car-Sharing Problems

    Luo, K. & Spieksma, F. C. R., 2020, Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). Springer, p. 262-273 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12273 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)
  • Detecting feedback vertex sets of size K in O*(2.7k) time

    Li, J. & Nederlof, J., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, Inc, p. 971-989 19 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

    Nederlof, J., Pilipczuk, M., Swennenhuis, C. M. F. & Wegrzycki, K., 2020, Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers. Adler, I. & Müller, H. (eds.). Springer, p. 27-39 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12301 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    13 Citations (Scopus)
  • On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.

    Nederlof, J. & Swennenhuis, C. M. F., Dec 2020, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Cao, Y. & Pilipczuk, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 25:1-25:17 25. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 180).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • 2019

    Equal-subset-sum faster than the meet-in-the-middle

    Mucha, M., Nederlof, J., Pawlewicz, J. & Węgrzycki, K., Sept 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 73. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    12 Citations (Scopus)
    38 Downloads (Pure)
  • Hamiltonicity below Dirac’s condition

    Jansen, B. M. P., Kozma, L. & Nederlof, J., 12 Sept 2019, Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. Sau, I. & Thilikos, D. M. (eds.). Cham: Springer, p. 27-39 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11789 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    12 Citations (Scopus)
  • Nearly ETH-tight algorithms for planar Steiner Tree with terminals on few faces

    Kisfaludi-Bak, S., Nederlof, J. & van Leeuwen, E. J., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). New York: Association for Computing Machinery, Inc, p. 1015-1034 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    4 Citations (Scopus)
  • On a generalization of iterated and randomized rounding

    Bansal, N., 23 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). New York: Association for Computing Machinery, Inc, p. 1125-1135 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    15 Citations (Scopus)
  • On geometric set cover for orthants

    Bringmann, K., Kisfaludi-Bak, S., Pilipczuk, M. & van Leeuwen, E. J., 1 Sept 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18 p. 26. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 144).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    6 Citations (Scopus)
    105 Downloads (Pure)
  • On the discrepancy of random low degree set systems

    Bansal, N. & Meka, R., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). New York: Association for Computing Machinery, Inc, p. 2557-2564 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    7 Citations (Scopus)
  • Revenue maximization in an optical router node using multiple wavelengths

    Abidini, M. A., Boxma, O., Hurkens, C., Koonen, T. & Resing, J., 12 Mar 2019, Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2019. Association for Computing Machinery, Inc, p. 47-53 7 p. (ACM International Conference Proceeding Series).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • 2018

    A tight lower bound for counting Hamiltonian cycles via matrix rank

    Curticapean, R., Lindzey, N. & Nederlof, J., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). New York: Association for Computing Machinery, Inc, p. 1080-1099 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    20 Citations (Scopus)
  • Competitive algorithms for generalized k-server in uniform metrics

    Bansal, N., Elias, M., Koumoutsos, G. & Nederlof, J., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics (SIAM), p. 992-1001 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    10 Citations (Scopus)
    112 Downloads (Pure)
  • Computing the chromatic number using graph decompositions via matrix rank

    Jansen, B. M. P. & Nederlof, J., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 47. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 112).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    2 Citations (Scopus)
    220 Downloads (Pure)
  • More consequences of falsifying SETH and the orthogonal vectors conjecture

    Abboud, A., Dell, H., Bringmann, K. & Nederlof, J., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). New York: Association for Computing Machinery, Inc, p. 253-266 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    23 Citations (Scopus)
  • Nested convex bodies are chaseable

    Bansal, N., Bohm, M., Elias, M., Koumoutsos, G. & Umboh, S. W., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). s.l.: Society for Industrial and Applied Mathematics (SIAM), p. 1253-1260 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    23 Citations (Scopus)
    148 Downloads (Pure)
  • On Directed Feedback Vertex Set Parameterized by Treewidth.

    Bonamy, M., Kowalik, Ł., Nederlof, J., Pilipczuk, M., Socała, A. & Wrochna, M., 2018, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings. Brandstädt, A., Köhler, E. & Meer, K. (eds.). Springer, p. 65-78 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11159 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    14 Citations (Scopus)
  • Packing sporadic real-time tasks on identical multiprocessor systems

    Chen, J. J., Bansal, N., Chakraborty, S. & Von Der Brüggen, G., 1 Dec 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Hsu, W.-L., Lee, D.-T. & Liao, C.-S. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 14 p. 71. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 123).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    40 Downloads (Pure)
  • Partitioning vectors into quadruples: Worst-case analysis of a matching-based algorithm

    Ficker, A. M. C., Erlebach, T., Mihalák, M. & Spieksma, F. C. R., 1 Dec 2018, Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. Hsu, W.-L., Lee, D.-T. & Liao, C.-S. (eds.). Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12 p. 45. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 123).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    48 Downloads (Pure)