Filter
Conference contribution

Search results

  • 2015

    Minimizing flow-time on unrelated machines

    Bansal, N. & Kulkarni, J., 2015, STOC 2015 : 47th Annual ACM Symposium on the Theory of Computing, Portland OR, USA, June 14-17, 2015. Servedio, R. A. & Rubinfeld, R. (eds.). New York NY: Association for Computing Machinery, Inc, p. 851-860

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

    11 Citations (Scopus)
  • Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms

    Sgall, J. & Woeginger, G., 2015, Approximation and Online Algorithms (12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers). Bampis, E. & Svensson, O. (eds.). Dordrecht: Springer, p. 236-247 (Lecture Notes in Computer Science; vol. 8952).

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

  • On the Lovász theta function for independent sets in sparse graphs

    Bansal, N., Gupta, A. & Guruganesh, G., 2015, 47th Annual ACM Symposium on the Theory of Computing (STOC'15, Portland OR, USA, June 14-17, 2015). Servedio, R. A. & Rubinfeld, R. (eds.). New York NY: Association for Computing Machinery, Inc, p. 193-200

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

    8 Citations (Scopus)
  • Subexponential time algorithms for finding small tree and path decompositions

    Bodlaender, H. L. & Nederlof, J., 2015, Algorithms - ESA 2015 (23rd Annual European Symposium, Patras, Greece, September 14-16, 2015). Bansal, N. & Finocchi, I. (eds.). Berlin: Springer, p. 179-190 (Lecture Notes in Computer Science; vol. 9294).

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

    6 Citations (Scopus)
  • 2014

    Another look at the shoelace TSP : the case of very old shoes

    Deineko, V. G. & Woeginger, G. J., 2014, Fun with Algorithms (7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings). Ferro, A., Luccio, F. & Widmayer, P. (eds.). Berlin: Springer, p. 125-136 (Lecture Notes in Computer Science; vol. 8496).

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

    1 Citation (Scopus)
    1 Downloads (Pure)
  • Approximating vector scheduling: almost matching upper and lower bounds

    Bansal, N., Vredeveld, T. & Zwaan, van der, G. R. J., 2014, LATIN 2014: Theoretical Informatics (11th Latin American Symposium, Montevideo, Uruguay, March 31-April 4, 2014. Proceedings). Pardo, A. & Viola, A. (eds.). Berlin: Springer, p. 47-59 (Lecture Notes in Computer Science; vol. 8392).

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

    4 Citations (Scopus)
  • Improved approximation algorithm for two-dimensional bin packing

    Bansal, N. & Khan, A., 2014, Proceedings 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14, Portland OR, USA, January 5-7, 2014). Chekuri, C. (ed.). Philadelphia PA: Society for Industrial and Applied Mathematics (SIAM), p. 13-25

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

    32 Citations (Scopus)
  • New developments in iterated rounding

    Bansal, N., 2014, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014, New Dehli, India, December 15-17, 2014). Raman, V. & Suresh, S. P. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-10 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 29).

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

    Open Access
    File
    31 Downloads (Pure)
  • On the adaptivity gap of stochastic orienteering

    Bansal, N. & Nagarajan, V., 2014, Integer Programming and Combinatorial Optimization (17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings). Lee, J. & Vygen, J. (eds.). Berlin: Springer, p. 114-125 (Lecture Notes in Computer Science; vol. 8494).

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

    9 Citations (Scopus)
  • 2013

    A complexity and approximability study of the bilevel knapsack problem

    Caprara, A., Carvalho, M., Lodi, A. & Woeginger, G. J., 2013, Integer Programming and Combinatorial Optimization (16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings). Goemans, M. & Correa, J. (eds.). Berlin: Springer, p. 98-109 (Lecture Notes in Computer Science; vol. 7801).

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

    16 Citations (Scopus)
  • Core stability in hedonic coalition formation

    Woeginger, G. J., 2013, SOFSEM 2013: Theory and Practice of Computer Science (39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings). Emde Boas, van, P., Groen, F. C. A., Italiano, G. F., Nawrocki, J. & Sack, H. (eds.). Berlin: Springer, p. 33-50 (Lecture Notes in Computer Science; vol. 7741).

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

    29 Citations (Scopus)
  • On the number of matroids

    Bansal, N., Pendavingh, R. A. & Pol, van der, J. G., 2013, Proceedings 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13, New Orleans LA, USA, January 6-8, 2013). Philadelphia PA: Society for Industrial and Applied Mathematics (SIAM), p. 675-694

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

    2 Downloads (Pure)
  • The complexity of finding a large subgraph under anonymity constraints

    Bredereck, R., Hartung, S., Nichterlein, A. & Woeginger, G. J., 2013, Algorithms and Computation (24th International Symposium, ISAAC 2013, Hong Kong, December 16-18, 2013. Proceedings). Cai, L., Chen, S-W. & Lam, T-W. (eds.). Berlin: Springer, p. 152-162 (Lecture Notes in Computer Science; vol. 8283).

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

    10 Citations (Scopus)
  • The primal-dual approach for online algorithms (Invited speaker)

    Bansal, N., 2013, Approximation and Online Algorithms (10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers). Erlebach, T. & Persiano, G. (eds.). Berlin: Springer, p. 1-1 (Lecture Notes in Computer Science; vol. 7846).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

  • 2012

    Cinderella versus the Wicked Stepmother

    Bodlaender, M. H. L., Hurkens, C. A. J., Kusters, V. J. J., Staals, F., Woeginger, G. J. & Zantema, H., 2012, Theoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings). Baeten, J. C. M., Ball, T. & Boer, de, F. S. (eds.). Berlin: Springer, p. 57-71 (Lecture Notes in Computer Science; vol. 7604).

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

    12 Citations (Scopus)
    2 Downloads (Pure)
  • Divorcing made easy

    Pruhs, K. R. & Woeginger, G. J., 2012, Fun with Algorithms (6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings). Kranakis, E., Krizanc, D. & Luccio, F. (eds.). Berlin: Springer, p. 305-314 (Lecture Notes in Computer Science; vol. 7288).

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

    6 Citations (Scopus)
  • Group activity selection problem

    Darmann, A., Elkind, E., Kurz, S., Lang, J., Schauer, J. & Woeginger, G. J., 2012, Internet and Network Economics (8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings). Goldberg, P. W. (ed.). Berlin: Springer, p. 156-169 (Lecture Notes in Computer Science; vol. 7695).

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

    37 Citations (Scopus)
    1 Downloads (Pure)
  • Motion planning with pulley, rope, and baskets

    Eggermont, C. E. J. & Woeginger, G. J., 2012, Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), February 29-March 3, 2012, Paris, France. Dürr, C. & Wilke, T. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 374-383 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 14).

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

    7 Citations (Scopus)
  • Multicast routing for energy minimization using speed scaling

    Bansal, N., Gupta, A., Krishnaswamy, R., Nagarajan, V., Pruhs, K. R. & Stein, C., 2012, Design and Analysis of Algorithms (First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings). Even, G. & Rawitz, D. (eds.). Berlin: Springer, p. 37-51 (Lecture Notes in Computer Science; vol. 7659).

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

    83 Citations (Scopus)
  • The (weighted) metric dimension of graphs: hard and easy cases

    Epstein, L., Levin, A. & Woeginger, G. J., 2012, Graph-Theoretic Concepts in Computer Science (38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selected Papers). Golumbic, M. C., Stern, M., Levy, A. & Morgenstern, G. (eds.). Berlin: Springer, p. 114-125 (Lecture Notes in Computer Science; vol. 7551).

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

    Open Access
    File
    11 Citations (Scopus)
    93 Downloads (Pure)
  • Tight time-space tradeoff for mutual exclusion

    Bansal, N., Bhatt, V., Jayanti, P. & Kondapally, R., 2012, Proceedings of the 44th ACM Symposium on Theory of Computing (STOC'12, New York NY, USA, May 19-22, 2012). New York NY: Association for Computing Machinery, Inc, p. 971-981

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

    1 Citation (Scopus)
    1 Downloads (Pure)
  • Transportation under nasty side constraints

    Woeginger, G. J., 2012, Mathematical Foundations of Computer Science 2012 (37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings). Rovan, B., Sassone, V. & Widmayer, P. (eds.). Berlin: Springer, p. 61-62 (Lecture Notes in Computer Science; vol. 7464).

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

  • Weighted geometric set multi-cover via quasi-uniform sampling

    Bansal, N. & Pruhs, K. R., 2012, Algorithms – ESA 2012 (20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings). Epstein, L. & Ferragina, P. (eds.). Berlin: Springer, p. 145-156 (Lecture Notes in Computer Science; vol. 7501).

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

    20 Citations (Scopus)
    2 Downloads (Pure)
  • 2011

    Analysis of multi-stage open shop processing systems

    Eggermont, C. E. J., Schrijver, A. & Woeginger, G. J., 2011, Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science (STACS'11, Dortmund, Germany, March 10-12, 2011). Schwentick, T. & Dürr, C. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 484-494 (LIPIcs: Leibniz International Proceedings in Informatics).

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

    Open Access
    File
    1 Citation (Scopus)
    80 Downloads (Pure)
  • A polylogarithmic competitive algorithm for the k-server problem

    Bansal, N., Buchbinder, N., Madry, A. & Naor, J., 2011, Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011, Palm Springs CA, USA, October 22-25, 2011). Ostrovsky, R. (ed.). Los Alamitos CA: IEEE Computer Society, p. 267-276

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

    33 Citations (Scopus)
    1 Downloads (Pure)
  • Domination when the stars are out

    Hermelin, D., Mnich, M., Leeuwen, van, E. J. & Woeginger, G. J., 2011, Automata, Languages and Programming (38th International Colloquium, ICALP 2011, Zürich, Switzerland, July 4-8, 2011. Proceedings, Part I). Aceto, L., Henzinger, M. & Sgall, J. (eds.). Berlin: Springer, p. 462-473 (Lecture Notes in Computer Science; vol. 6755).

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

    18 Citations (Scopus)
    1 Downloads (Pure)
  • Ranking and drawing in subexponential time

    Fernau, H., Fomin, F. V., Lokshtanov, D., Mnich, M., Philip, G. & Saurabh, S., 2011, Combinatorial Algorithms (21st International Workshop, IWOCA '10, London, UK, July 26-28, 2010. Proceedings). Iliopoulos, C. S. & Smyth, W. F. (eds.). Berlin: Springer, p. 337-348 (Lecture Notes in Computer Science; vol. 6460).

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

    Open Access
    File
    8 Citations (Scopus)
    95 Downloads (Pure)
  • Reachability and deadlocking problems in multi-stage scheduling

    Eggermont, C. E. J. & Woeginger, G. J., 2011, Reachability Problems (5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings). Delzanno, G. & Potapov, I. (eds.). Berlin: Springer, p. 153-164 (Lecture Notes in Computer Science; vol. 6945).

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

  • Stability in multi-skill workforce assignments : complexity analysis and stable assignments polytope

    Hurkens, C. A. J. & Firat, M., 2011, 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Nymburk, Czech Republic, 2011 July 19-24. Praha: Charles University Press, p. 222-224 (ITI series; vol. 2011-525).

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

    1 Downloads (Pure)
  • The Cinderella game on holes and anti-holes

    Bodlaender, M. H. L., Hurkens, C. A. J. & Woeginger, G. J., 2011, Graph-Theoretic Concepts in Computer Science (37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers). Kolman, P. & Kratochvil, J. (eds.). Berlin: Springer, p. 71-82 (Lecture Notes in Computer Science; vol. 6986).

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

    4 Citations (Scopus)
  • Two-bounded-space bin packing revisited

    Chrobak, M., Sgall, J. & Woeginger, G. J., 2011, Algorithms - ESA 2011 (19th Annual European Symposium, Ljubljana, Slovenia, September 5-9, 2011. Proceedings). Demetrescu, C. & Halldorsson, M. H. (eds.). Berlin: Springer, p. 263-274 (Lecture Notes in Computer Science; vol. 6942).

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

    5 Citations (Scopus)
    1 Downloads (Pure)
  • Unweighted coalitional manipulation under the Borda rule is NP-hard

    Betzler, N., Niedermeier, R. & Woeginger, G. J., 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011, Barcelona, Catalonia, Spain, July 16-22, 2011). Walsh, T. (ed.). Menlo Park CA: AAI Press, p. 55-60

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

    57 Citations (Scopus)
    2 Downloads (Pure)
  • Vehicle refueling with limited resources

    Firat, M., Hurkens, C. A. J. & Woeginger, G. J., 2011, 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Nymburk, Czech Republic, 2011 July 19-24. Praha: Charles University Press, p. 134-136 (ITI series; vol. 2011-525).

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

    1 Downloads (Pure)
  • 2010

    All ternary permutation constraint satisfaction problems parameterized above average have polynomial kernels

    Gutin, G., Iersel, van, L. J. J., Mnich, M. & Yeo, A., 2010, Algorithms - ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I). Berg, de, M. & Meyer, U. (eds.). Berlin: Springer, p. 326-337 (Lecture Notes in Computer Science; vol. 6346).

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

    9 Citations (Scopus)
  • An algorithmic analysis of the honey-bee game

    Fleischer, R. & Woeginger, G. J., 2010, Fun with Algorithms (5th International Conference, FUN 2010, Iscia, Italy, June 2-4, 2010. Proceedings). Boldi, P. (ed.). Berlin: Springer, p. 178-189 (Lecture Notes in Computer Science; vol. 6099).

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

    5 Citations (Scopus)
  • Between a rock and a hard place: the two-to-one assignment problem

    Goossens, D. R., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J., 2010, Approximation and Online Algorithms (7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers). Bampis, E. & Jansen, K. (eds.). Berlin: Springer, p. 159-169 (Lecture Notes in Computer Science; vol. 5893).

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

  • Caching is hard, even in the fault model

    Chrobak, M., Woeginger, G. J., Makino, K. & Xu, H., 2010, Algorithms - ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I). Berg, de, M. & Meyer, U. (eds.). Berlin: Springer, p. 195-206 (Lecture Notes in Computer Science; vol. 6346).

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

    14 Citations (Scopus)
  • Exact algorithms for coloring graphs while avoiding monochromatic cycles

    Talla Nobibon, F., Hurkens, C. A. J., Leus, R. & Spieksma, F. C. R., 2010, Algorithmic Aspects in Information and Management (6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings). Chen, B. (ed.). Berlin: Springer, p. 229-242 (Lecture Notes in Computer Science; vol. 6124).

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

    4 Citations (Scopus)
  • Feedback vertex sets in tournaments

    Gaspers, S. & Mnich, M., 2010, Algorithms - ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings). Berg, de, M. & Meyer, U. (eds.). Berlin: Springer, Vol. 1. p. 267-277 (Lecture Notes in Computer Science; vol. 6346).

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

    8 Citations (Scopus)
  • Induced matchings in subcubic planar graphs

    Kang, R. J., Mnich, M. & Müller, T., 2010, Algorithms - ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II). Berg, de, M. & Meyer, U. (eds.). Berlin: Springer, p. 112-122 (Lecture Notes in Computer Science; vol. 6347).

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

    3 Citations (Scopus)
  • Kernel and fast algorithm for dense triplet inconsistency

    Guillemot, S. & Mnich, M., 2010, Theory and Applications of Models of Computation (7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings). Kratochvil, J., Li, A., Fiala, J. & Kolman, P. (eds.). Berlin: Springer, p. 247-257 (Lecture Notes in Computer Science; vol. 6108).

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

    6 Citations (Scopus)
  • The focus of attention problem

    Goossens, D., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J., 2010, Proceedings 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10, Austin TX, USA, January 17-19, 2010). Society for Industrial and Applied Mathematics (SIAM), p. 312-317

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

  • The Traveling Salesman Problem under squared Euclidean distances

    Berg, de, M. T., Nijnatten, van, F. S. B., Sitters, R. A., Woeginger, G. J. & Wolff, A., 2010, Proceedings 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2010, Nancy, France, March 4-6, 2010). Marion, J-Y. & Schwentick, T. (eds.). Leibniz-Zentrum für Informatik, p. 239-250 (LIPIcs: Leibniz International Proceedings in Informatics).

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

    2 Citations (Scopus)
  • 2009

    Charlemagne's challenge : the periodic latency problem

    Coene, S., Woeginger, G. J. & Spieksma, F. C. R., 2009, Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM'09, Hong Kong, December 8-11, 2009). Institute of Electrical and Electronics Engineers, p. 296-300

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

  • Combinatorial optimization problems with conflict graphs

    Darmann, A., Pferschy, U., Schauer, J. & Woeginger, G. J., 2009, Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009, Paris, France, June 2-4, 2009). Cafieri, S., Mucherino, A., Nannicini, G., Tarissan, F. & Liberti, L. (eds.). p. 293-296

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

    3 Downloads (Pure)
  • Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability

    Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R. I. & Wolff, A., 2009, Graph Drawing (16th International Symposium, GD'08, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers). Tollis, I. G. & Patrignani, M. (eds.). Berlin: Springer, p. 324-335 (Lecture Notes in Computer Science; vol. 5417).

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

    12 Citations (Scopus)
  • Fully decomposable split graphs

    Broersma, H. J., Kratsch, D. & Woeginger, G. J., 2009, Combinatorial Algorithms (20th International Workshop, IWOCA 2009, Hradec nad Moravici, Czech Republic, June 28-July 2, 2009, Revised Selected Papers). Fiala, J., Kratochvil, J. & Miller, M. (eds.). Berlin: Springer, p. 105-112 (Lecture Notes in Computer Science; vol. 5874).

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

    3 Citations (Scopus)
  • Linear kernel for planar connected dominating set

    Lokshtanov, D., Mnich, M. & Saurabh, S., 2009, Theory and Applications of Models of Computation (6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings). Chen, J. & Cooper, S. B. (eds.). Berlin: Springer, p. 281-290 (Lecture Notes in Computer Science; vol. 5532).

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

    17 Citations (Scopus)
  • Minimizing average flow time on unrelated machines

    Sitters, R. A., 2009, Approximation and Online Algorithms (6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers). Bampis, E. & Skutella, M. (eds.). Berlin: Springer, p. 67-77 (Lecture Notes in Computer Science; vol. 5426).

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

    2 Citations (Scopus)
  • On the approximability of the maximum feasible subsystem problem with 0/1-coefficients

    Elbassioni, K. M., Raman, R., Ray, S. & Sitters, R. A., 2009, Proceedings 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09, New York NY, USA, January 4-6, 2009). Society for Industrial and Applied Mathematics (SIAM), p. 1210-1219

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

    15 Citations (Scopus)
    2 Downloads (Pure)