Research Group: Discrete Mathematics and Mathematical Programming (DMMP)

These publication lists might not be complete. Publications are added regularly.

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | 1988 | 1987 | 1986 | 1977 | 1976 | 1967
Number of items: 789.

2014

Broersma, Hajo and Patel, Viresh and Pyatkin, Artem (2014) On toughness and hamiltonicity of 2K2-free graphs. Journal of graph theory, 75 (3). pp. 244-255. ISSN 0364-9024

Still, Georg and Ahmed, Faizan (2014) Quadratic maximization on the unit simplex: structure, stability, genericity and application in biology. [Report]

Skutella, Martin and Sviridenko, Maxim and Uetz, Marc (2014) Stochastic scheduling on unrelated machines. In: 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, 5-8 March 2014, Lyon, France (pp. pp. 639-650).

2013

Driessen, T.S.H. and Khmelnitskaya, A.B. (2013) A comment on P. Dehez and D. Tellone "Data games: sharing goods with exclusion", published in JPET 15 (2013): 654-673. [Report]

Veen, E. van der and Hurink, J.L. and Schutten, J.M.J. and Uijland, S.T. (2013) A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering. [Report]

Feng, Yuan and Driessen, Theo S.H. and Still, Georg (2013) A matrix approach to associated consistency of the Shapley value for games in generalized characteristic function form. Linear algebra and its applications, 438 (11). pp. 4279-4295. ISSN 0024-3795

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2013) A note on perfect partial elimination. Discrete mathematics, 313 (14). pp. 1558-1563. ISSN 0012-365X

Ahmed, Faizan and Still, Georg (2013) A note on set-semidefinite relaxations of nonconvex quadratic programs. Journal of global optimization, 57 (4). pp. 1139-1146. ISSN 0925-5001

Kern, W. and Paulus, J.J. (2013) A tight analysis of Brown-Baker-Katseff sequences for online strip packing. Journal of combinatorial optimization, 26 (2). pp. 333-344. ISSN 1382-6905

Veldhoven, Sophie van and Post, Gerhard and Veen, Egbert van der and Curtois, Tim (2013) An assessment of a days off decomposition approach to personnel scheduling. [Report]

Ohazulike, Anthony E. and Still, Georg and Kern, Walter and Berkum, Eric C. van (2013) An origin-destination based road pricing model for static and multi-period traffic assignment problems. Transportation research. Part E: Logistics and transportation review, 58 . pp. 1-27. ISSN 1366-5545

Jagtenberg, C. and Schwiegelshohn, U. and Uetz, M.J. (2013) Analysis of Smith's rule in stochastic machine scheduling. Operations research letters, 41 (6). pp. 570-575. ISSN 0167-6377

Manthey, Bodo and Plociennik, Kai (2013) Approximating independent set in perturbed graphs. Discrete applied mathematics, 161 (12). pp. 1761-1768. ISSN 0166-218X

Groote, Robert de and Hölzenspies, Philip K.F. and Kuper, Jan and Broersma, Hajo (2013) Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs. In: 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013, 18-20 October 2013, Portland, OR, USA (pp. pp. 35-46).

Bomhoff, Matthijs Jacobus (2013) Bipartite graphs and the decomposition of systems of equations. thesis.

Bomhoff, Matthijs and Manthey, Bodo (2013) Bisimplicial edges in bipartite graphs. Discrete applied mathematics, 161 (12). pp. 1699-1706. ISSN 0166-218X

Essen, J. Theresia van and Houdenhoven, Mark van and Hurink, Johann L. (2013) Clustering clinical departments for wards to achieve a prespecified blocking probability. [Report]

Toersche, Hermen A. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2013) Column generation based planning in smart grids using TRIANA. In: 4th IEEE/PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2013, 6-9 October 2013, Lyngby, Denmark (pp. 0537).

Bakker, Vincent and Molderink, Albert and Hurink, Johann and Smit, Gerard and Nykamp, Stefan and Reinelt, Jens (2013) Controlling and optimizing of energy streams in local buildings in a field test. In: 22nd International Conference and Exhibition on Electricity Distribution, CIRED 2013, 10-13 June 2013, Stockholm, Sweden (pp. 0506).

Ahmed, Faizan and Dür, Mirjam and Still, Georg (2013) Copositive programming via semi-infinite optimization. Journal of optimization theory and applications, 159 (2). pp. 322-340. ISSN 0022-3239

Kingston, Jeffrey H. and Post, Gerhard (2013) De derde internationale timetabling competitie : op zoek naar het beste schoolrooster. STAtOR, 14 (1). pp. 22-25. ISSN 1567-3383

Jong, Jasper de and Uetz, Marc and Wombacher, Andreas (2013) Decentralized throughput scheduling. In: 8th International Conference on Algorithms and Complexity, CIAC 2013, 22-24 May 2013, Barcelona, Spain (pp. pp. 134-145).

Hoeksma, Ruben and Manthey, Bodo and Uetz, Marc (2013) Decomposition algorithm for the single machine scheduling polytope. [Report]

Molderink, Albert and Bakker, Vincent and Smit, Gerard J.M. (2013) Demand Side Management for Multiple Devices. Ercim news, 92 . pp. 29-30. ISSN 0926-4981

Broersma, Hajo and Fomin, Fedor V. and Hof, Pim van 't and Paulusma, Daniël (2013) Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica, 65 (1). pp. 129-145. ISSN 0178-4617

Feng, Yuan (2013) Extensions of the Shapley value and their characterizations. thesis.

Essen, Johanna Theresia van (2013) Flowing through hospitals. thesis.

Li, Binlong and Broersma, Hajo and Zhang, Shenggui (2013) Forbidden subgraph pairs for traceability of block-chains. Electronic journal of graph theory and applications, 1 (1). pp. 1-10. ISSN 2338-2287

Qiu, Xian (2013) Fractional programming in cooperative games. thesis.

Broersma, Hajo and Kratsch, Dieter and Woeginger, Gerhard J. (2013) Fully decomposable split graphs. European journal of combinatorics, 34 (3). pp. 567-575. ISSN 0195-6698

Willing, Stefan and Smolka, Thomas and Stolte, Andreas and Nilges, Joachim and Matrose, Claas and Nykamp, Stefan and Schnettler, Armin (2013) Improving quality of supply and usage of assets in distribution grids by introducing a "Smart Operator". In: 22nd International Conference and Exhibition on Electricity Distribution, CIRED 2013, 10-13 June 2013, Stockholm, Sweden.

Hoogsteen, Gerwin and Molderink, Albert and Bakker, Vincent and Smit, Gerard J.M. (2013) Integrating lv network models and load-flow calculations into smart grid planning. In: 4th IEEE/PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2013, 6-9 October 2013, Lyngby, Denmark (pp. pp. 1-5).

Nykamp, Stefan (2013) Integrating renewables in distribution grids: storage, regulation and the interactions of different stakeholders in future grids. thesis.

Broersma, Hajo and Fiala, Jiri and Golovach, Petr A. and Kaiser, Tomas and Paulusma, Daniël and Proskurowski, Andrzej (2013) Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2013, 19-21 June 2013, Lübeck, Germany (pp. pp. 127-138).

Essen, J. Theresia van and Hurink, Johann L. and Nickel, Stefan and Reuter, Melanie (2013) Models for ambulance planning on the strategic and the tactical level. [Report]

Hou, Dongshuang (2013) Models, theory and applications in cooperative game theory. thesis.

Ohazulike, Anthony E. and Brands, T. (2013) Multi-objective optimization of traffic externalities using tolls: A comparison of genetic algorithm and game theoretical approach. In: 2013 IEEE Congress on Evolutionary Computation (CEC), 20-23 June 2013, Cancun, Mexico (pp. pp. 2465-2472).

Radzik, Tadeusz and Driessen, T.S.H. (2013) On a family of values for TU-games generalizing the Shapley value. Mathematical Social Sciences, 65 (2). pp. 105-111. ISSN 0165-4896

Molderink, A. and Bakker, V. and Hurink, J.L. and Smit, G.J.M. (2013) On indirect controlled cost function based DSM strategies. In: IEEE PowerTech (POWERTECH), 16-20 June 2013, Grenoble, Switzerland (pp. pp. 1-6).

(2013) Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013). In: 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2013, 21-23 May 2013, Enschede, Netherlands (pp. pp. 1-222).

Bringmann, Karl and Engels, Christian and Manthey, Bodo and Rao, B.V. Raghavendra (2013) Random shortest paths: non-euclidean instances for metric optimization problems. In: 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, 26-30 August 2013, Klosterneuburg, Austria (pp. pp. 219-230).

Bossers, H.C.M. and Hurink, J.L. and Smit, G.J.M. (2013) Selection of tests for outlier detection. In: 31st IEEE VLSI Test Symposium, VTS 2013, 29 April - 2 May 2013, Berkeley, CA, USA.

Brunsch, Tobias and Cornelissen, Kamiel and Manthey, Bodo and Röglin, Heiko (2013) Smoothed analysis of belief propagation for minimum-cost flow and matching. In: 7th International Workshop on Algorithms and Computation, WALCOM 2013, 14-16 February 2013, Kharagpur, India (pp. pp. 182-193).

Brunsch, Tobias and Cornelissen, Kamiel and Manthey, Bodo and Röglin, Heiko (2013) Smoothed analysis of belief propagation for minimum-cost flow and matching. Journal of graph algorithms and applications, 17 (6). pp. 647-670. ISSN 1526-1719

Bläser, Markus and Manthey, Bodo and Rao, B.V. Raghavendra (2013) Smoothed analysis of partitioning algorithms for Euclidean functionals. Algorithmica, 66 (2). pp. 397-418. ISSN 0178-4617

Manthey, Bodo and Veenstra, Rianne (2013) Smoothed analysis of the 2-opt heuristic for the TSP: polynomial bounds for Gaussian noise. In: 24th International Symposium on Algorithms and Computation, ISAAC 2013, 16-18 December 2013, Hong Kong, China (pp. pp. 579-589).

Brunsch, T. and Cornelissen, K. and Manthey, B. and Röglin, H. (2013) Smoothed analysis of the successive shortest path algorithm. In: 24th ACM-SIAM Symposium on Discrete Algorithms 2013, 6-8 January 2013, New Orleans, LA, USA (pp. pp. 1180-1189).

Brunsch, Tobias and Cornelissen, Kamiel and Manthey, Bodo and Röglin, Heiko (2013) Smoothed analysis of the successive shortest path algorithm. In: 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2013, 21-23 May 2013, Enschede, Netherlands (pp. pp. 27-30).

Bouza Allende, Gemayqzel and Still, Georg (2013) Solving bilevel programs with the KKT-approach. Mathematical programming, 138 (1-2). pp. 309-332. ISSN 0025-5610

Skutella, Martin and Sviridenko, Maxim and Uetz, Marc (2013) Stochastic scheduling on unrelated machines. [Report]

Nykamp, S. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2013) Storage Operation for Peak Shaving of Distributed PV and Wind Generation. In: 4th EEE PES Innovative Smart Grid Technologies, ISGT 2013, 24-27 February 2013, Washington, DC, USA (pp. pp. 1-6).

Hulshof, Peter J.H. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. (2013) Tactical resource allocation and elective patient admission planning in care processes. Health care management science, 16 (2). pp. 152-166. ISSN 1386-9620

Li, MingChu and Yuan, Lifeng and Jiang, He and Liu, Bing and Broersma, H.J. (2013) Tank-ring factors in supereulerian claw-free graphs. Graphs and combinatorics, 29 (3). pp. 599-608. ISSN 0911-0119

Kern, Walter and Qiu, Xian (2013) The 1/4-core of the uniform bin packing game is nonempty. In: 19th International Conference on Computing and Combinatorics, COCOON 2013, 21-23 June 2013, Hangzhou, China (pp. pp. 41-52).

Khmelnitskaya, Anna and Sudhölter, Peter (2013) The prenucleolus and the prekernel for games with communication structures. Mathematical methods of operations research . ISSN 1432-2994

Broersma, Hajo and Fomin, Vedor V. and Golovach, Petr A. and Paulusma, Daniël (2013) Three complexity results on coloring $P_k$-free graphs. European journal of combinatorics, 34 (3). pp. 609-619. ISSN 0195-6698

Broersma, Hajo and Golovach, Petr A. and Patel, Viresh (2013) Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical computer science, 485 . pp. 69-84. ISSN 0304-3975

Bauer, D. and Broersma, H.J. and Heuvel, J. van den and Kahl, N. and Schmeichel, E. (2013) Toughness and vertex degrees. Journal of graph theory, 72 (2). pp. 209-219. ISSN 0364-9024

Khmelnitskaya, Anna and Talman, Dolf (2013) Tree, web and average web value for cycle-free directed graph games. European journal of operational research . ISSN 0377-2217

Hoeksma, Ruben and Uetz, Marc (2013) Two dimensional optimal mechanism design for a sequencing problem. In: 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, 18-20 March 2013, Valparaíso, Chile (pp. pp. 242-253).

Khmelnitskaya, Anna (2013) Values for games with two-level communication structures. Discrete applied mathematics . ISSN 0166-218X

Manthey, B. and Röglin, H. (2013) Worst-case and smoothed analysis of k-means clustering with Bregman divergences. Journal of Computational Geometry, 4 (1). pp. 94-132. ISSN 1920-180X

2012

Driessen, T.S.H. and Khmelnitskaya, A.B. and Sales, J. (2012) 1-concave basis for TU games and the library game. Top, 20 (3). pp. 578-591. ISSN 1134-5764

Faigle, Ulrich and Kern, Walter and Peis, Britta (2012) A ranking model for the greedy algorithm and discrete convexity. Mathematical programming, 132 (1-2). pp. 393-407. ISSN 0025-5610

Post, Gerhard and Ahmadi, Samad and Daskalaki, Sophia and Kingston, Jeffrey H. and Kyngas, Jari and Nurmi, Cimmo and Ranson, David (2012) An XML format for benchmarks in High School Timetabling. Annals of Operations Research, 194 (1). pp. 385-397. ISSN 0254-5330

Brink, J.R. van den and Khmelnitskaya, A.B. and Laan, G. van der (2012) An efficient and fair solution for communication graph games. Economics Letters, 117 (3). pp. 786-789. ISSN 0165-1765

Molderink, A. and Bakker, V. and Hurink, J.L. and Smit, G.J.M. (2012) Comparing Demand Side Management approaches. In: 3rd Innovative Smart Grid Technologies Conference, ISGT Europe 2012, 14-16 October 2012, Berlin, Germany.

Biró, Péter and Kern, Walter and Paulusma, Daniël (2012) Computing solutions for matching games. International journal of game theory, 41 (1). pp. 75-90. ISSN 0020-7276

Toersche, Hermen A. and Nykamp, S. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2012) Controlling smart grid adaptivity. In: IEEE PES Innovative Smart Grid Technologies, ISGT Europe 2012, 14-17 October 2012, Berlin, Germany.

Toersche, H.A. and Bakker, V. and Molderink, A. and Nykamp, S. and Hurink, J.L. and Smit, G.J.M. (2012) Controlling the heating mode of heat pumps with the TRIANA three step methodology. In: IEEE PES Innovative Smart Grid Technologies, ISGT 2012, 16-20 January 2012, Washington, DC, USA.

Post, Gerhard and Ahmadi, Samad and Geertsema, Frederik (2012) Cyclic transfers in school timetabling. OR Spectrum, 34 (1). pp. 133-154. ISSN 0171-6468

Veldhoven, Sophie van and Post, Gerhard and Veen, Egbert van der (2012) Days off scheduling - A 2-phase approach to personnel rostering. In: 9th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2012, 29-31 August 2012, Son, Norway (pp. pp. 381-383).

Jong, Jasper de and Uetz, Marc and Wombacher, Andreas (2012) Decentralized throughput scheduling. [Report]

Essen, J. Theresia van and Hurink, J.L. and Hartholt, Woutske and Akker, Bernd J. van den (2012) Decision support system for the operating room rescheduling problem. Health care management science, 15 (4). pp. 355-372. ISSN 1386-9620

Bauer, D. and Broersma, H.J. and Heuvel, J. van den and Kahl, N. and Schmeichel, E. (2012) Degree sequences and the existence of k-factors. Graphs and combinatorics, 28 (2). pp. 149-166. ISSN 0911-0119

Molderink, A. (2012) Demand-Side Energy Management. In: Smart Grid - Infrastructure & Networking. McGraw-Hill Professional, pp. 1-19. ISBN 9780071787741

Manthey, Bodo (2012) Deterministic algorithms for multi-criteria Max-TSP. Discrete Applied Mathematics, 160 (15). pp. 2277-2285. ISSN 0166-218X

Zwartjes, G.J. and Havinga, P.J.M. and Smit, G.J.M. and Hurink, J.L. (2012) Distribution Bottlenecks in Classification Algorithms. Procedia Computer Science, 10 . pp. 960-967. ISSN 1877-0509

Vanberkel, Peter and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Lent, Wineke A.M. van and Harten, Wim van (2012) Een planningsmethode voor reductie van de fluctuaties in de belasting van verpleegafdelingen. STAtOR, 12 (2). 4 - 8. ISSN 1567-3383

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2012) Efficiency evaluation for pooling resources in health care. OR Spectrum, 34 (2). pp. 371-390. ISSN 0171-6468

Smit, Gerard J.M. (2012) Efficient ICT for efficient smart grids. In: IEEE PES Innovative Smart Grid Technologies, ISGT 2012, 16-20 January 2012, Washington, DC, USA.

Schwartz, Ramon S. and Ohazulike, Anthony E. and Sommer, Christoph and Scholten, Hans and Dressler, Falko and Havinga, Paul (2012) Fair and adaptive data dissemination for traffic information systems. In: Fourth IEEE Vehicular Networking Conference, VNC 2012, 14-16 November 2012, Seoul, South Korea (pp. pp. 1-8).

Broersma, H.J. and Ryjáček, Z. and Vrána, P. (2012) How many conjectures can you stand: a survey. Graphs and Combinatorics, 28 (1). pp. 57-75. ISSN 0911-0119

Essen, J. Theresia van and Bosch, Joel M. and Hans, Erwin W. and Houdenhoven, Mark van and Hurink, Johann L. (2012) Improve OR-schedule to reduce number of required beds. [Report]

Harren, Rolf and Kern, Walter (2012) Improved lower bound for online strip packing. In: 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, 8-9 September 2011, Saarbrücken, Germany (pp. pp. 211-218).

Braaksma, A. and Kortbeek, Nikky and Post, Gerhard and Nollet, Frans (2012) Integral multidisciplinary rehabilitation treatment planning. [Report]

Kern, W. and Qiu, X. (2012) Integrality gap analysis for bin packing games. Operations research letters, 40 (5). pp. 360-363. ISSN 0167-6377

Nykamp, S. and Molderink, A. and Bakker, V. and Toersche, H.A. and Hurink, J.L. and Smit, G.J.M. (2012) Integration of Heat Pumps in Distribution Grids: Economic Motivation for Grid Control. In: IEEE PES Innovative Smart Grid Technologies Europe 2012, 14-17 Oct 2012, Berlin, Germany.

Nykamp, S. and Molderink, A. and Bakker, V. and Toersche, H.A. and Hurink, J.L. (2012) Integration of heat pumps in distribution grids: economic motivation for grid control. In: third IEEE PES Innovative Smart Grid Technologies (ISGT) Europe Conference, 14-17 October 2012, Berlin.

Hou, Dongshuang and Driessen, Theo (2012) Interaction between Dutch soccer teams and fans: a mathematical analysis through cooperative game theory. Applied Mathematics, 2012 (3). pp. 86-91. ISSN 2152-7385

Vanberkel, Peter T. and Zonderland, Maartje and Boucherie, Richard J. and Hans, Erwin W. (2012) Leaving a mark on healthcare delivery with operations analysis. [Report]

Vanberkel, Peter T. and Zonderland, Maartje and Boucherie, Richard J. and Hans, E.W. (2012) Leaving a mark on healthcare delivery with operations analysis. M&SOM: Manufacturing & service operations management, 14 (4). pp. 508-511. ISSN 1523-4614

Essen, J.T. van and Hans, E.W. and Hurink, J.L. and Oversberg, A. (2012) Minimizing the waiting time for emergency surgery. Operations Research for Health Care, 1 (2-3). pp. 34-44. ISSN 2211-6923

Ohazulike, Anthony E. and Bliemer, Michiel C.J. and Still, Georg and Berkum, Eric C. van (2012) Multi-Objective Road Pricing: A Game Theoretic and Multi-Stakeholder Approach. In: 91st Annual Meeting pof the Transportation Research Board (TRB), January 22-26, 2012, Washington, DC, USA.

Manthey, Bodo (2012) Multi-criteria TSP: Min and max combined. Operations Research Letters, 40 (1). pp. 36-38. ISSN 0167-6377

Ohazulike, Anthony E. and Still, Georg and Kern, Walter and Berkum, Eric C. van (2012) Multi-stakeholder road pricing game: solution concepts. International Journal of Computational and Mathematical Sciences, 6 . pp. 1-12. ISSN 2070-3910

Bosman, Maurice G.C. and Molderink, Albert and Bakker, Vincent and Smit, Gerard and Hurink, Johann L. (2012) Multilevel unit commitment in smart grids. In: 1st International Conference on Operations Research and Enterprise Systems, ICORES 2012, 6-8 February 2012, Vilamoura, Portugal (pp. pp. 361-370).

Hoogsteen, G and Krist, J.O. and Bakker, V. and Smit, G.J.M. (2012) Non-intrusive appliance recognition. In: 3rd IEEE PES Innovative Smart Grid Technologies Europe, ISGT Europe 2012, 14-16 October 2012, Berlin, Germany (pp. p. 84).

Manthey, Bodo (2012) On approximating multi-criteria TSP. ACM Transactions on Algorithms, 8 (2). p. 17. ISSN 1549-6325

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2012) On bounded block decomposition problems for under-specified systems of equations. Journal of Computer and System Sciences, 78 (1). pp. 336-347. ISSN 0022-0000

Fouz, Mahmoud and Kufleitner, Manfred and Manthey, Bodo and Zeini Jahromi, Nima (2012) On smoothed analysis of quicksort and Hoare's find. Algorithmica, 62 (3-4). pp. 879-905. ISSN 0178-4617

Hans, Erwin W. and Vanberkel, Peter T. (2012) Operating Theatre Planning and Scheduling. In: Handbook of Healthcare System Scheduling. International Series in Operations Research & Management Science, 168 . Springer, pp. 105-130. ISBN 9781461417330

Essen, J.T. van and Hurink, J.L. and Hartholt, W. and Akker, B.J. van den (2012) Operating room rescheduling. [Report]

Li, Binlong and Broersma, Hajo and Zhang, Shenggui (2012) Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discrete mathematics, 312 (18). pp. 2800-2818. ISSN 0012-365X

Jong, Jasper de and Vinduška, Hana and Hans, Erwin and Post, Gerhard (2012) Polymetrisch metselen. STAtOR, 13 (1). pp. 9-12. ISSN 1567-3383

Engels, Christian and Manthey, Bodo and Raghavendra Rao, B.V. (2012) Random shortest path metrics with applications. In: Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), 29-31 May 2012, Munich, Germany (pp. pp. 121-124).

Uijland, Suzanne and Veen, Egbert van der and Hurink, Johann and Schutten, Marco (2012) Self-rostering applied to case studies - An ILP method to construct a feasible schedule. In: 9th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2012, 29-31 August 2012, Son, Norway (pp. pp. 384-387).

Veen, Egbert van der and Hans, Erwin W. and Post, Gerhard and Veltman, Bart (2012) Shift rostering using decomposition: assign weekend shifts first. [Report]

Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Heide Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till (2012) Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms, 8 (3). p. 30. ISSN 1549-6325

Bläser, Markus and Manthey, Bodo (2012) Smoothed complexity theory. In: 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, 27-31 August 2012, Bratislava, Slovakia (pp. pp. 198-209).

Nykamp, Stefan and Molderink, Albert and Hurink, Johann L. and Smit, Gerard J.M. (2012) Statistics for PV, wind and biomass generators and their impact on distribution grid planning. Energy, 45 (1). pp. 924-932. ISSN 0360-5442

Post, Gerhard and Di Gaspero, Luca and Kingston, Jeffrey H. and McCollum, Barry and Schaerf, Andrea (2012) The Third International Timetabling Competition. In: 9th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2012, 29-31 August 2012, Son, Norway (pp. pp. 479-484).

Khmelnitskaya, Anna and Selcuk, Özer and Talman, Dolf (2012) The average covering tree value for directed graph games. [Report]

Bonsma, P.S. and Broersma, H.J. and Patel, Viresh and Pyatkin, A.V. (2012) The complexity of finding uniform sparsest cuts in various graph classes. Journal of Discrete Algorithms, 14 . pp. 136-149. ISSN 1570-8667

Hoeksma, Ruben and Uetz, Marc (2012) The price of anarchy for minsum related machine scheduling. In: 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, September 8-9, 2011, Saarbrücken, Germany (pp. pp. 261-273).

Broersma, Hajo and Golovach, Petr A. and Patel, Viresh (2012) Tight complexity bounds for FPT subgraph problems parameterized by clique-width. In: 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 6-8 September 2011, Saarbrücken, Germany (pp. pp. 207-218).

Broersma, Hajo and Golovach, Petr A. and Patel, Viresh (2012) Tight complexity bounds for FPT subgraph problems parameterized by clique-width. In: 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 6-8 September 2011, Saarbrücken, Germany (pp. pp. 207-218).

Broersma, H.J. and Golovach, P.A. and Paulusma, D. and Song, Jian (2012) Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical Computer Science, 414 (1). pp. 9-19. ISSN 0304-3975

Zwartjes, G.J. and Havinga, P.J.M. and Smit, G.J.M. and Hurink, J.L. (2012) Using Unsupervised Learning to Improve the Naive Bayes Classifier for Wireless Sensor Networks. In: Sixth International Conference on MObile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2012, 23-28 September 2012, Barcelona, Spain (pp. pp. 71-76).

Nykamp, Stefan and Andor, Mark and Hurink, Johann L. (2012) ‘Standard’ incentive regulation hinders the integration of renewable energy generation. Energy Policy, 47 . pp. 222-237. ISSN 0301-4215

2011

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2011) A note on perfect partial elimination. [Report]

González-Arangüena, Enrique and Khmelnitskaya, Anna and Manuel, Conrado and Pozo, Monica del (2011) A social capital index. [Report]

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Lent, Wineke A.M. van and Harten, Wim H. van (2011) Accounting for Inpatient Wards When Developing Master Surgical Schedules. Anesthesia & Analgesia, 112 (6). pp. 1472-1479. ISSN 0003-2999

Brink, Rene van den and Khmelnitskaya, Anna and Laan, Gerard van der (2011) An Owen-type value for games with two-level communication structures. [Report]

Unadkat, Hemant V and Hulsman, Marc and Cornelissen, Kamiel and Papenburg, Bernke J. and Truckenmuller, Roman K. and Post, Gerhard F. and Uetz, Marc and Reinders, Marcel J.T. and Blitterswijk, Clemens A. van and Stamatialis, Dimitrios and Boer, Jan de (2011) An algorithm-based topographical biomaterials library to instruct cell fate. Proceedings of the National Academy of Sciences of the United States of America, PNAS, 108 (40). pp. 16565-16570. ISSN 0027-8424

Brink, Rene van den and Khmelnitskaya, Anna and Laan, Gerard van der (2011) An efficient and fair solution for communication graph games. [Report]

Vanberkel, P.T. and Boucherie, R.J. and Hans, E.W. and Hurink, J.L. and Lent, W.A.M. van and Harten, W.H. van (2011) An exact approach for relating recovering surgical patient workload to the master surgical schedule. Journal of the Operational Research Society, 62 (10). pp. 1851-1860. ISSN 0160-5682

Hurink, Johann (2011) Complexiteit: beperking en uitdaging. [Lecture]

Bosman, Maurice G.C. and Bakker, Vincent and Molderink, Albert and Hurink, Johann L. and Smit, Gerard J.M. (2011) Controlling a group of microCHPs: planning and realization. In: First International Conference on Smart Grids, Green Communications and IT Energy-aware Technologies, ENERGY 2011, 22-27 May 2011, Venice, Italy (pp. pp. 179-184).

Manthey, Bodo (2011) Deterministic algorithms for multi-criteria TSP. In: 8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011, 23-25 May 2011, Tokyo, Japan (pp. pp. 264-275).

Nurmi, K. and Kyngäs, J. and Post, G. (2011) Driver rostering for bus transit companies. Engineering Letters, 19 (2). pp. 125-132. ISSN 1816-093X

Brueggemann, Tobias and Hurink, Johann and Vredeveld, Tjark and Woeginger, Gerhard J. (2011) Exponential size neighborhoods for makespan minimization scheduling. Naval Research Logistics, 58 (8). pp. 795-803. ISSN 0894-069X

Gromicho, Joaquim A.S. and Oudshoorn, Erwin and Post, Gerhard (2011) Generating price-effective intermodal routes. Statistica Neerlandica, 65 (4). pp. 432-445. ISSN 0039-0402

Li, MingChu and Chen, Xiaodong and Broersma, Hajo (2011) Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Journal of Graph Theory, 68 (4). pp. 285-298. ISSN 0364-9024

Harren, Rolf and Kern, Walter (2011) Improved Lower Bound for Online Strip Packing (Extended Abstract). In: Approximation and Online Algorithms. Lecture Notes in Computer Science, 7164 . Springer, Berlin, Germany, pp. 211-218. ISBN 9783642291166

Hurink, J.L. and Paulus, J.J. (2011) Improved online algorithms for parallel job scheduling and strip packing. Theoretical Computer Science, 412 (7). pp. 583-593. ISSN 0304-3975

Kern, Walter and Qiu, Xian (2011) Improved taxation rate for bin packing games. In: First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, 18-20 April 2011, Rome, Italy (pp. pp. 175-180).

Vanberkel, Peter Tulkens (2011) Interacting hospital departments and uncertain patient flows : theoretical models and applications. thesis.

Jagtenberg, Caroline and Schwiegelshohn, Uwe and Uetz, Marc (2011) Lower bounds for Smith's rule in stochastic machine scheduling. In: 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, September 9-10, 2010, Liverpool, England (pp. pp. 142-153).

Brueggemann, Tobias and Hurink, Johann L. (2011) Matching based very large-scale neighborhoods for parallel machine scheduling. Journal of Heuristics, 17 (6). pp. 637-658. ISSN 1381-1231

Duives, Jelle and Uetz, Marc (2011) Mathematical Programming Approach to Multidimensional Mechanism Design for Single Machine Scheduling. [Report]

Essen, J.T. van and Hans, E.W. and Hurink, J.L. and Oversberg, A. (2011) Minimizing the waiting time for emergency surgery. [Report]

Timmer, Judith and Aarts, Harry and Dorenvanck, Peter van and Klomp, Jasper (2011) Non-cooperative monomino games. [Report]

Hulshof, Peter J.H. and Boucherie, Richard J. and Essen, J. Theresia van and Hans, Erwin W. and Hurink, Johann L. and Kortbeek, Nikky and Litvak, Nelly and Vanberkel, Peter T. and Veen, Egbert van der and Veltman, Bart and Vliegen, Ingrid H.M. and Zonderland, Maartje E. (2011) ORchestra: an online reference database of OR/MS literature in health care. Health Care Management Science, 14 (4). pp. 383-384. ISSN 1386-9620

Driessen, Theo S.H. and Fragnelli, Vito and Katsev, Ilya V. and Khmelnitskaya, Anna B. (2011) On 1-convexity and nucleolus of co-insurance games. Insurance: mathematics and economics, 48 (2). pp. 217-225. ISSN 0167-6687

Faigle, Ulrich and Kern, Walter and Peis, Britta (2011) On greedy and submodular matrices. In: First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, 18-20 April 2011, Rome, Italy (pp. pp. 116-126).

Zwartjes, Ardjan and Bahrepour, Majid and Havinga, Paul J.M. and Hurink, Johann L. and Smit, Gerard J.M. (2011) On the Effects of Input Unreliability on Classifion Algorithms. In: 8th International ICST Conference on Mobile and Ubiquitous Systems, Mobiquitous 2011, 6-9 December 2011, Copenhagen, Denmark.

Grigoriev, Alexander and Loon, Joyce van and Uetz, Marc (2011) On the complexity of a bundle pricing problem. 4OR: A Quarterly Journal of Operations Research, 9 (3). pp. 255-260. ISSN 1619-4500

Molderink, Albert (2011) On the three-step control methodology for Smart Grids. thesis.

Bossers, H.C.M. and Hurink, J.L. and Smit, G.J.M. (2011) Online Bivariate Outlier Detection in Final Test Using Kernel Density Estimation. In: IEEE Defect and Adaptive Test Analysis Workshop, 22-23 September 2011, Anaheim, CA, USA.

Bossers, H.C.M. and Hurink, J.L. and Smit, G.J.M. (2011) Online Univariate Outlier Detection in Final Test: A Robust Rolling Horizon Approach. In: 16th IEEE European Test Symposium, ETS 2011 , 23-27 May 2011, Trondheim, Norway (pp. p. 201).

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. (2011) Optimizing the strategic patient mix. [Report]

Haneyah, Sameh and Hurink, Johann and Schutten, Marco and Zijm, Henk and Schuur, Peter (2011) Planning and control of automated material handling systems: The merge module. In: Annual International Conference of the German Operations Research Society 2011, 1-3 Sep 2010, Munich, Germany (pp. pp. 281-286).

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2011) Planning the production of a fleet of domestic combined heat and power generators. European Journal of Operational Research, 216 (1). pp. 140-151. ISSN 0377-2217

Bläser, Markus and Jakoby, Andreas and Liskiewicz, Maciej and Manthey, Bodo (2011) Privacy in non-private environments. Theory of Computing Systems, 48 (1). pp. 211-245. ISSN 1432-4350

Burke, E.K. and Curtois, T. and Fijn van Draat, L. and Ommeren, J-K van and Post, G. (2011) Progress control in iterated local search for nurse rostering. Journal of the Operational Research Society, 62 (-). pp. 360-367. ISSN 0160-5682

Bomhoff, Matthijs (2011) Recognizing sparse perfect elimination bipartite graphs. In: Computer Science – Theory and Applications, 14-18 June 2011, St. Petersburg, Russia (pp. pp. 443-455).

Buiteveld, Bregje and Holland, Erik van and Post, Gerhard and Smit, Dirk (2011) Round-robin tournaments with homogeneous rounds. Annals of Operations Research . ISSN 0254-5330

Bläser, Markus and Manthey, Bodo and Rao, B.V. Raghavendra (2011) Smoothed analysis of partitioning algorithms for Euclidean functionals. In: 12th International Symposium on Algorithms and Data Structures, WADS 2011, 15-17 Aug 2011, New York, NY, USA (pp. pp. 110-121).

Arthur, David and Manthey, Bodo and Röglin, Heiko (2011) Smoothed analysis of the k-means method. Journal of the ACM, 58 (5). p. 19. ISSN 0004-5411

Manthey, Bodo and Röglin, Heiko (2011) Smoothed analysis: analysis of algorithms beyond worst case. it - Information Technology, 53 (6). pp. 280-286. ISSN 1611-2776

Boros, Endre and Elbassioni, Khaled and Fouz, Mahmoud and Gurvich, Vladimir and Makino, Kazuhisa and Manthey, Bodo (2011) Stochastic mean payoff games: smoothed analysis and approximation schemes. In: 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, 4-8 July 2011, Zurich, Switzerland (pp. pp. 147-158).

Hulshof, Peter J.H. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. (2011) Tactical resource allocation and elective patient admission planning in care pathways. [Report]

Hoeksma, Ruben and Uetz, Marc (2011) The Price of Anarchy for Minsum Related Machine Scheduling. [Report]

Bonsma, Paul and Broersma, Hajo and Patel, Viresh and Pyatkin, Artem (2011) The complexity status of problems related to sparsest cuts. In: 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, 26-28 July 2010, London, UK (pp. pp. 125-135).

Khmelnitskaya, Anna B. and Sudhölter, Peter (2011) The prenucleolus for games with communication structures. [Report]

Hurink, J.L. and Kok, A.L. and Paulus, J.J. and Schutten, J.M.J. (2011) Time-constrained project scheduling with adjacent resources. Computers & Operations Research, 38 (1). pp. 310-319. ISSN 0305-0548

Manthey, Bodo (2011) Towards explaining the speed of $k$-means. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 2011 . pp. 45-54.

Khmelnitskaya, Anna and Talman, Dolf (2011) Tree, web and average web value for cycle-free directed graph games. [Report]

Khmelnitskaya, Anna and Talman, Dolf (2011) Two solution concepts for TU games with cycle-free directed cooperation structures. In: 4th International Conference on Game Theory and Management, 28-30 June 2010, St. Petersburg, Russia (pp. pp. 241-265).

Post, Gerhard and Kingston, Jeffrey H. and Ahmadi, Samad and Daskalaki, Sophia and Gogos, Christos and Kyngas, Jari and Nurmi, Cimmo and Musliu, Nysret and Pillay, Nelishia and Santos, Haroldo and Schaerf, Andrea (2011) XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research . ISSN 0254-5330

2010

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2010) A Three-Step Methodology to Improve Domestic Energy Efficiency. In: IEEE Innovative Smart Grid Technologies Conference 2010, 19-21 Jan 2010, Gathersburg, USA.

Driessen, Theo S.H. and Hou, Dongshuang (2010) A note on the nucleolus for 2-convex TU games. International Journal of Game Theory, 39 (1-2). pp. 185-189. ISSN 0020-7276

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2010) A survey of health care models that encompass multiple departments. International Journal of Health Management and Information, 1 (1). pp. 37-69. ISSN 2229-3108

Post, Gerhard and Kingston, Jeffrey H. and Ahmadi, Samad and Daskalaki, Sophia and Gogos, Christos and Kyngas, Jari and Nurmi, Cimmo and Santos, Haroldo and Rorije, Ben and Schaerf, Andrea (2010) An XML format for benchmarks in high school timetabling II. In: 8th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2010, 10-13 Aug 2010, Belfast, Northern Ireland (pp. pp. 347-350).

Verbree, Jan-Maarten and Graaf, Maurits de and Hurink, Johann (2010) An analysis of the lifetime of OLSR networks. Ad Hoc Networks, 8 (4). pp. 391-399. ISSN 1570-8705

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2010) Applying Column Generation to the Discrete Fleet Planning Problem. In: STW.ICT Conference 2010, 18-19 Nov 2010, Veldhoven, The Netherlands (pp. pp. 200-204).

Manthey, Bodo and Plociennik, Kai (2010) Approximating independent set in semi-random graphs. In: 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2010, 25-27 May 2010, Cologne, Germany (pp. pp. 119-122).

Driessen, Theo S.H. (2010) Associated consistency and values for TU games. International Journal of Game Theory, 39 (3). pp. 467-482. ISSN 0020-7276

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2010) Benchmarking set for domestic smart grid management. In: Innovative Smart Grid Technologies Conference Europe, ISGT Europe 2010, 11-13 Oct 2010, Gothenburg, Sweden (pp. pp. 1-8).

Bomhoff, Matthijs and Manthey, Bodo (2010) Bisimplicial edges in bipartite graphs. In: Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2010, 25-27 May 2010, Cologne, Germany (pp. pp. 29-32).

Kern, Walter (2010) Book review: Game theory: a multi-leveled approach / by Hans Peters. - Berlin : Springer-Verlag, 2008. - ISBN 978-3-540-69290-4. Operations research letters, 38 (5). p. 492. ISSN 0167-6377

Faigle, Ulrich and Hurink, Johann (2010) Cologne/Twente Workshop on Graphs and Combinatorial Optimization CTW 2007 : Editorial. Discrete Applied Mathematics, 158 (4). p. 239. ISSN 0166-218X

Broersma, Hajo and Paulusma, Daniël (2010) Computing sharp 2-factors in claw-free graphs. Journal of Discrete Algorithms, 8 (3). pp. 321-329. ISSN 1570-8667

Still, Georg and Kern, Walter and Koelewijn, Jaap and Bomhoff, Matthijs (2010) Consistency of a system of equations: What does that mean? [Report]

Hof, Pim van 't and Post, Gerhard and Briskorn, Dirk (2010) Constructing fair round robin tournaments with a minimum number of breaks. Operations Research Letters, 38 (6). pp. 592-596. ISSN 0167-6377

Bakker, V. and Bosman, M.G.C. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2010) Demand side load management using a three step optimization methodology. In: First IEEE International Conference on Smart Grid Communications, SmartGridComm 2010, 4-6 Oct 2010, Gaithersburg, MD, USA (pp. pp. 431-436).

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2010) Designing for Economies of Scale vs. Economies of Focus in Hospital Departments. [Report]

Khmelnitskaya, Anna B. (2010) Existence of a dictatorial subgroup in social choice with independent subgroup utility scales, an alternative proof. In: Collective decision making - views from social choice and game theory. Theory and decision library C, 43 . Springer, Berlin, Germany, pp. 111-123. ISBN 9783642028649

Broersma, Hajo and Fomin, Fedor V. and Hof, Pim van 't and Paulusma, Daniël (2010) Fast exact algorithms for hamiltonicity in claw-free graphs. In: 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, 24-26 June 2009, Montpellier, France (pp. pp. 44-53).

Khmelnitskaya, Anna B. (2010) Graph-restricted games with coalition structure. In: Third International Conference on Game Theory and Management, 24-26 June 2009, St. Petersburg, Russia (pp. pp. 220-246).

Bakker, Vincent and Bosman, Maurice G.C. and Molderink, Albert and Hurink, Johann L. and Smit, Gerard J.M. (2010) Improved Heat Demand Prediction of Individual Households. In: First Conference on Control Methodologies and Technology for Energy Efficiency, 29-31 March 2010, Vilamoura, Portugal.

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2010) Improving stability and utilization of the electricity infrastructure of a neighbourhood. In: IEEE Conference on Innovative Technologies for an Efficient and Reliable Electricity Supply, CITRES 2010, 29-29 september, Waltham, Boston, USA (pp. pp. 233-239).

Jagtenberg, Caroline and Schwiegelshohn, Uwe and Uetz, Marc (2010) Lower bounds for Smith's rule in stochastic machine scheduling. [Report]

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2010) Management and Control of Domestic Smart Grid Technology. IEEE Transactions on Smart Grid, 1 (2). pp. 109-119. ISSN 1949-3053

Heydenreich, Birgit and Müller, Rudolf and Uetz, Marc (2010) Mechanism Design for Decentralized Online Machine Scheduling. Operations Research, 58 (2). pp. 445-457. ISSN 0167-6377

Manthey, Bodo (2010) Multi-criteria TSP: Min and Max combined. In: 7th International Workshop Approximation and Online Algorithms, WAOA 2009, 10-11 September 2009, Copenhagen, Denmark (pp. pp. 205-216).

Ohazulike, Anthony and Bliemer, Michiel and Still, Georg and Berkum, Eric van (2010) Multi-objective road pricing: a cooperative and competitive bilevel optimization approach. In: 11th TRAIL Congress, 23-24 November 2010, Rotterdam, the Netherlands.

Driessen, Theo S.H. and Fragnelli, Vito and Katsev, Ilya V. and Khmelnitskaya, Anna B. (2010) On 1-convexity and nucleolus of co-insurance games. [Report]

Bakker, Vincent and Molderink, Albert and Bosman, Maurice and Hurink, Johann L. and Smit, Gerard J.M. (2010) On Simulating the Effect on the Energy Efficiency of Smart Grid Technologies. In: Winter Simulation Conference, WSC 2010, 5-8 Dec 2010, Baltimore, MD, USA (pp. pp. 393-404).

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2010) On bounded block decomposition problems for under-specified systems of equations. [Report]

Biro, Peter and Kern, Walter and Paulusma, Daniël (2010) On solution concepts for matching games. In: 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010, 7-11 June, 2010, Prague, Czech Republic (pp. pp. 117-127).

Grigoriev, Alexander and Lohn, Joyce van and Uetz, Marc (2010) On the complexity of a bundle pricing problem. [Report]

Grigoriev, Alexander and Loon, Joyce van and Uetz, Marc (2010) On the complexity of the highway pricing problem. In: 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010, 23-29 Jan, 2010, Špindleruv Mlýn, Czech Republic (pp. pp. 465-476).

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2010) On the effects of MPC on a domestic energy efficiency optimization methodology. In: IEEE International Energy Conference, ENERGYCON 2010, 20-22 Dec 2010, Al Manamah, Bahrain.

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2010) On the microCHP scheduling problem. In: 3rd Global Conference on Power Control and Optimization PCO, 2010, 2-4 Feb 2010, Gold Coast, Australia. (In Press)

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly and Lent, Wineke A.M. van and Harten, Wim H. van (2010) Reallocating resources to focused factories: a case study in chemotherapy. In: Proceedings of the 34th Meeting of the European Group on Operations Research Applied to Health Services, ORAHS. EURO Working Group on Operational Research Applied to Health Services, ORAHS, pp. 152-164. ISBN 9780986617904

Bomhoff, Matthijs (2010) Recognizing sparse perfect elimination bipartite graphs. [Report]

Post, Gerhard and Ruizenaar, Henri and Bannink, Ronald (2010) Roosteren op een middelbare school. STAtOR, 11 (3). pp. 24-28. ISSN 1567-3383

Buiteveld, Bregje and Holland, Erik van and Post, Gerhard and Smit, Dirk (2010) Round-Robin Tournaments with homogenous rounds. In: 8th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2010, 10-13 Aug 2010, Belfast, Northern Ireland (pp. pp. 122-135).

Braak, Timon D. ter and Hölzenspies, Philip K.F. and Kuper, Jan and Hurink, Johann L. and Smit, Gerard J.M. (2010) Run-time Spatial Resource Management for Real-Time Applications on Heterogeneous MPSoCs. In: Conference on Design, Automation and Test in Europe, DATE 2010, 8-12 March 2010, Dresden, Germany (pp. pp. 357-362).

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2010) Scheduling microCHPs in a group of houses. Global Journal on Technology and Optimization, 1 (1). pp. 30-37. ISSN 1985-9406

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2010) Steering the Smart Grid. In: 2010 STW.ICT Conference, 18-19 November 2010, Veldhoven, The Netherlands (pp. pp. 1-7).

Khmelnitskaya, Anna and Talman, Dolf (2010) Tree-type values for cycle-free directed graph games. [Report]

Khmelnitskaya, A.B. (2010) Values for rooted-tree and sink-tree digraphs games and sharing a river. Theory and decision, 69 (4). pp. 657-669. ISSN 0040-5833

2009

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2009) A Survey of Health Care Models that Encompass Multiple Departments. [Report]

Faigle, Ulrich and Fujishige, Saturo (2009) A general model for matroids and the greedy algorithm. Mathematical programming, 119 (2). pp. 353-369. ISSN 0025-5610

Driessen, Theo and Hu, Cheng-Chengt (2009) A note on equivalence of consistency and bilateral consistency through converse consistency. Games and Economic Behavior, 65 (2). pp. 644-648. ISSN 0899-8256

Kern, W. and Paulus, J.J. (2009) A note on the lower bound for online strip packing. [Report]

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2009) A survey of health care models that encompass multiple departments. [Report]

Verbree, Jan-Maarten and Graaf, Maurits de and Hurink, Johann (2009) An analysis of the lifetime of OLSR networks. [Report]

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Lent, Wineke A.M. van and Harten, Wim H. van (2009) An exact approach for relating recovering surgical patient workload to the master surgical schedule. [Report]

Arpe, J. and Manthey, B. (2009) Approximability of Minimum AND-Circuits. Algorithmica, 53 (3). pp. 337-357. ISSN 0178-4617

Manthey, B. and Shankar Ram, L. (2009) Approximation algorithms for multi-criteria traveling salesman problems. Algorithmica, 53 (1). pp. 69-88. ISSN 0178-4617

Engels, Christian and Manthey, Bodo (2009) Average-case approximation ratio of the 2-opt algorithm for the TSP. Operations Research Letters, 37 (2). pp. 83-84. ISSN 0167-6377

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2009) Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discussiones Mathematicae Graph Theory, 29 (1). pp. 143-162. ISSN 1234-3099

Heydenreich, B. and Müller, R. and Uetz, M.J. and Vohra, R. (2009) Characterization of revenue equivalence. Econometrica, 77 (1). pp. 307-316. ISSN 1468-0262

Li, Xueliang and Yao, Xiangmei and Zhou, Wenli and Broersma, Hajo (2009) Complexity of conditional colorability of graphs. Applied Mathematics Letters, 22 (3). pp. 320-324. ISSN 0893-9659

Post, Gerhard and Ahmadi, Samad and Geertsema, Frederik (2009) Cyclic transfers in school timetabling. [Report]

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2009) Domestic energy efficiency improving algorithms. In: ProRISC 2009, Annual Workshop on Circuits, Systems and Signal Processing, 26-27 Nov 2009, Veldhoven, the Netherlands (pp. pp. 229-236).

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2009) Domestic energy management methodology for optimizing efficiency in Smart Grids. In: IEEE Bucharest PowerTech, 2009, 28 June - 2 July 2009, Bucharest, Romania (pp. pp. 1-7).

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2009) Efficiency evaluation for pooling resources in health care. [Report]

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly (2009) Efficiency evaluation for pooling resources in health care: An interpretation for managers. [Report]

Khmelnitskaya, Anna B. (2009) Erratum to: "Marginalist and efficient values for TU games" [Math. Social. Sci. 38 (1) (1999) 45–54]. Mathematical social sciences, 57 (2). pp. 285-286. ISSN 0165-4896

Broersma, Hajo and Kratsch, Dieter and Woeginger, Gerhard J. (2009) Fully decomposable split graphs. In: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic (pp. pp. 105-112).

Molderink, Albert and Bosman, Maurice G.C. and Bakker, Vincent and Hurink, Johann L. and Smit, Gerard J.M. (2009) Hard- and software implementation and verification of an Islanded House prototype. In: 2009 International Conference on Systems Engineering, 8-10 September 2009, Coventry, UK.

Bakker, V. and Molderink, A. and Bosman, M.G.C. and Hurink, J.L. and Smit, G.J.M. (2009) Improved simulator to analyse the impact of distributed generation on the electricity grid. In: ProRISC 2009, Annual Workshop on Circuits, Systems and Signal Processing, 26-27 Nov 2009, Veldhoven, the Netherlands (pp. pp. 197-201).

Manthey, Bodo and Röglin, Heiko (2009) Improved smoothed analysis of the $k$-means method. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, 4-6 Jan 2009, New York, NY, USA (pp. pp. 461-470).

Xu, Genjiu and Driessen, Theo and Sun, Hao (2009) Matrix approach to dual similar associated consistency for the Shapley value. Linear Algebra and its Applications, 430 (11-12). pp. 2896-2897. ISSN 0024-3795

Manthey, B. (2009) Minimum-weight cycle covers and their approximability. Discrete Applied Mathematics, 157 (7). pp. 1470-1480. ISSN 0166-218X

Manthey, Bodo (2009) On approximating multi-criteria TSP. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, 26-28 Feb 2009, Freiburg, Germany (pp. pp. 637-648).

Broersma, H.J. and Vumar, E. (2009) On hamiltonicity of $P_3$-dominated graphs. Mathematical methods of operations research, 69 (2). pp. 297-306. ISSN 1432-2994

Fouz, Mahmoud and Kufleitner, Manfred and Manthey, Bodo and Zeini Jahromi, Nima (2009) On smoothed analysis of quicksort and Hoare's find. In: 15th Annual International Computing and Combinatorics Conference, COCOON 2009, 13-15 Jul 2009, Niagara Falls, NY, USA (pp. pp. 158-167).

Kern, Walter and Paulusma, Daniël (2009) On the core and f-nucleolus of flow games. Mathematics of Operations Research, 34 (4). pp. 981-991. ISSN 0364-765X

Jonker, Peter and Still, Georg and Twilt, Frank (2009) On the stratification of a class of specially structured matrices. Optimization, 58 (6). pp. 685-712. ISSN 0233-1934

Paulus, Jacob Jan (2009) Online scheduling & project scheduling. thesis.

Paulus, Jacob Jan and Ye, Deshi and Zhang, Guochuan (2009) Optimal online-list batch scheduling. Information Processing Letters, 109 (19). pp. 1125-1128. ISSN 0020-0190

Grigoriev, Alexander and Loon, Joyce van and Sitters, René and Uetz, Marc (2009) Optimal pricing of capacitated networks. Networks, 53 (1). pp. 79-87. ISSN 0028-3045

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2009) Production planning in a Virtual Power Plant. In: ProRISC 2009, Annual Workshop on Circuits, Systems and Signal Processing, 26-27 Nov 2009, Veldhoven, the Netherlands.

Hof, Pim van 't and Post, Gerhard and Briskorn, Dirk (2009) Round-robin tournaments with minimum number of breaks and two teams per club. [Report]

Hölzenspies, Philip K.F. and Braak, Timon D. ter and Kuper, Jan and Smit, Gerard J.M. and Hurink, Johann L. (2009) Run-time Spatial Mapping of Streaming Applications to Heterogeneous Multi-Processor Systems. International Journal of Parallel Programming, 38 (1). pp. 68-83. ISSN 1573-7640

Grigoriev, Alexander and Uetz, Marc (2009) Scheduling jobs with time-resource tradeoff via nonlinear programming. Discrete Optimization, 6 (4). pp. 414-419. ISSN 1572-5286

Broersma, Hajo and Paulusma, Daniël and Yoshimoto, Kiyoshi (2009) Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Graphs and Combinatorics, 25 (4). pp. 427-460. ISSN 0911-0119

Molderink, Albert and Bosman, Maurice G.C. and Bakker, Vincent and Hurink, Johann L. and Smit, Gerard J.M. (2009) Simulating the effect on the energy efficiency of smart grid technologies. In: 2009 Winter Simulation Conference, 13-16 December 2009, Austin, Texas, USA. (In Press)

Mader, Angelika and Bohnenkamp, Henrik and Usenko, Yaroslav S. and Jansen, David N. and Hurink, Johann and Hermanns, Holger (2009) Synthesis and stochastic assessment of cost-optimal schedules. International Journal on Software Tools for Technology Transfer (STTT), 12 (5). pp. 305-317. ISSN 1433-2779

Bonsma, Paul (2009) The complexity of the matching-cut problem for planar graphs and other graph classes. Journal of Graph Theory, 62 (2). pp. 109-126. ISSN 0364-9024

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2009) The microCHP scheduling problem. In: Second Global Conference on Power Control and Optimization, PCO 2009, 1-3 June 2009, Bali, Indonesia.

Broersma, Hajo and Fomin, Fedor V. and Golovach, Petr A. and Paulusma, Daniël (2009) Three complexity results on coloring $P_k$-free graphs. In: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic (pp. pp. 95-104).

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniël and Stewart, Iain A. (2009) Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science, 410 (14). pp. 1319-1327. ISSN 0304-3975

Manthey, Bodo and Röglin, Heiko (2009) Worst-case and smoothed analysis of $k$-means clustering with Bregman divergences. In: 20th International Symposium on Algorithms and Computation, ISAAC 2009, 16-18 Dec 2009, Honolulu, Hawaii, USA (pp. pp. 1024-1033).

Arthur, David and Manthey, Bodo and Röglin, Heiko (2009) k-Means has polynomial smoothed complexity. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, 24-27 Oct 2009, Atlanta, GA, USA (pp. pp. 405-414).

Broersma, H.J. and Fujisawa, J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. and Yoshimoto, K. (2009) λ-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics, 309 (18). pp. 5596-5609. ISSN 0012-365X

2008

Nurdiati, Sri and Hoede, Cornelis (2008) 25 years development of knowledge graph theory: the results and the challenge. [Report]

Marin-Perianu, R.S. and Hurink, J.L. and Hartel, P.H. (2008) A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks. In: Proceedings of the International Symposium on Parallel and Distributed Processing with Applications (ISPA-08), 10-12 Dec 2008, Sydney, Australia (pp. pp. 863-870).

Schotborgh, W.O. and Kokkeler, F.G.M. and Tragter, H. and Bomhoff, M.J. and Houten, F.J.A.M. van (2008) A Generic Synthesis Algorithm for Well-Defined Parametric Design. In: 18th CIRP Design Conference, 7-9 April 2008, Enschede, Netherlands.

Marin-Perianu, R.S. and Hurink, J.L. and Hartel, P.H. (2008) A generalized clustering algorithm for dynamic wireless sensor networks. [Report]

Burke, E.K. and Curtois, T. and Post, G.F. and Qu, R. and Veltman, B. (2008) A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188 (2). pp. 330-341. ISSN 0377-2217

Oostrum, Jeroen M. van and Houdenhoven, M. van and Hurink, J.L. and Hans, E.W. and Wullink, G. and Kazemier, G. (2008) A master surgical scheduling approach for cyclic scheduling in operating room departments. OR Spectrum, 30 (2). pp. 355-374. ISSN 0171-6468

Broersma, H.J. and Capponi, A. and Paulusma, D. (2008) A new algorithm for on-line coloring bipartite graphs. SIAM Journal on Discrete Mathematics, 22 (1). pp. 72-91. ISSN 0895-4801

Bläser, Markus and Heynen, Thomas and Manthey, Bodo (2008) Adding cardinality constraints to integer programs with applications to maximum satisfiability. Information Processing Letters, 105 (5). pp. 194-198. ISSN 0020-0190

Molderink, Albert and Bakker, Vincent and Hurink, Johann L. and Smit, Gerard J.M. (2008) Algorithms for balancing demand-side load and micro-generation in Islanded Operation. In: 19th International Conference on Systems Engineering, ICSENG '08, 19-21 August 2008, Las Vegas, Nevada, USA (pp. pp. 115-120).

Grigoriev, Alexander and Loon, Joyce van and Uetz, Marc (2008) Algorithms for optimal price regulations. In: Internet And Network Economics, WINE, 17-20 Dec, 2008, Shanghai, China (pp. pp. 362-373).

Hurink, J.L. and Nieberg, T. (2008) Approximating minimum independent dominating sets in wireless networks. Information Processing Letters, 109 (2). pp. 155-160. ISSN 0020-0190

Nieberg, T. and Hurink, J.L. and Kern, W. (2008) Approximation schemes for wireless networks. ACM Transactions on Algorithms, 4 (4). p. 49. ISSN 1549-6325

Heydenreich, B. and Müller, R. and Uetz, M.J. and Vohra, R. (2008) Characterization of Revenue Equivalence. [Report]

Broersma, H.J. and Paulusma, D. (2008) Computing sharp 2-factors in claw-free graphs. In: 33rd International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2008, Torun, Poland (pp. pp. 193-204).

Li, M.C. and Xiong, L. and Broersma, H.J. (2008) Connected even factors in claw-free graphs. Discrete Mathematics, 308 (11). pp. 2282-2284. ISSN 0012-365X

Broersma, Hajo and Fijavz, Gasper and Kaiser, Tomas and Kuzel, Roman and Ryjacek, Zdenek and Vrana, Petr (2008) Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics, 308 (24). pp. 6064-6077. ISSN 0012-365X

Bouza Allende, G. and Guddat, J. and Still, G.J. (2008) Critical sets in one-parametric mathematical programs with complementarity constraints. Optimization, 57 (2). pp. 319-336. ISSN 0233-1934

Molderink, Albert and Bakker, Vincent and Hurink, Johann L. and Smit, Gerard J.M. and Kokkeler, Andre B.J. (2008) Domestic Electricity Usage Regulation Using µCHP Appliances. Power Systems Design Europe, 5 (1). pp. 41-44. ISSN 1613-6365

Bakker, Vincent and Molderink, Albert and Hurink, Johann L. and Smit, Gerard J.M. (2008) Domestic Heat Demand Prediction using Neural Networks. In: 19th International Conference on Systems Engineering, ICSENG '08, 19-21 August 2008, Las Vegas, Nevada, USA (pp. pp. 189-194).

Wang, Xinhui (2008) Exact algorithms for the Steiner tree problem. thesis.

Houdenhoven, Mark van and Oostrum, Jeroen M. van and Wullink, Gerhard and Hans, Erwin and Hurink, Johann L. and Bakker, Jan and Kazemier, Geert (2008) Fewer intensive care unit refusals and a higher capacity utilization by using a cyclic surgical case schedule. Journal of Critical Care, 23 (2). pp. 222-226. ISSN 0883-9441

Guerra Vázques, F. and Rückmann, J.-J. and Stein, O. and Still, G. (2008) Generalized semi-infinite programming: A tutorial. Journal of Computational and Applied Mathematics, 217 (2). pp. 394-419. ISSN 0377-0427

Dür, Mirjam and Still, Georg (2008) Interior points of the completely positive cone. Electronic Journal of Linear Algebra, 17 . pp. 48-53. ISSN 1081-3810

Bosman, M.G.C. and Bakker, V. and Molderink, A. and Hurink, J.L. and Smit, G.J.M. (2008) Load control in low voltage level of the electricity grid using µCHP appliances. In: ProRISC 2008, 19th Annual Workshop on Circuits, Systems and Signal Processing, 27-28 November 2008, Veldhoven, the Netherlands (pp. pp. 25-29).

Xu, Genjiu and Driessen, Theo S.H. and Sun, Hao (2008) Matrix analysis for associated consistency in cooperative game theory. Linear Algebra and its Applications, 428 (7). 1571 -1586. ISSN 0024-3795

Xu, Genjiu (2008) Matrix approach to cooperative game theory. thesis.

Heydenreich, Birgit and Müller, Rudolf and Uetz, Marc (2008) Mechanism Design for Decentralized Online Machine Scheduling. [Report]

Manthey, Bodo (2008) On approximating restricted cycle covers. SIAM Journal on Computing, 38 (1). pp. 181-206. ISSN 0097-5397

Grigoriev, Alexander and Loon, Joyce van and Uetz, Marc (2008) On the Complexity of the Highway Pricing Problem. [Report]

Hurink, J.L. and Paulus, J.J. (2008) Online algorithm for parallel job scheduling and strip packing. In: 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, 11-12 Oct, 2007, Eilat, Israel (pp. pp. 67-74).

Hurink, J.L. and Paulus, J.J. (2008) Online scheduling of parallel jobs on two machines is 2-competitive. Operations Research Letters, 36 (1). pp. 51-56. ISSN 0167-6377

Grigoriev, A. and Loon, J. van and Sviridenko, M. and Uetz, M. and Vredeveld, T. (2008) Optimal bundle pricing with monotonicity constraint. Operations Research Letters, 36 (5). pp. 609-614. ISSN 0167-6377

Heydenreich, B. and Mishra, D. and Müller, R. and Uetz, M.J. (2008) Optimal mechanisms for single machine scheduling. In: Internet And Network Economics (WINE 2008), 17-20 Dec, 2008, Shanghai, China (pp. pp. 414-425).

Paulus, Jacob Jan and Ye, Deshi and Zhang, Guochuan (2008) Optimal online-list batch scheduling. [Report]

Bokhove, O. and Hurink, J.L. and Meinsma, G. and Stolk, C.C. and Vellekoop, M.H. (2008) Preface. In: Proceedings of the 63rd European Study Group Mathematics with Industry, 28 Jan 2008 - 1 Feb 2008, Enschede, The Netherlands (pp. ii).

Vanberkel, Peter T. and Boucherie, Richard J. and Hans, Erwin W. and Hurink, Johann L. and Litvak, Nelly and Lent, Wineke A.M. van and Harten, Wim H. van (2008) Reallocating resources to focused factories: a case study in chemotherapy. [Report]

Baarsma, H.E. and Bosman, M.G.C. and Hurink, J.L. (2008) Resource Management in Heterogeneous Wireless Sensor Networks. [Report]

Hölzenspies, Philip K.F. and Hurink, Johann L. and Kuper, Jan and Smit, Gerard J.M. (2008) Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC). In: Eleventh Conference on Design, Automation and Test in Europe, DATE08, 10-14 March 2008, Munich, Germany (pp. pp. 212-217).

Grigoriev, A. and Uetz, M.J. (2008) Scheduling Parallel Jobs with Time-Resource Tradeoff via Nonlinear Programming. [Report]

Akker, Marjan van den and Baarsma, Hilbrandt and Hurink, Johann and Modelski, Maciej and Paulus, Jacob Jan and Reijnen, Ingrid and Roozemond, Dan and Schreuder, Jan (2008) Shunting passenger trains: getting ready for departure. In: 63rd European Study Group Mathematics with Industry, 28 Jan - 1 Feb 2008, Enschede, The Netherlands (pp. pp. 1-19).

Molderink, Albert and Bakker, Vincent and Bosman, Maurice G.C. and Hurink, Johann L. and Smit, Gerard J.M. (2008) Simulation of the effect of introducing micro-generation, energy buffers and accompanied optimization algorithms on the energy efficiency. In: ProRISC 2008, 19th Annual Workshop on Circuits, Systems and Signal Processing, 27-28 November 2008, Veldhoven, the Netherlands (pp. pp. 72-76).

Wang, Ligong and Broersma, Hajo and Hoede, Cornelis and Li, Xueliang and Still, Georg (2008) Some families of integral graphs. Discrete Mathematics, 308 (24). pp. 6383-6391. ISSN 0012-365X

Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2008) The computational complexity of the parallel knock-out problem. Theoretical Computer Science, 393 (1-3). pp. 182-195. ISSN 0304-3975

Brouwer, Andries E. and Post, Gerhard F. and Woeginger, Gerhard J. (2008) Tight bounds for break minimization in tournament scheduling. Journal of Combinatorial Theory, Series A, 115 (6). pp. 1065-1068. ISSN 0097-3165

Guldemond, T.A. and Hurink, J.L. and Paulus, J.J. and Schutten, J.M.J. (2008) Time-constrained project scheduling. Journal of Scheduling, 11 (2). pp. 137-148. ISSN 1094-6136

Hurink, J.L. and Kok, A.L. and Paulus, J.J. and Schutten, J.M.J. (2008) Time-constrained project scheduling with adjacent resources. [Report]

Bakker, Vincent and Molderink, Albert and Hurink, Johann L. and Smit, Gerard J.M. (2008) Using heat demand prediction to optimise Virtual Power Plant production capacity. In: ProRISC 2008, 19th Annual Workshop on Circuits, Systems and Signal Processing, 27-28 November 2008, Veldhoven, the Netherlands (pp. pp. 11-15).

Khmelnitskaya, Anna B. (2008) Values for rooted-tree and sink-tree digraphs games and sharing a river. [Report]

Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2008) Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines. In: 5th International Workshop on Approximation and Online Algorithms, October 11-12, 2007, Eilat, Israel (pp. pp. 41-54).

2007

Haan, Peter de and Landman, Ronald and Post, Gerhard and Ruizenaar, Henri (2007) A case study for timetabling in a Dutch secondary school. In: 6th International Conference on Practice and Theory of Automated Timetabling, PATAT 2006, August 30 - September 1, 2006, Brno, Czech Republic (pp. pp. 267-279).

Xu, G. and Sun, H. and Hoede, C. and Driessen, T.S.H. (2007) A solution defined by fine vectors. [Report]

Birbil, Ş.İ. and Frenk, J.B.G. and Still, G.J. (2007) An elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions in nonlinear programming. European Journal of Operational Research, 180 (1). pp. 479-484. ISSN 0377-2217

Hurink, J.L. and Nieberg, T. (2007) Approximating Minimum Independent Dominating Sets in Wireless Networks. [Report]

Broersma, Hajo and Fomin, Fedor V. and Golovach, Petr A. and Woeginger, Gerhard J. (2007) Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory, 55 (2). pp. 137-152. ISSN 0364-9024

Grigoriev, Alexander and Loon, Joyce van and Sviridenko, Maxim and Uetz, Marc and Vredeveld, Tjark (2007) Bundle pricing with comparable items. In: 15th Annual European Symposium, ESA, 8-10 Oct 2007, Eilat, Israel (pp. pp. 475-486).

Broersma, Hajo and Fijavz, Gasper and Kaiser, Tomas and Kuzel, Roman and Ryjacek, Zdenek and Vrana, Petr (2007) Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electronic Notes in Discrete Mathematics, 28 . pp. 55-59. ISSN 1571-0653

Fijn van Draat, L. and Poppelaars, J. and Post, G.F. (2007) De complexiteit van de Vereenvoudigde Arbeidstijdenwet. STAtOR, 8 (2). pp. 20-24. ISSN 1567-3383

Hölzenspies, P.K.F. and Kuper, J. and Smit, G.J.M. and Hurink, J.L. (2007) Demonstration of Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSoC). In: Dagstuhl Seminar 2007, 4-9 Mar 2007, Dagstuhl Wadern, Germany.

Grigoras, D.R. and Hoede, C. (2007) Design of object processing systems. [Report]

Fuchs, B. and Kern, W. and Mölle, D. and Richter, S. and Rossmanith, P. and Wang, X. (2007) Dynamic programming for minimum steiner trees. Theory of Computing Systems, 41 (3). pp. 493-500. ISSN 1432-4350

Broersma, H.J. and Fomin, F.V. and Královič, R. and Woeginger, G.J. (2007) Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics, 155 (2). pp. 92-102. ISSN 0166-218X

Heydenreich, B. and Müller, R. and Uetz, M.J. (2007) Games and mechanism design in machine scheduling - an introduction. Production and Operations Management, 16 (4). pp. 437-454. ISSN 1059-1478

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2007) Improved upper bounds for $\lambda$-backbone colorings along matchings and stars. In: Proceedings of SOFSEM 2007: Theory and Practice of Computer Science, 20-26 Jan 2007, Harrachov, Czech Republic (pp. pp. 188-199).

Wang, L. and Broersma, H.J. and Hoede, C. and Li, X. and Still, G.J. (2007) Integral trees of diameter 6. Discrete Applied Mathematics, 155 (10). pp. 1254-1266. ISSN 0166-218X

Molderink, Albert and Bakker, Vincent and Hurink, Johann L. and Smit, Gerard J.M. (2007) Islanded house operation using a micro CHP. In: ProRISC 2007, 18th Annual Workshop on Circuits, Systems and Signal Processing, 29-20 Nov 2007, Veldhoven, the Netherlands (pp. pp. 324-330).

Bonsma, Paul S. (2007) Linear time algorithms for finding sparsest cuts in various graph classes. Electronic Notes in Discrete Mathematics, 28 . pp. 265-272. ISSN 1571-0653

Grigoriev, A. and Sviridenko, M. and Uetz, M.J. (2007) Machine scheduling with resource dependent processing times. Mathematical programming, 110 (1). pp. 209-228. ISSN 0025-5610

Bouza Allende, G. and Still, G.J. (2007) Mathematical programs with complementarity constraints: convergence properties of a smoothing method. Mathematics of Operations Research, 32 (2). pp. 467-483. ISSN 0364-765X

Xu, G. and Driessen, T.S.H. and Sun, H. (2007) Matrix approach to consistency of the additive efficient normalization of semivalues. [Report]

Salman, A.N.M. and Broersma, H.J. (2007) On Ramsey numbers for paths versus wheels. Discrete Mathematics, 307 (7-8). pp. 975-982. ISSN 0012-365X

Broersma, H.J. and Paulusma, D. and Yoshimoto, K. (2007) On components of 2-factors in claw-free graphs. In: EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications, 11-15 September 2007, Seville, Spain (pp. pp. 289-293).

Broersma, Hajo and Li, Xueliang (2007) On the complexity of dominating set problems related to the minimum all-ones problem. Theoretical Computer Science, 385 (1-3). pp. 60-70. ISSN 0304-3975

Hurink, J.L. and Paulus, J.J. (2007) Online Algorithms for Parallel Job Scheduling and Strip Packing. [Report]

Hurink, J.L. and Paulus, J.J. (2007) Online scheduling of parallel jobs on two machines is 2-competitive. [Report]

Khmelnitskaya, A.B. and Yanovskaya, E.B. (2007) Owen coalitional value without additivity axiom. Mathematical methods of operations research, 66 (2). pp. 255-261. ISSN 1432-2994

Salman, A.N.M. and Broersma, H.J. (2007) Path–kipas Ramsey numbers. Discrete Applied Mathematics, 155 (14). pp. 1878-1884. ISSN 0166-218X

Bouhtou, M. and Grigoriev, A. and van Hoesel, S. and van der Kraaij, A. and Spieksma, F.C.R. and Uetz, M.J. (2007) Pricing bridges to cross a river. Naval Research Logistics, 54 (4). pp. 411-420. ISSN 0894-069X

Kern, Walter and Woeginger, Gerhard (2007) Quadratic programming and combinatorial minimum weight product problems. Mathematical programming, 110 (3). pp. 641-649. ISSN 0025-5610

López, M. and Still, G.J. (2007) Semi-infinite programming. European Journal of Operational Research, 180 (2). pp. 491-518. ISSN 0377-2217

Manthey, Bodo and Reischuk, Rüdiger (2007) Smoothed analysis of binary search trees. Theoretical Computer Science, 378 (3). pp. 292-315. ISSN 0304-3975

Hurink, Johann L. and Paulus, Jacob Jan (2007) Special cases of online parallel job scheduling. [Report]

Fuchs, Bernard and Kern, Walter and Wang, Xinhui (2007) Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Mathematical methods of operations research, 66 (1). pp. 117-125. ISSN 1432-2994

Baarsma, H.E. and Hurink, J.L. and Jansen, P.G. (2007) Statistical quality analysis of schedulers under soft-real-time constraints. [Report]

Fuchs, Bernard and Kern, Walter and Wang, Xinhui (2007) The Number of Tree Stars Is $O^*(1.357^k)$. Algorithmica, 49 (3). pp. 232-244. ISSN 0178-4617

Brouwer, Andries E. and Post, Gerhard and Woeginger, Gerhard J. (2007) Tight bounds for break minimization. [Report]

Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2007) Toughness and hamiltonicity in k-trees. Discrete Mathematics, 307 (7-8). pp. 832-838. ISSN 0012-365X

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2007) Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory, 55 (4). pp. 343-358. ISSN 0364-9024

Bauer, D. and Broersma, H.J. and Kahl, N. and Morgana, A. and Schmeichel, E. and Surowiec, T. (2007) Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics, 155 (10). pp. 1336-1343. ISSN 0166-218X

Brueggemann, T. and Hurink, J.L. (2007) Two very large-scale neighborhoods for single machine scheduling. OR Spectrum, 29 (3). pp. 513-533. ISSN 0171-6468

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniël (2007) Upper bounds and algorithms for parallel knock-out numbers. In: 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007, 5-8 June 2007, Castiglioncello, Italy (pp. pp. 328-340).

Khmelnitskaya, Anna B. (2007) Values for graph-restricted games with coalition structure. [Report]

2006

Haan, Peter de and Landman, Ronald and Post, Gerhard and Ruizenaar, Henri (2006) A Four-phase Approach to a Timetabling Problem in Secondary Schools. In: 6th International Conference on the Practice and Theory of Automated Timetabling, 30 Aug - 01 Sept 2006, Brno, The Czech Republic (pp. pp. 423-425).

Nieberg, Tim and Hurink, Johann (2006) A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. In: 3rd International Workshop on Approximation and Online Algorithms, WAOA 2005, 6-7 October 2005, Palma de Mallorca, Spain (pp. pp. 296-306).

Pop, P.C. and Kern, W. and Still, G.J. (2006) A new relaxation method for the generalized minimum spanning tree problem. European Journal of Operational Research, 170 (3). pp. 900-908. ISSN 0377-2217

Borodin, O.V. and Broersma, H.J. and Glebov, A. and van den Heuvel, J. (2006) A new upper bound on the cyclic chromatic number. Journal of Graph Theory, 54 (1). pp. 58-72. ISSN 0364-9024

Paulus, Jacob Jan and Hurink, Johann (2006) Adjacent-Resource Scheduling : why spatial resources are so hard to incorporate. In: CTW2006 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 25 . Elsevier, pp. 113-116.

Bläser, Markus and Manthey, Bodo and Sgall, Jirí (2006) An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms, 4 (4). pp. 623-632. ISSN 1468-0904

Driessen, T.S.H. (2006) Associated consistency and values for TU games. [Report]

Bonsma, P. and Epping, Th. and Hochstättler, W. (2006) Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics, 154 (9). pp. 1335-1343. ISSN 0166-218X

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2006) Computing an element in the lexicographic kernel of a game. Mathematical methods of operations research, 63 (3). pp. 427-433. ISSN 1432-2994

Driessen, Theo S.H. and Meinhardt, Holger (2006) Convexity of production, common pool and oligopoly games: a survey. In: International Conference on Game Theory and Mathematical Economics, 6-10 September 2004, Warsaw, Poland (pp. pp. 83-92).

Heydenreich, Birgit and Müller, Rudolf and Uetz, Marc (2006) Decentralization and mechanism design for online machine scheduling. In: 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, 6-8 July, 2006, Riga, Latvia (pp. pp. 136-147).

Talasila, V. and Clemente-Gallardo, J. and Schaft, A.J. van der (2006) Discrete port-Hamiltonian systems. Systems & Control Letters, 55 (6). pp. 478-486. ISSN 0167-6911

Brueggemann, Tobias (2006) Efficiency of local search. thesis.

Birbil, S.I. and Bouza, G. and Frenk, J.B.G. and Still, G. (2006) Equilibrium constrained optimization problems. European Journal of Operational Research, 169 (3). 1108 -1127. ISSN 0377-2217

Driessen, T.S.H. and Hu, C.-C. (2006) Equivalence of consistency and bilateral consistency through converse consistency. [Report]

Wullink, Gerhard and Lans, Marieke van der and Houdenhoven, Mark van and Hans, Erwin and Hurink, Johann and Kazemier, Geert (2006) Eén spoed-OK is géén spoed-OK. In: Benchmarking OK - Leren van elkaar. Springer Verlag, Baarn/Leusden, pp. 165-172. ISBN 9789078122036

Pol, Marleen van de and Houdenhoven, Mark van and Wullink, Gerhard and Hans, Erwin and Hurink, Johann and Kazemir, Geert (2006) Geïntegreerde OK-IC planning zorgt voor hogere OK-benutting en minder uitgevallen IC-patiënten. In: Benchmarking OK - Leren van elkaar. Springer Verlag, Baarn/Leusden, pp. 127-136. ISBN 9789078122036

Brandt, S. and Broersma, H.J. and Diestel, R. and Kriesell, M. (2006) Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica, 26 (1). pp. 17-36. ISSN 0209-9683

Fijn van Draat, Laurens and Post, Gerhard and Veltman, Bart and Winkelhuijzen, Wessel (2006) Harmonious personnel scheduling. [Report]

Oostrum, Jeroen and Houdenhoven, Mark van and Wullink, Gerhard and Hans, Erwin and Hurink, Johann and Kazemier, Geert (2006) Hoge OK benutting en minder afgevallen patienten door cyclisch plannen. In: Benchmarking OK - Leren van elkaar. Springer Verlag, Baarn/Leusden, pp. 113-120. ISBN 9789078122036

Grigoriev, Alexander and Loon, Joyce van and Sitters, René and Uetz, Marc (2006) How to sell a graph: guidelines for graph retailers. In: 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006, 22-24 June 2006, Bergen, Norway (pp. pp. 125-136).

Nieberg, Tim (2006) Independent and dominating sets in wireless communication graphs. thesis.

Brucker, P. and Heitmann, S. and Hurink, J.L. and Nieberg, T. (2006) Job-Shop Scheduling with Limited Capacity Buffers. OR Spectrum, 28 (2). pp. 151-176. ISSN 0171-6468

Grigoriev, A. and Sviridenko, M. and Uetz, M.J. (2006) LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 28-30 August 2006, Barcelona, Spain (pp. pp. 140-151).

Lin, L.J. and Still, G.J. (2006) Mathematical programs with equilibrium constraints: the existence of feasible points. Optimization, 55 (3). pp. 205-219. ISSN 0233-1934

Xu, G. and Driessen, T.S.H. and Sun, H. (2006) Matrix analysis for associated consistency in cooperative game theory. [Report]

Xu, G. and Driessen, T.S.H. (2006) Matrix approach to the Shapley value and dual similar associated consistency. [Report]

Megow, N. and Uetz, M.J. and Vredeveld, T. (2006) Models and algorithms for stochastic online scheduling. Mathematics of Operations Research, 31 (3). pp. 513-525. ISSN 0364-765X

Broersma, H.J. and Capponi, A. and Paulusma, D. (2006) On-line coloring of H-free bipartite graphs. In: Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC 2006), 29-31 May 2006, Rome, Italy (pp. pp. 284-295).

Salman, A.N.M. and Broersma, H.J. (2006) Path-fan Ramsey numbers. Discrete Applied Mathematics, 154 (9). pp. 1429-1436. ISSN 0166-218X

Brueggemann, Tobias and Vredeveld, Tjark and Woeginger, Gerhard J. (2006) Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electronic Notes in Theoretical Computer Science, 25 (1). pp. 29-33. ISSN 1571-0661

Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2006) Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica, 44 (4). pp. 343-361. ISSN 0178-4617

Bläser, Markus and Jakoby, Andreas and Liśkiewicz, Maciej and Manthey, Bodo (2006) Private computation: k-connected versus 1-connected networks. Journal of Cryptology, 19 (3). pp. 341-357. ISSN 0933-2790

Curtois, T. and Fijn van Draat, L. and Post, G.F. and van Ommeren, J.C.W. (2006) Progress Control in Variable Neighbourhood Search. In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, 30 Aug - 01 Sept 2006, Brno, The Czech Republic (pp. pp. 376-380).

Kern, Walter and Woeginger, Gerhard (2006) Quadratic programming and combinatorial minimum weight product problems. In: 6th Italian Conference on Algorithms and Complexity, CIAC 2006, May 29-31, 2006, Rome, Italy (pp. pp. 42-49).

Brueggemann, T. and Hurink, J.L. (2006) Quality of Move-Optimal Schedules for Minimizing the Vector Norm of the Workloads. [Report]

Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter (2006) Quality of Move-optimal Schedules for Minimizing Total Weigted Completion Time. Operations Research Letters, 34 (5). pp. 583-590. ISSN 0167-6377

Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter (2006) Quality of move-optimal schedules for minimizing total weighted completion time. Operations Research Letters, 34 (5). pp. 583-590. ISSN 0167-6377

Grigoriev, A. and Uetz, M.J. (2006) Scheduling parallel jobs with linear speedup. In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, 6-7 October, 2005, Palma de Mallorca, Spain (pp. pp. 203-215).

Driessen, T.S.H. and Sun, H. (2006) Semi-marginalistic values for set games. International Journal of Game Theory, 34 (2). pp. 241-258. ISSN 0020-7276

Bonsma, P.S. (2006) Spanning trees with many leaves: new extremal results and an improved FPT algorithm. [Report]

Bonsma, Paul Simon (2006) Sparse cuts, matching-cuts and leafy trees in graphs. thesis.

Post, G.F. and Woeginger, G.J. (2006) Sports tournaments, home–away assignments, and the break minimization problem. Discrete Optimization, 3 (2). pp. 165-173. ISSN 1572-5286

Xiong, L. and Broersma, H.J. (2006) Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics, 154 (9). pp. 1453-1463. ISSN 0166-218X

Mader, A.H. and Bohnenkamp, H.C. and Usenko, Y.S. and Jansen, D.N. and Hurink, J.L. and Hermanns, H. (2006) Synthesis and Stochastic Assessment of Cost-Optimal Schedules. [Report]

Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2006) The Computational Complexity of the Parallel Knock-Out Problem. In: Proceedings of the 7th Latin American Symposium (LATIN 2006), 20-24 March 2006, Valdivia, Chile (pp. pp. 250-261).

Fuchs, Bernard and Kern, Walter and Wang, Xinhui (2006) The number of tree stars is O*(1.357k). Electronic Notes in Discrete Mathematics, 25 . pp. 183-185. ISSN 1571-0653

Guldemond, T.A. and Hurink, J.L. and Paulus, J.J. and Schutten, J.M.J. (2006) Time-Constrained Project Scheduling. [Report]

Bauer, Douglas and Broersma, Hajo and Schmeichel, Edward (2006) Toughness in graphs - A survey. Graphs and Combinatorics, 22 (1). pp. 1-35. ISSN 0911-0119

Driessen, T.S.H. and Hu, C.-C. (2006) Two axiomatizations of the kernel of TU games: bilateral and converse reduced game properties. [Report]

Grigoriev, A. and Sviridenko, M. and Uetz, M.J. (2006) Unrelated parallel machine scheduling with resource dependent processing times. In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, 8-10 June, 2005, Berlin, Germany (pp. pp. 182-195).

Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2006) Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. [Report]

Oostrum, Jeroen van and Lans, Marieke van der and Houdenhoven, Mark van and Hans, Erwin and Hurink, Johann and Wullink, Gerhard and Kazemier, Geert (2006) Wachttijdverkorting voor spoedpatiënten door schuiven met de planning van electieve operaties. In: Benchmarking OK - Leren van elkaar. Springer Verlag, Baarn/Leusden, pp. 147-154. ISBN 9789078122036

2005

Driessen, T.S.H. and Khmelnitskaya, A.B. and Sales, J. (2005) 1-concave basis for TU games. [Report]

Driessen, T.S.H. and Khmelnitskaya, A.B. and Timmer, J.B. , eds. (2005) 4th Twente Workshop on Cooperative Game Theory joint with 3rd Dutch–Russian Symposium, WCGT2005, June 28–30, 2005. University of Twente, Enschede.

Bonsma, Paul (2005) A characterization of extremal graphs with no matching-cut. In: European Conference on Combinatorics, Graph Theory and Applications, EuroComb '05, September 5-9, 2009, Berlin, Germany (pp. pp. 135-138).

Bonsma, P.S. (2005) A characterization of extremal graphs without matching-cuts. [Report]

Oostrum, J.M. van and Houdenhoven, M. van and Hurink, J.L. and Hans, E.W. and Wullink, G. and Kazemier, G. (2005) A model for generating master surgical schedules to allow cyclic scheduling in operating room departments. [Report]

Farina, A. and Di Lallo, A. and Volpi, T. and Capponi, A. (2005) Accuracy of fused track for radar systems. Signal Processing, 85 (6). pp. 1189-1210. ISSN 0165-1684

Lans, M. van der and Hans, E.W. and Hurink, J.L. and Wullink, G. and Houdenhoven, M. van and Kazemier, G. (2005) Anticipating urgent surgery in operating room departments. [Report]

Bläser, Markus and Manthey, Bodo (2005) Approximating maximum weight cycle covers in directed graphs with weights zero and one. Algorithmica, 42 (2). pp. 121-139. ISSN 0178-4617

Driessen, Theo S.H. and Meinhardt, Holger I. (2005) Convexity of oligopoly games without transferable technologies. Mathematical Social Sciences, 50 (1). pp. 102-126. ISSN 0165-4896

Tchesnokov, M.A. and Molenaar, J. and Slot, J.J.M. (2005) Dynamics of molecules adsorbed on a die wall during polymer melt extrusion. Journal of Non-Newtonian Fluid Mechanics, 126 (2-3). pp. 71-82. ISSN 0377-0257

Stork, F. and Uetz, M.J. (2005) Enumeration of circuits and minimal forbidden sets. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 14-16 May, 2003, Enschede, The Netherlands (pp. pp. 108-111).

Kuhn, Fabian and Moscibroda, Thomas and Nieberg, Tim and Wattenhofer, Roger (2005) Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: 19th International Conference on Distributed Computing, DISC 2005, 26-29 September 2005, Cracow, Poland (pp. pp. 273-283).

Sontrop, H. and van der Horn, P. and Uetz, M.J. (2005) Fast ejection chain algorithms for vehicle routing with time windows. In: Hybrid Metaheuristics, Second International Workshop, HM 2005, 29-30 August, 2005, Barcelona, Spain (pp. pp. 78-89).

Driessen, Theo and Timmer, Judith and Khmelnitskaya, Anna (2005) Foreword. In: 4th Twente Workshop on Cooperative Game Theory joint with 3rd Dutch-Russian Symposium, 28-30 June 2005, Enschede, Netherlands (pp. i).

Wang, Ligong (2005) Integral trees and integral graphs. thesis.

Kuhn, F. and Moscibroda, T. and Nieberg, T. and Wattenhofer, R. (2005) Local Approximation Schemes for Ad Hoc and Sensor Networks. In: 2005 Joint Workshop on Foundations of Mobile Computing, 02 Sep 2005, Cologne, Germany (pp. pp. 91-106).

Zhang, L. and Hermanns, H. and Jansen, D.N. (2005) Logic and model checking for hidden Markov models. In: Formal techniques for networked and distributed systems, FORTE (pp. pp. 98-112).

Brueggemann, T. and Hurink, J.L. (2005) Matching based exponential neighborhoods for parallel machine scheduling. [Report]

Ebben, Mark and Heijden, Matthieu van der and Hurink, Johann and Schutten, Marco (2005) Modeling of capacitated transportation systems for integral scheduling. In: Container Terminals and Automated Transport Systems. Springer Verlag, Berlin, pp. 287-306. ISBN 9783540223283

Brueggemann, T. and Hurink, J.L. and Kern, W. (2005) Move-optimal schedules for parallel machines to minimize total weighted completion time. [Report]

Manthey, Bodo (2005) Non-approximability of weighted multiple sequence alignment for arbitrary metrics. Information Processing Letters, 95 (3). pp. 389-395. ISSN 0020-0190

Stork, F. and Uetz, M.J. (2005) On the generation of circuits and minimal forbidden sets. Mathematical programming, 102 (1). pp. 185-203. ISSN 0025-5610

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2005) Online matching on a line. Theoretical Computer Science, 332 (1-3). pp. 251-264. ISSN 0304-3975

Khmelnitskaya, A.B. and Yanovskaya, E.B. (2005) Owen coalitional value without additivity axiom. [Report]

Grigoriev, A. and van Hoesel, S. and van der Kraaij, A. and Uetz, M.J. and Bouhtou, M. (2005) Pricing network edges to cross a river. In: Approximation and Online Algorithms (WAOA 2004), 14-16 September, 2004, Bergen, Norway (pp. pp. 140-153).

Smit, Lodewijk T. and Hurink, Johann L. and Smit, Gerard J.M. (2005) Run-time Mapping of Applications to a Heterogeneous SoC. In: International Symposium on System-on-Chip, SoC 2006, 13-16 November 2005, Tampere, Finland (pp. pp. 78-81).

Post, G.F. and Woeginger, G.J. (2005) Sports tournaments, home-away assignments, and the break minimization problem. [Report]

Skutella, M. and Uetz, M.J. (2005) Stochastic machine scheduling with precedence constraints. SIAM Journal on Computing, 34 (4). pp. 788-802. ISSN 0097-5397

Megow, N. and Uetz, M.J. and Vredeveld, T. (2005) Stochastic online scheduling on parallel machines. In: Approximation and Online Algorithms (WAOA 2004), 14-16 September, 2004, Bergen, Norway (pp. pp. 167-180).

Hurink, Johann and Knust, Sigrid (2005) Tabu search algorithms for job-shop problems with a single transport robot. European Journal of Operational Research, 162 (1). pp. 99-111. ISSN 0377-2217

Broersma, H.J. and Paulusma, D. and Smit, G.J.M. and Vlaardingerbroek, F. and Woeginger, G.J. (2005) The computational complexity of the minimum weight processor assignment problem. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, June 21-23, 2004, Bad Honnef, Germany (pp. pp. 189-200).

Manthey, Bodo and Reischuk, Rüdiger (2005) The intractability of computing the Hamming distance. Theoretical Computer Science, 337 (1-3). pp. 331-346. ISSN 0304-3975

Brueggemann, T. and Hurink, J.L. (2005) Two exponential neighborhoods for single machine scheduling. [Report]

2004

Nieberg, Tim and Hurink, Johann (2004) A PTAS for the minimum dominating set problem in unit disk graphs. [Report]

Nieberg, Tim and Hurink, Johann and Kern, Walter (2004) A robust PTAS for maximum independent sets in unit disk graphs. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, 21-23 June 2004, Bad Honnef, Germany (pp. pp. 214-221).

Hoesel, L.F.W. van and Nieberg, T. and Kip, H.J. and Havinga, P.J.M. (2004) Advantages of a TDMA based, energy-efficient, self-organizing MAC protocol for WSNs. In: IEEE 59th Vehicular Technology Conference, VTC 2004, 17-19 May 2004, Milan, Italy (pp. pp. 1598-1602).

Azar, Yossi and Epstein, Leah and Richter, Yossi and Woeginger, Gerhard J. (2004) All-norm approximation algorithms. Journal of Algorithms, 52 (2). pp. 120-133. ISSN 0196-6774

Brueggemann, Tobias and Kern, Walter (2004) An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science, 329 (1-3). pp. 303-313. ISSN 0304-3975

Brueggemann, Tobias and Kern, Walter (2004) An improved local search algorithm for 3-SAT. In: w. Electronic Notes in Discrete Mathematics, 17 . Elsevier, Workshop on Graphs and Combinatorial Optimization, pp. 69-73.

Brueggemann, T. and Kern, W. (2004) An improved local search algorithm for 3-SAT. [Report]

Woeginger, Gerhard J. (2004) Approximations through relaxations. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica . pp. 12-18.

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Rauwerda, Gerard K. (2004) BER estimation for HiperLAN/2. In: IFIP TC6 9th International Conference on Personal Wireless Communications, PWC 2004, 21-23 Sep 2004, Delft, The Netherlands (pp. pp. 164-179).

Post, G.F. and Ruizenaar, H.W.A. (2004) Clusterschemes in Dutch secondary schools. [Report]

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. (2004) Energy-efficient wireless communication for mobile multimedia terminals. Radiomatics - Journal of Communication Engineering, 1 (1). pp. 49-58. ISSN 1693-5152

Wang, Ligong and Li, Xueliang and Hoede, Cornelis (2004) Integral complete r-partite graphs. Discrete Mathematics, 283 (1-3). pp. 231-241. ISSN 0012-365X

Král, Daniel and Majerech, Vladan and Sgall, Jiií and Tichy, Tomass and Woeginger, Gerhard (2004) It is tough to be a plumber. Theoretical Computer Science, 313 (3). pp. 473-484. ISSN 0304-3975

Nieberg, Tim and Hurink, Johann (2004) Local, Distributed Topology Control for Large-scale Wireless Ad-hoc Networks. In: International Workshop on Wireless Ad-Hoc Networks, IWWAN 2004, 31 May-3 June 2004, Oulu, Finland (pp. pp. 79-83).

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Rosien, Michel A.J. and Heysters, Paul M. and Krol, Thijs (2004) Mapping applications to a coarse grain reconfigurable system. In: New Algorithms, Architectures and Applications for Reconfigurable Computing. Kluwer Academic Publishers. ISBN 9781402031274

Klinz, Bettina and Woeginger, Gerhard J. (2004) Minimum-cost dynamic flows: The series-parallel case. Networks, 43 (3). pp. 153-162. ISSN 0028-3045

Ebben, Mark and Heijden, Matthieu van der and Hurink, Johann and Schutten, Marco (2004) Modeling of capacitated transportation systems for integral scheduling. OR Spectrum, 26 (2). pp. 263-282. ISSN 0171-6468

Liśkiewicz, Maciej and Manthey, Bodo (2004) New lower and upper bounds for the competitive ratio of transmission protocols. Information Processing Letters, 89 (6). pp. 297-301. ISSN 0020-0190

Erdös, Péter L. and Faigle, Ulrich and Hochstättler, Winfried and Kern, Walter (2004) Note on the game chromatic index of trees. Theoretical Computer Science, 313 (3). pp. 371-376. ISSN 0304-3975

Salman, A.N.M. and Broersma, H.J. (2004) On Ramsey numbers for paths versus wheels. [Report]

Nieberg, Tim (2004) On cyclic plans for scheduling a smart card personalisation system. [Report]

Hurkens, Cor A.J. and Woeginger, Gerhard J. (2004) On the nearest neighbor rule for the traveling salesman problem. Operations Research Letters, 32 (1). pp. 1-4. ISSN 0167-6377

Salman, A.N.M. and Broersma, H.J. (2004) Path-kipas Ramsey numbers. [Report]

Faigle, Ulrich and Pickl, Stefan (2004) Preface. Discrete Applied Mathematics, 136 (2-3). pp. 159-160. ISSN 0166-218X

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. (2004) Run-time adaptation of a reconfigurable mobile UMTS receiver. In: International Conference on Engineering of Reconfigurable Systems and Algorithms, ERSA 2004, June 21-24, 2004, Las Vegas, Nevada, USA.

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Broersma, Hajo and Paulusma, Daniël and Wolkotte, Pascal T. (2004) Run-time assignment of tasks to multiple heterogeneous processors. In: 5TH PROGRESS Symposium on Embedded Systems, Oct. 30, 2004, Nieuwegein, the Netherlands (pp. pp. 185-192).

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Broersma, Hajo and Paulusma, Daniël and Wolkotte, Pascal T. (2004) Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. In: IEEE International Conference on Field-Programmable Technology, FPT 2004, December 6-8, 2004, Brisbane, Australia (pp. pp. 421-424).

Woeginger, Gerhard J. (2004) Seventeen lines and one-hundred-and-one points. Theoretical Computer Science, 321 (2-3). pp. 415-421. ISSN 0304-3975

Bonsma, Paul (2004) Sparsest cuts and concurrent flows in product graphs. Discrete Applied Mathematics, 136 (2-3). pp. 173-182. ISSN 0166-218X

Salman, A.N.M. and Broersma, H.J. (2004) The Ramsey Numbers of Paths Versus Kipases. In: Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 17 . Elsevier, pp. 251-255.

Kern, Walter and Paulusma, Daniël (2004) The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization, 1 (2). pp. 205-214. ISSN 1572-5286

Xiong, Liming and Broersma, H.J. and Li, Xueliang and Li, MingChu (2004) The hamiltonian index of a graph and its branch-bonds. Discrete Mathematics, 285 (1-3). pp. 279-288. ISSN 0012-365X

Nieberg, Tim and Hurink, Johann (2004) Wireless Communication Graphs. In: Intelligent Sensors, Sensor Networks and Information Processing Conference, ISSNIP 2004, 14-17 December 2004, Melbourne, Australia (pp. pp. 367-372).

2003

Bonsma, Paul and Brueggemann, Tobias and Woeginger, Gerhard J. (2003) A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. In: 28th International Symposium on Mathematical Foundations of Computer Science, MFCS, August 25-29, 2003, Bratislava, Slovakia (pp. pp. 259-268).

Guo, Yuanqing and Smit, Gerard J.M. and Heysters, Paul M. and Broersma, Hajo (2003) A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. In: ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems, LCTES 2003, June 11-13, 2003, San Diego, USA (pp. pp. 199-208).

Sun, Hao and Driessen, Theo (2003) A Individually Marginalistic Value for Set Games on Matroids. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, pp. 112-116.

Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003) A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs. [Report]

Broersma, H.J. (2003) A general framework for coloring problems: old results, new results, and open problems. [Report]

Nieberg, Tim and Hurink, Johann and Kern, Walter (2003) A new PTAS for maximum independent sets in unit disk graphs. [Report]

Woeginger, Gerhard J. (2003) A new characterization of the majority rule. Economics Letters, 81 (1). pp. 89-94. ISSN 0165-1765

Woeginger, Gerhard J. (2003) A note on scoring rules that respect majority in choice and elimination. Mathematical Social Sciences, 46 (3). pp. 347-354. ISSN 0165-4896

Woeginger, Gerhard J. (2003) A note on the complexity of determining optimal strategies in games with common payoffs. Mathematical methods of operations research, 58 (2). pp. 183-189. ISSN 1432-2994

Brucker, P. and Hurink, J.L. and Knust, S. (2003) A polynomial algorithm for $P | p_j = 1, r_j, outtree | \Sigma C_j$. Mathematical methods of operations research, 56 (3). pp. 407-412. ISSN 1432-2994

Still, Georg (2003) Approximation theory methods for solving elliptic eigenvalue problems. Zeitschrift für Angewandte Mathematik und Mechanik, 83 (7). pp. 468-478. ISSN 0044-2267

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. (2003) BER estimation for wireless links using BPSK/QPSK modulation. In: 4th PROGRESS Symposium on Embedded Systems, 22 Oct. 2003, Nieuwegein, The Netherlands (pp. pp. 212-219).

Broersma, H.J. and Fujisawa, J. and Yoshimoto, K. (2003) Backbone colorings along perfect matchings. [Report]

Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2003) Backbone colorings for networks: tree and path backbones. [Report]

Woeginger, Gerhard J. (2003) Banks winners in tournaments are difficult to recognize. Social Choice and Welfare, 20 (3). pp. 523-528. ISSN 0176-1714

Bumb, A.F. and Hoede, C. (2003) C-diagrams, shifts and solidarity values. [Report]

Nieberg, Tim and Dulman, Stefan and Havinga, Paul and Hoesel, Lodewijk van and Wu, Jian (2003) Collaborative Algorithms for Communication in Wireless Sensor Networks. In: Ambient Intelligence: Impact on Embedded System Design. Kluwer Academic Publishers, Boston, pp. 271-294. ISBN 9781402076688

Nieberg, Tim and Dulman, Stefan and Havinga, Paul and Hoesel, Lodewijk van and Wu, Jian (2003) Collaborative algorithms for communication in wireless sensor networks. [Report]

Dulman, Stefan and Hoesel, Lodewijk van and Nieberg, Tim and Havinga, Paul (2003) Collaborative communication protocols for wireless sensor networks. [Report]

Deineko, Vladimir G. and Woeginger, Gerhard J. (2003) Complexity and approximability results for slicing floorplan designs. European Journal of Operational Research, 149 (3). pp. 533-539. ISSN 0377-2217

Bonsma, P.S. (2003) Complexity results for restricted instances of a paint shop problem. [Report]

Woeginger, Gerhard J. (2003) Computational problems without computation. Nieuw archief voor wiskunde, Ser. 5. vol. 4 (2). pp. 140-147. ISSN 0028-9825

Sun, H. (2003) Contributions to set game theory. thesis.

Nieberg, Tim (2003) Distributed Algorithms in Wireless Sensor Networks. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, pp. 81-83.

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. (2003) Energy-efficient wireless communication for mobile multimedia terminals. In: First International Conference Advances in Mobile Multimedia, MoMM 2003, 15-17 September 2003, Jakarta, Indonesia (pp. pp. 115-124).

Brucker, P. and Heitmann, S. and Hurink, J.L. (2003) Flow-Shop Problems with Intermediate Buffers. OR Spectrum, 25 (4). pp. 549-574. ISSN 0171-6468

Born, Axel and Hurkens, Cor A.J. and Woeginger, Gerhard J. (2003) How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Information Processing Letters, 86 (3). pp. 137-141. ISSN 0020-0190

Brucker, Peter and Heitmann, Silvia and Hurink, Johann (2003) How useful are preemptive schedules? Operations Research Letters, 31 (2). pp. 129-136. ISSN 0167-6377

Brüggemann, Tobias and Monnot, Jérôme and Woeginger, Gerhard J. (2003) Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters (3). pp. 195-201. ISSN 0167-6377

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Rosien, Michel A.J. and Heysters, Paul M. (2003) Mapping Applications to a Coarse Grain Reconfigurable System. In: 8th Asia-Pacific Conference on Advances in Computer Systems Architecture, ACSAC 2003, September 23-26, 2003, Aizu-Wakamatsu, Japan (pp. pp. 221-235).

Ebben, Mark and Heijden, Matthieu van der and Hurink, Johann and Schutten, Marco (2003) Modeling of capacitated transportation systems for integral scheduling. [Report]

Ebben, Mark and Heijden, Matthieu van der and Hurink, Johann and Schutten, Marco (2003) Modeling of capacitated transportation systems for integral scheduling. [Report]

Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003) More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs. [Report]

Manthey, Bodo (2003) Non-approximability of weighted multiple sequence alignment. Theoretical Computer Science, 296 (1). pp. 179-192. ISSN 0304-3975

Woeginger, Gerhard J. (2003) On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics, 131 (1). pp. 237-252. ISSN 0166-218X

Chrobak, Marek and Couperus, Peter and Dürr, Christoph and Woeginger, Gerhard (2003) On tiling under tomographic constraints. Theoretical Computer Science, 290 (3). pp. 2125-2136. ISSN 0304-3975

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online Matching On a Line. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Theoretical Computer Science (ENTCS), 13 . Elsevier, pp. 49-51.

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online matching on a line. [Report]

Salman, A.N.M. and Broersma, H.J. (2003) Path-fan Ramsey numbers. [Report]

Franses, Philip and Post, Gerhard (2003) Personnel Scheduling in Laboratories. In: 4th International Conference on Practice and Theory of Automated Timetabling, PATAT 2002, August 21-23, 2002, Gent, Belgium (pp. pp. 113-119).

Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2003) Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult. [Report]

Broersma, Hajo and Faigle, Ulrich and Hurink, Johann and Pickl, Stefan and Woeginger, Gerhard (2003) Preface. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, p. 1.

Pendavingh, Rudi and Schuurman, Petra and Woeginger, Gerhard J. (2003) Recognizing DNA graphs is difficult. Discrete Applied Mathematics, 127 (1). pp. 85-94. ISSN 0166-218X

Brucker, P. and Hurink, J.L. and Rolfes, T. (2003) Routing of railway carriages. Journal of Global Optimization, 27 (2-3). pp. 313-332. ISSN 0925-5001

Smit, Lodewijk T. and Smit, Gerard J.M. and Havinga, Paul J.M. and Hurink, Johann L. and Broersma, Hajo (2003) Run-time control for software defined radio. In: PROGRESS 2003 Workshop on Embedded Systems, 22 October 2003, Utrecht, The Netherlands (pp. pp. 218-223).

Khmelnitskaya, Anna B. and Driessen, Theo S.H. (2003) Semiproportional values for TU games. Mathematical methods of operations research, 57 (5). pp. 495-511. ISSN 1432-2994

Khmelnitskaya, A.B. (2003) Shapley value for constant-sum games. International Journal of Game Theory, 32 (2). pp. 223-227. ISSN 0020-7276

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Kokkeler, Andre B.J. (2003) Soft output bit error rate estimation for WCDMA. In: Personal Wireless Communications Conference, September 23-25, 2003, Venice, Italy (pp. pp. 448-457).

Möhring, R.H. and Schulz, A.S. and Stork, F. and Uetz, M.J. (2003) Solving project scheduling problems by minimum cut computations. Management Science, 49 (3). pp. 330-350. ISSN 0025-1909

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Heysters, Paul M. (2003) Template Generation and Selection Algorithms. In: 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, IWSOC 2003, 30 June - 2 July 2003, Calgary, Alberta, Canada (pp. pp. 2-5).

Bonsma, Paul (2003) The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes (Extended Abstract). In: 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG, June 19-21, 2003, Elspeet, The Netherlands (pp. pp. 93-105).

Rudnicki, P. and Woeginger, G.J. (2003) The Post correspondence problem over a unary alphabet. Applied Mathematics Letters, 16 (5). pp. 723-727. ISSN 0893-9659

Salman, A.N.M. and Broersma, H.J. (2003) The Ramsey Numbers of Paths Versus Fans. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, pp. 103-107.

Fekete, Sándor P. and Skutella, Martin and Woeginger, Gerhard J. (2003) The complexity of economic equilibria for house allocation markets. Information Processing Letters, 88 (5). pp. 219-223. ISSN 0020-0190

Fiala, J. and Paulusma, D. (2003) The computational complexity of the role assignment problem. [Report]

Böhme, Martin and Manthey, Bodo (2003) The computational power of compiling C++. Bulletin of the European Association for Theoretical Computer Science, 81 . pp. 264-270. ISSN 0252-9742

Bumb, A.F. and Hoede, C. (2003) The standard set game of a cooperative game. [Report]

Bumb, A. and Hoede, C. (2003) The standard set game of a cooperative game. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, pp. 26-29.

Akker, Marjan van den and Hoogeveen, Han and Woeginger, Gerhard J. (2003) The two-machine open shop problem: To fit or not to fit, that is the question. Operations Research Letters, 31 (3). pp. 219-224. ISSN 0167-6377

Dulman, Stefan and Nieberg, Tim and Wu, Jian (2003) Trade-Off between Traffic Overhead and Reliability in Multipath Routing for Wireless Sensor Networks. In: IEEE Wireless Communications and Networking, WCNC 2003, 20-20 March 2003, New Orleans, LA, USA (pp. pp. 1918-1922).

Dulman, Stefan and Nieberg, Tim and Wu, Jian (2003) Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks. [Report]

Uetz, Marc (2003) When greediness fails: examples from stochastic scheduling. Operations Research Letters, 31 (6). pp. 413-419. ISSN 0167-6377

Deineko, Vladimir G. and Klinz, Bettina and Woeginger, Gerhard J. (2003) Which matrices are immune against the transportation paradox? Discrete Applied Mathematics, 130 (3). pp. 495-501. ISSN 0166-218X

2002

Driessen, Theo S.H. and Radzik, Tadeusz (2002) A Weighted Pseudo-potential Approach to Values for TU-games. International Transactions in Operational Research, 9 (3). pp. 303-320. ISSN 0969-6016

Faneyte, Diego B.C. and Spieksma, Frits C.R. and Woeginger, Gerhard J. (2002) A branch-and-price algorithm for a hierarchical crew scheduling problem. Naval Research Logistics, 49 (8). pp. 743-759. ISSN 0894-069X

Broersma, H.J. and Xiong, Liming (2002) A note on minimum degree conditions for supereulerian graphs. Discrete Applied Mathematics, 120 (1-3). pp. 35-43. ISSN 0166-218X

Hurink, Johann and Knust, Sigrid (2002) A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics, 119 (1-2). pp. 181-203. ISSN 0166-218X

Woeginger, Gerhard J. (2002) An efficient algorithm for a class of constraint satisfaction problems. Operations Research Letters, 30 (1). pp. 9-16. ISSN 0167-6377

Bumb, Adriana Felicia (2002) Approximation algorithms for facility location problems. thesis.

Faigle, U. and Kern, W. and Kuipers, J. (2002) Computing an element in the lexicographic kernel of a game. [Report]

Driessen, Theo (2002) Consistency and Potentials in Cooperative TU-Games: Sobolev’s Reduced Game Revived. In: Chapters in game theory: in honor of Stef Tijs. Kluwer Academic Publishers, Boston, pp. 99-120. ISBN 9781402070631

Zhang, Shenggui (2002) Cycles in weighted graphs and related topics. thesis.

Xiong, Liming and Broersma, H.J. and Hoede, C. and Li, Xueliang (2002) Degree sums and subpancyclicity in line graphs. Discrete Mathematics, 242 (1-3). pp. 255-267. ISSN 0012-365X

Bonsma, Paul and Ueffing, Nicola and Volkmann, Lutz (2002) Edge-cuts leaving components of order at least three. Discrete Mathematics, 256 (1-2). pp. 431-439. ISSN 0012-365X

Woeginger, Gerhard J. (2002) Embeddings of planar graphs that minimize the number of long-face cycles. Operations Research Letters, 30 (3). pp. 167-168. ISSN 0167-6377

Brucker, P. and Heitmann, S. and Hurink, J.L. (2002) Flow-shop problems with intermediate buffers. [Report]

Broersma, Hajo and Faudree, Ralph J. and Huck, Andreas and Trommel, Huib and Veldman, Henk Jan (2002) Forbidden subgraphs that imply hamiltonian-connectedness. Journal of Graph Theory, 40 (2). pp. 104-119. ISSN 0364-9024

Faigle, Ulrich and Broersma, Hajo and Hurink, Johann (2002) Foreword. Discrete Applied Mathematics, 120 (1-3). p. 1. ISSN 0166-218X

Smit, Lodewijk T. and Smit, Gerard J.M. and Havinga, Paul J.M. and Hurink, Johann L. and Broersma, Hajo (2002) Influences of RAKE receiver/turbo decoder parameters on energy consumption and quality. In: World Wireless Congress On Third Generation Wireless and Beyond, 28-31 May 2002 , San Francisco, California (pp. pp. 175-181).

Zhang, Lei (2002) Knowledge graph theory and structural parsing. thesis.

Dulman, Stefan and Havinga, Paul and Hurink, Johann (2002) Leader Election Protocol for Fenergy Efficient Mobile Sensor Networks (EYES). [Report]

Bauer, Doug and Broersma, Hajo and Schmeichel, Edward (2002) More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics, 11 . pp. 63-80. ISSN 1571-0653

Broersma, H.J. and Fomin, F.V. and Nešetřil, J. and Woeginger, G.J. (2002) More about subcolorings. [Report]

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002) More on spanning 2-connected subgraphs in truncated rectangular grid graphs. [Report]

Dulman, Stefan and Nieberg, Tim and Havinga, Paul and Hartel, Pieter (2002) Multipath Routing for Data Dissemination in Energy Efficient Sensor Networks. [Report]

Erdös, P.L. and Faigle, U. and Hochstättler, W. and Kern, W. (2002) Note on the game chromatic index of trees. [Report]

Stein, Oliver and Still, Georg (2002) On generalized semi-infinite optimization and bilevel optimization. European Journal of Operational Research, 142 (3). pp. 444-462. ISSN 0377-2217

Broersma, H.J. (2002) On some intriguing problems in hamiltonian graph theory - a survey. Discrete Mathematics, 251 (1-3). pp. 47-69. ISSN 0012-365X

Xiong, L. and Ryjáček, Z. and Broersma, H.J. (2002) On stability of the Hamiltonian index under contractions and closures. [Report]

Epstein, Leah and Noga, John and Woeginger, Gerhard J. (2002) On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters, 30 (6). pp. 415-420. ISSN 0167-6377

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2002) Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics, 120 (1-3). pp. 13-23. ISSN 0166-218X

Bodlaender, H.L. and Broersma, H.J. and Fomin, F.V. and Pyatkin, A.V. and Woeginger, G.J. (2002) Radio labeling with pre-assigned frequencies. [Report]

Csirik, János and Woeginger, Gerhard J. (2002) Resource augmentation for online bounded space bin packing. Journal of Algorithms, 44 (2). pp. 308-320. ISSN 0196-6774

Khmelnitskaya, A.B. and Driessen, T.S.H. (2002) Semiproportional values for TU games. [Report]

Khmelnitskaya, A.B. (2002) Shapley value for constant-sum games. [Report]

Khmelnitskaya, Anna (2002) Social welfare functions for different subgroup utility scales. In: Fourth International Conference on Econometric Decision Models Constructing and Applying Objective Functions, 28-31 August 2000, Hagen, Germany (pp. pp. 515-530).

Broersma, H.J. and Li, Xueliang (2002) Some approaches to a conjecture on short cycles in digraphs. Discrete Applied Mathematics, 120 (1-3). pp. 45-53. ISSN 0166-218X

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002) Spanning 2-connected subgraphs in truncated rectangular grid graphs. [Report]

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002) Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs. [Report]

Borodin, O.V. and Broersma, H.J. and Glebov, A. and Heuvel, J. van den (2002) Stars and bunches in planar graphs. Part I: Triangulations. [Report]

Borodin, O.V. and Broersma, H.J. and Glebov, A. and Heuvel, J. van den (2002) Stars and bunches in planar graphs. Part II: General planar graphs and colourings. [Report]

Geurts, M. and Martini, R. and Post, G.F. (2002) Symmetries of the WDVV Equations. Acta Applicandae Mathematicae, 72 (1-2). pp. 67-75. ISSN 0167-8019

Surahmat, and Baskoro, E.T. and Broersma, H.J. (2002) The Ramsey numbers of large cycles versus small wheels. [Report]

Surahmat, and Baskoro, E.T. and Broersma, H.J. (2002) The Ramsey numbers of large star-like trees versus large odd wheels. [Report]

Liu, X (2002) The chemistry of Chinese language. thesis.

Bonsma, P.S. (2002) The complexity of the matching-cut problem for planar graphs and other graph classes. [Report]

Pop, Petrica Claudiu (2002) The generalized minimum spanning tree problem. thesis.

Kern, W. and Paulusma, D. (2002) The generalized sports competition problem. [Report]

Rader Jr, David J. and Woeginger, Gerhard J. (2002) The quadratic 0–1 knapsack problem with series–parallel support. Operations Research Letters, 30 (3). pp. 159-166. ISSN 0167-6377

2001

Hunting, Marcel and Faigle, Ulrich and Kern, Walter (2001) A Lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research, 131 (1). pp. 119-131. ISSN 0377-2217

Driessen, T.S.H. and Calvo, E. (2001) A multiplicative potential approach to solutions for cooperative TU-games. [Report]

Brucker, P. and Hurink, J.L. and Knust, S. (2001) A polynomial algorithm for $P | p_j = 1, r_j, outtree | \Sigma C_j$ and $P | p_j = 1,r_j, outtree, pmtn | \Sigma C_j$. [Report]

Driessen, T.S.H. and Sun, H. (2001) A potential approach to solutions for set games. [Report]

Bumb, A.F. and Kern, W. (2001) A simple dual ascent algorithm for the multilevel facility location problem. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 14-17.

Bumb, A.F. and Kern, W. (2001) A simple dual ascent algorithm for the multilevel facility location problem. [Report]

Bumb, Adriana and Kern, Walter (2001) A simple dual ascent algorithm for the multilevel facility location problem. In: Approximation, randomization, and combinatorial optimization: algorithms and techniques. Lecture notes in computer science, 2129 . Springer, Berlin, Germany, pp. 55-63. ISBN 9783540446668

Driessen, T.S.H. and Sun, H. (2001) A uniform approach to semi-marginalistic values for set games. [Report]

Hoogeveen, Han and Woeginger, Gerhard J. (2001) A very difficult scheduling problem with communication delays. Operations Research Letters, 29 (5). pp. 241-245. ISSN 0167-6377

Pop, P.C. and Kern, W. and Still, G.J. (2001) An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. [Report]

Bumb, Adriana (2001) An approximation algorithm for the maximization version of the two level uncapacitated facility location problem. Operations Research Letters, 29 (4). pp. 155-161. ISSN 0167-6377

Namekata, T. and Driessen, T.S.H. (2001) Bargaining property of nucleolus and τ-value in a class of TU-games. Computers & Mathematics with Applications, 41 (5-6). pp. 703-721. ISSN 0898-1221

Liming, Xiong (2001) Circuits in graphs and the Hamiltonian index. thesis.

Paulusma, Daniël (2001) Complexity aspects of cooperative games. thesis.

Kuijpers, Clasina Maria Hermina (2001) Cyclic machine scheduling with tool transportation. thesis.

Still, G.J. (2001) Discretization in semi-infinite programming: The rate of approximation. [Report]

Woeginger, Gerhard J. (2001) Editorial: special issue on effcient scheduling algorithms. Journal of Scheduling, 4 (6). pp. 285-286. ISSN 1094-6136

Deineko, Vladimir G. and Woeginger, Gerhard J. (2001) Hardness of approximation of the discrete time-cost tradeoff problem. Operations Research Letters, 29 (5). pp. 207-210. ISSN 0167-6377

Brucker, P. and Heitmann, S. and Hurink, J.L. (2001) How useful are preemptive schedules? [Report]

Hurink, Johann and Knust, Sigrid (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Operations Research Letters, 29 (5). pp. 231-239. ISSN 0167-6377

Hurink, J.L. and Keuchel, J. (2001) Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 112 (1-3). pp. 179-197. ISSN 0166-218X

Hurink, J.L. and Knust, S. (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics, 112 (1-3). pp. 199-216. ISSN 0166-218X

Broersma, H.J. and Kriesell, M. and Ryjacek, Z. (2001) On factors of 4-connected claw-free graphs. Journal of Graph Theory, 37 (2). pp. 125-136. ISSN 0364-9024

Möhring, Rolf H. and Schulz, Andreas S. and Stork, Frederik and Uetz, Marc (2001) On project scheduling with irregular starting time costs. Operations Research Letters, 28 (4). pp. 149-154. ISSN 0167-6377

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2001) On the computation of the nucleolus of a cooperative game. International journal of game theory, 30 (1). pp. 79-98. ISSN 0020-7276

Jonker, P. and Still, G. and Twilt, F. (2001) One-parametric linear-quadratic optimization problems. Annals of operations research, 101 (1-4). pp. 221-253. ISSN 0254-5330

Li, Xueliang and Zhang, Shenggui and Broersma, Hajo (2001) Paths and cycles in colored graphs. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 128-132.

Pop, P.C. and Kern, W. and Still, G. and Faigle, U. (2001) Relaxation methods for the Generalized Minimum Spanning Tree Problem. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 76-79.

Broersma, Hajo and Ryjacek, Zdenek (2001) Strengthening the closure concept in claw-free graphs. Discrete Mathematics, 233 (1-3). pp. 55-63. ISSN 0012-365X

Xiong, L. and Broersma, H.J. and Hoede, C. (2001) Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path. [Report]

Hurink, J.L. and Knust, S. (2001) Tabu search algorithms for job-shop problems with a single transport robot. [Report]

Xiong, L. and Broersma, H.J. and Li, X. (2001) The Hamiltonian index of a graph and its branch-bonds. [Report]

Kern, Walter and Paulusma, Daniël (2001) The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics, 108 (3). pp. 317-323. ISSN 0166-218X

Martini, R. and Post, G.F. (2001) The norm of an averaging operator. [Report]

Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2001) Toughness and hamiltonicity in $k$-trees. [Report]

Fialowski, Alice and Post, Gerhard (2001) Versal Deformation of the Lie Algebra L2. Journal of Algebra, 236 (1). pp. 93-109. ISSN 0021-8693

2000

Driessen, T.S.H. and Meinhardt, H. (2000) (Average-) convexity of common pool and oligopoly TU-games. [Report]

Broersma, H.J. and Zhang, S. and Li, X. (2000) A $\sigma_3$ type condition for heavy cycles in weighted graphs. [Report]

Lenin, R.B. and Parthasarathy, P.R. (2000) A birth-death process suggested by a chain sequence. Computers & Mathematics with Applications, 40 (2-3). pp. 239-247. ISSN 0898-1221

Lenin, R.B. and Parthasarathy, P.R. (2000) A computational approach for fluid queues driven by truncated birth-death processes. Methodology and Computing in Applied Probability, 2 (4). pp. 373-392. ISSN 1387-5841

Broersma, H.J. and Zhang, S. and Li, X. and Wang, L. (2000) A fan type condition for heavy cycles in weighted graphs. [Report]

Broersma, H.J. and Dahlhaus, E. and Kloks, T. (2000) A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discrete Applied Mathematics, 99 (1-3). pp. 367-400. ISSN 0166-218X

Bumb, A.F. (2000) An approximation algorithm for the 2-level uncapacitated facility location problem. [Report]

Faigle, Ulrich and Kern, Walter (2000) An order-theoretic framework for the greedy algorithm with applications to the core and Weber Set of cooperative games. Order, 17 (4). pp. 353-375. ISSN 0167-8094

Grootjans, W.J. and Hochstenbach, M. and Hurink, J.L. and Kern, W. and Luczak, M. and Puite, Q. and Resing, J. and Spieksma, F. (2000) Cache as ca$h can. [math mode missing closing $] [Report]

Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J. (2000) Chordality and 2-factors in tough graphs. Discrete Mathematics, 99 (1-3). pp. 323-329. ISSN 0012-365X

Driessen, T.S.H. (2000) Consistency and potentials in cooperative TU-games: Sobolev's reduced game revived. [Report]

Broersma, Hajo and Koppius, Otto and Tuinstra, Hilde and Huck, Andreas and Kloks, Ton and Kratsch, Dieter and Müller, Haiko (2000) Degree-preserving trees. Networks, 35 (1). pp. 26-39. ISSN 0028-3045

Li, X. and Zhang, S. and Broersma, H.J. (2000) Directed paths with few or many colors in colored directed graphs. [Report]

Zhang, Shenggui and Li, Xueliang and Broersma, Hajo (2000) Heavy paths and cycles in weighted graphs. Discrete Mathematics, 223 (1-3). pp. 327-336. ISSN 0012-365X

Frederiks, T.J. and Still, G.J. (2000) Linear bilevel problems: Genericity results and an efficient method for computing local minima. [Report]

Hurink, J.L. and Knust, S. (2000) List scheduling in a parallel machine environment with precedence constraints and setup times. [Report]

Bauer, D. and McGuire, L. and Trommel, H. and Veldman, H.J. (2000) Long cycles in 3-cyclable graphs. Discrete Mathematics, 218 (1-3). pp. 1-8. ISSN 0012-365X

Kern, W. and Paulusma, D. (2000) Matching games: the least core and the nucleolus. [Report]

Bauer, D. and Broersma, H.J. and Schmeichel, E. (2000) More progress on tough graphs - The Y2K report. [Report]

Bauer, D. and Broersma, H.J. and Veldman, H.J. (2000) Not every 2-tough graph is Hamiltonian. Discrete Applied Mathematics, 99 (1-3). pp. 317-321. ISSN 0166-218X

Faigle, Ulrich and Kern, Walter and Paulusma, Daniël (2000) Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical methods of operations research, 52 (18). pp. 23-38. ISSN 1432-2994

Stein, O. and Still, G.J. (2000) On generalized semi-infinite optimization and bilevel optimization. [Report]

Faigle, Ulrich and Kern, Walter (2000) On the core of ordered submodular cost games. Mathematical programming, 87 (3). pp. 483-499. ISSN 0025-5610

Post, G.F. (2000) On the structure of graded transitive Lie algebras. [Report]

Namekata, Tsuneyuki and Driessen, Theo S.H. (2000) Reduced game property of the Egalitarian Non-k-Averaged Contribution (EN k AC-) value and the Shapley value. International Transactions in Operational Research, 7 (4-5). pp. 365-382. ISSN 0969-6016

Hurink, J.L. and Kern, W. and Nawijn, W.M. (2000) Scheduling split-jobs on parallel machines. [Report]

Brucker, P. and Hurink, J.L. (2000) Solving a chemical batch scheduling problem by local search. Annals of Operations Research, 96 (1-4). pp. 17-38. ISSN 0254-5330

Broersma, H.J. and Ryjacek, Z. (2000) Strengthening the closure concept in claw-free graphs. [Report]

Pop, P.C. and Kern, W. and Still, G.J. (2000) The generalized minimum spanning tree problem. [Report]

1999

Faigle, U. and Kern, W. and Nawijn, W.M. (1999) A Greedy On-Line Algorithm for thek-Track Assignment Problem. Journal of Algorithms, 31 (1). pp. 196-210. ISSN 0196-6774

Brucker, P. and Hilbig, T. and Hurink, J.L. (1999) A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 94 (1-3). pp. 77-99. ISSN 0166-218X

Lenin, R.B. and Parthasarathy, P.R. (1999) A computational approach for a fluid queue driven by a truncated birth-death process. [Report]

Sitters, R.A. (1999) A short proof of a conjecture on the Tr-choice number of even cycles. Discrete Applied Mathematics, 92 (2-3). pp. 243-246. ISSN 0166-218X

Hurink, J.L. and Knust, S. (1999) A tabu search algorithm for scheduling a single robot in a job-shop environment. [Report]

Pop, P.C. and Still, G.J. (1999) An easy way to obtain strong duality results in linear, linear semidefinite and linear semi-infinite programming. [Report]

Hurink, J.L. (1999) An exponential neighbourhood for a one-machine batching problem. OR Spektrum, 21 (4). pp. 461-476. ISSN 0171-6468

Möhring, R.H. and Schulz, A.S. and Uetz, M.J. (1999) Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the ACM, 46 (6). pp. 924-942. ISSN 0004-5411

Dutta, D. and Murty, K. and Still, G.J. and Wilharms, J.J. (1999) Computing the maximum turnable state of simple parts. [Report]

Kroese, Dirk P. and Nicola, Victor F. (1999) Efficient estimation of overflow probabilities in queues with breakdowns. Performance Evaluation, 36-37 . pp. 471-484. ISSN 0166-5316

Broersma, H.J. and Faudree, R.J. and Huck, A. and Trommel, H. and Veldman, H.J. (1999) Forbidden subgraphs that imply Hamiltonian-connectedness. [Report]

Still, G. (1999) Generalized semi-infinite programming: Theory and methods. European Journal of Operational Research, 119 (2). pp. 301-313. ISSN 0377-2217

Wernisch, Lorenz and Hunting, Marcel and Wodak, Shoshana J. (1999) Identification of structural domains in proteins by a graph heuristic. Proteins: Structure, Function, and Genetics, 35 (3). pp. 338-352. ISSN 0887-3585

Faigle, U. and Kern, W. and Paulusma, D. (1999) Note on the computational complexity of least core concepts for min-cost spanning tree games. [Report]

Broersma, H.J. and Kriesell, M. and Ryjacek, Z. (1999) On factors of 4-connected claw-free graphs. [Report]

Broersma, H.J. and Xiong, L. (1999) On minimum degree conditions for supereulerian graphs. [Report]

Broersma, H.J. (1999) On some intriguing problems in Hamiltonian graph theory -- A survey. [Report]

Post, G.F. (1999) On the structure of transitively differential algebras. [Report]

Trommel, H. and Veldman, H.J. and Verschut, A. (1999) Pancyclicity of claw-free hamiltonian graphs. Discrete Mathematics, 197-198 . pp. 781-789. ISSN 0012-365X

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (1999) Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. [Report]

Möhring, R.H. and Schulz, A.S. and Stork, F. and Uetz, M.J. (1999) Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems. In: Algorithms (ESA 1999), 16-18 July 1999, Prague, Czech Republic (pp. pp. 139-150).

Brucker, P. and Hurink, J.L. and Rolfes, T. (1999) Routing of railway carriages: A case study. [Report]

Brucker, P. and Hurink, J.L. and Kubiak, W. (1999) Scheduling identical jobs with chain precedence constraints on two uniform machines. Mathematical methods of operations research, 49 (2). pp. 211-219. ISSN 1432-2994

Brucker, P. and Hurink, J.L. (1999) Solving a chemical batch scheduling problem by local search. [Report]

Kern, W. and Paulusma, D. (1999) The new FIFA rules are hard: Complexity aspects of sports competitions. [Report]

Broersma, H.J. and Bruin, N. and Hurink, J.L. and Meester, L.E. and Op de Beek, S.S. and Westhuis, J. (1999) Throughput of ADSL modems. [Report]

Driessen, T.S.H. and Paulusma, D. (1999) Two extensions of the Shapley value for cooperative games. [Report]

Broersma, Hajo and Engbers, Erik and Trommel, Huib (1999) Various results on the toughness of graphs. Networks, 33 (3). pp. 233-238. ISSN 0028-3045

Fialowski, A. and Post, G.F. (1999) Versal deformation of the Lie algebra $L_2$. [Report]

1998

Hunting, Marcel and Faigle, Ulrich and Kern, Walter (1998) A Lagrangian relaxation approach to the edge-weighted clique problem. [Report]

Nawijn, Wim M. (1998) A cyclic production problem: an application of max-algebra. European Journal of Operational Research, 104 (1). pp. 187-200. ISSN 0377-2217

Bohme, T. and Broersma, Hajo and Tuinstra, Hilde (1998) A note on a conjecture concerning tree-partitioning 3-regular graphs. [Report]

Hurink, J.L. (1998) A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour. Journal of Scheduling, 1 (3). pp. 127-148. ISSN 1094-6136

Faigle, Ulrich and Kern, Walter (1998) An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games. [Report]

Faigle, U. and Kern, W. and Kuipers, J. (1998) An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games. [Report]

Hurink, Johann (1998) An exponential neighborhood for a one-machine batching problem. [Report]

Broersma, H.J. and Trommel, H. (1998) Closure concepts for claw-free graphs. Discrete Mathematics, 185 (1-3). pp. 231-238. ISSN 0012-365X

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (1998) Computing the nucleolus of min-cost spanning tree games is NP-hard. International journal of game theory, 27 (3). pp. 443-450. ISSN 0020-7276

Still, G.J. (1998) Generalized semi-infinite programming: Numerical aspects. [Report]

Zhang, S. and Li, X. and Broersma, H.J. (1998) Heavy paths and cycles in weighted graphs. [Report]

Still, G.J. (1998) How to split the eigenvalues of a one-parameter family of matrices. [Report]

Broersma, Hajo and Tuinstra, Hilde (1998) Independence trees and Hamilton cycles. Journal of Graph Theory, 29 (4). pp. 227-237. ISSN 0364-9024

Broersma, H.J. and Li, X. (1998) Isomorphisms and traversability of directed path graphs. [Report]

Hurink, J.L. and Keuchel, J. (1998) Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. [Report]

Kloks, T. and Kratsch, D. and Wong, C.K. (1998) Minimum fill-in on circle and circular-arc graphs. Journal of algorithms, 28 (2). pp. 272-289. ISSN 0196-6774

Faigle, Ulrich and Fekete, Sándor P. and Hochstättler, Winfried and Kern, Walter (1998) On approximately fair cost allocation in Euclidean TSP games. OR Spektrum, 20 (1). pp. 29-37. ISSN 0171-6468

Broersma, H.J. and Li, X. (1998) Some approaches to a conjecture on short cycles in digraphs. [Report]

Martini, R. and Post, G.F. (1998) Symmetries of the WDVV equations and Chazy-type equations. [Report]

Faigle, Ulrich and Kern, Walter and Fekete, Sándor P. and Hochstättler, Winfried (1998) The nucleon of cooperative games and an algorithm for matching games. Mathematical programming, 83 (1-3). pp. 195-211. ISSN 0025-5610

1997

Brucker, P. and Hurink, J.L. and Jurisch, B. and Wöstmann, B. (1997) A Branch and Bound Method for the Open Shop Problem. Discrete Applied Mathematics, 76 (1-3). pp. 43-59. ISSN 0166-218X

Broersma, H.J. (1997) A note on the minimum size of a vertex pancyclic graph. Discrete Mathematics, 164 (1-3). pp. 29-32. ISSN 0012-365X

Nawijn, W.M. (1997) A tandem queue with delayed server release. [Report]

Broersma, Hajo and Li, Hao and Li, Jianping and Tian, Feng and Veldman, Henk Jan (1997) Cycles through subsets with large degree sums. Discrete Mathematics, 171 (1-3). pp. 43-54. ISSN 0012-365X

Brandt, Stephan and Veldman, Henk Jan (1997) Degree sums for edges and cycle lengths in graphs. Journal of Graph Theory, 25 (4). pp. 253-256. ISSN 0364-9024

Broersma, H.J. and Ryjacek, Z. and Schiermeyer, I. (1997) Dirac's minimum degree condition restricted to claws. Discrete Mathematics, 167-16 . pp. 155-166. ISSN 0012-365X

Kuijpers, C.M.H. and Hurkens, C.A.J. and Melissen, J.B.M. (1997) Fast movement strategies for a step-and-scan wafer stepper. Statistica Neerlandica, 51 (1). pp. 55-71. ISSN 0039-0402

Brucker, Peter and Hurink, Johann and Werner, Frank (1997) Improving local search heuristics for some scheduling problems. Part II. Discrete Applied Mathematics, 72 (1-2). pp. 47-69. ISSN 0166-218X

Faigle, Ulrich and Kern, Walter and Fekete, Sándor P. and Hochstättler, Winfried (1997) On the complexity of testing membership in the core of min-cost spanning tree games. International journal of game theory, 26 (3). pp. 361-366. ISSN 0020-7276

Martini, R. and Post, G.F. (1997) Polynomial solutions to the WDVV equations in four dimensions. Journal of Physics A: Mathematical and general, 309 (8). L229-L232. ISSN 0305-4470

Faigle, U. and Hunting, M. and Kern, W. and Prakash, R. and Supowit, K.J. (1997) Simplices by point-sliding and the Yamnitsky-Levin algorithm. Mathematical methods of operations research, 46 (1). pp. 131-142. ISSN 1432-2994

Böhme, T. and Broersma, H.J. and Göbel, F. and Kostochka, A.V. and Stiebitz, M. (1997) Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics, 170 (1-3). pp. 219-222. ISSN 0012-365X

Still, G. and Streng, M. (1997) The Chebyshev hyperplane optimization problem. Journal of global optimization, 11 (4). pp. 361-376. ISSN 0925-5001

Driessen, Theo S.H. (1997) Tree enterprises and bankruptcy ventures: a game theoretic similarity due to a graph theoretic proof. Discrete Applied Mathematics, 79 (1-3). pp. 105-117. ISSN 0166-218X

Broersma, H.J. and Engbers, E.A. and Trommel, H. (1997) Various results on the toughness of graphs. [Report]

1996

Göbel, F. and Neutel, E.A. (1996) Cyclic graphs. [Report]

Post, Gerhard (1996) Deformations of quantum hyperplanes. Letters in mathematical physics, 36 (2). pp. 109-116. ISSN 0377-9017

Hijligenberg, Nico van den and Kotchetkov, Youri and Post, Gerhard (1996) Deformations of vector fields and Hamiltonian vector fields on the plane. Mathematics of Computation, 64 (211). pp. 1215-1226. ISSN 0025-5718

Broersma, Hajo and Li, Xueliang (1996) Directed path graphs. [Report]

Broersma, H.J. and Heuvel, J. van den and Jackson, B. and Veldman, H.J. (1996) Hamiltonicity of regular 2-connected graphs. Journal of Graph Theory, 22 (2). pp. 105-124. ISSN 0364-9024

Brucker, Peter and Hurink, Johann and Werner, Frank (1996) Improving local search heuristics for some scheduling problems - I. Discrete Applied Mathematics, 65 (1-3). pp. 97-122. ISSN 0166-218X

Heuvel, J. van den (1996) Long cycles in graphs with large degree sums and neighborhood unions. Journal of Graph Theory, 21 (1). pp. 87-102. ISSN 0364-9024

Faigle, U. and Kern, W. and Streng, M. (1996) Note on the computational complexity of j -radii of polytopes in ℝn. Mathematical programming, 73 (1). pp. 1-5. ISSN 0025-5610

Asratian, A.S. and Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1996) On graphs satisfying a local ore-type condition. Journal of Graph Theory, 21 (1). pp. 1-10. ISSN 0364-9024

Faigle, Ulrich and Kern, Walter and Spieker, Boris (1996) On the communication complexity oft-intersection problems in generalized Boolean algebras. Mathematical methods of operations research, 43 (2). pp. 239-254. ISSN 1432-2994

Faigle, Ulrich and Kern, Walter (1996) Packing a bin on-line to maximize the total number of items. In: Symposium on Operations Research, SOR 1996, September 3-6, 1996, Braunschweig, Germany (pp. pp. 61-65).

Faigle, Ulrich and Kern, Walter (1996) Packing a bin online to maximize the total number of items. [Report]

Hurink, J.L. (1996) Polygon scheduling. Discrete Applied Mathematics, 70 (1). pp. 37-55. ISSN 0166-218X

Faigle, Ulrich and Kern, Walter (1996) Submodular linear programs on forests. Mathematical programming, 72 (2). pp. 195-206. ISSN 0025-5610

Al-Dhahir, Alaaddin (1996) The Henon map. [Report]

Broersma, H.J. and Ryjacek, Z. and Schiermeyer, I. (1996) Toughness and hamiltonicity in almost claw-free graphs. Journal of Graph Theory, 21 (4). pp. 431-439. ISSN 0364-9024

Böhme, T. and Broersma, H.J. and Veldman, H.J. (1996) Toughness and longest cycles in 2-connected planar graphs. Journal of Graph Theory, 23 (3). pp. 257-263. ISSN 0364-9024

Post, Gerhard and Hijligenberg, Nico van den (1996) gl(λ) and differential operators preserving polynomials. Acta Applicandae Mathematicae, 44 (1-2). pp. 257-268. ISSN 0167-8019

1995

Faigle, U. and Gademann, N. and Kern, W. (1995) A random polynomial time algorithm for well-rounding convex bodies. Discrete Applied Mathematics, 58 (2). pp. 117-144. ISSN 0166-218X

Broersma, H.J. and Göbel, F. (1995) Bipartite regular graphs with fixed diameter. Networks, 26 (3). pp. 139-144. ISSN 0028-3045

Broersma, H.J. and Lu, M. (1995) Cycles through particular subgraphs of claw-free graphs. Journal of Graph Theory, 20 (4). pp. 459-465. ISSN 0364-9024

Heuvel, J. van den (1995) Long cycles in graphs containing a 2-factor with many odd components. Discrete Mathematics, 137 (1-3). pp. 389-393. ISSN 0012-365X

Bauer, Douglas and Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1995) Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics, 141 (1-3). pp. 1-10. ISSN 0012-365X

Erdös, Péter L. and Faigle, Ulrich and Kern, Walter (1995) On the average rank of LYM-sets. Discrete Mathematics, 144 (1-3). pp. 11-22. ISSN 0012-365X

Spieker, Boris (1995) The set of super-stable marriages forms a distributive lattice. Discrete Applied Mathematics, 58 (1). pp. 79-84. ISSN 0166-218X

Bauer, D. and Heuvel, J. van den and Schmeichel, E. (1995) Toughness and Triangle-Free Graphs. Journal of Combinatorial Theory, Series B, 65 (2). pp. 208-221. ISSN 0021-9800

1994

Broersma, H.J. and Schiermeyer, I. (1994) A closure concept based on neighborhood unions of independent triples. Discrete Mathematics, 124 (1-3). pp. 37-47. ISSN 0012-365X

Hoede, Cornelis and Li, Xueliang (1994) Clique polynomials and independent set polynomials of graphs. Discrete Mathematics, 125 (1-3). pp. 219-228. ISSN 0012-365X

Bondareva, O.N. and Driessen, T.S.H. (1994) Extensive coverings and exact core bounds. Games and Economic Behavior, 6 (2). pp. 212-219. ISSN 0899-8256

Hoede, C. (1994) Modelling knowledge in Electronic Study Books. Journal of Computer Assisted Learning, 10 (2). pp. 104-112. ISSN 0266-4909

Nawijn, W.M. and Kern, W. and Baas, S. (1994) Scheduling jobs with release times on a machine with finite storage. European Journal of Operational Research, 78 (1). pp. 120-127. ISSN 0377-2217

Faigle, Ulrich (1994) Some recent results in the analysis of greedy algorithms for assignment problems. OR Spektrum, 15 (4). pp. 181-188. ISSN 0171-6468

Broersma, H.J. and Schiermeyer, I. (1994) Subgraphs, Closures and Hamiltonicity. Discrete Applied Mathematics, 51 (1-2). pp. 39-46. ISSN 0166-218X

Hurink, J.L. and Jurisch, B. and Thole, M. (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectrum, 15 (4). pp. 205-215. ISSN 0171-6468

Helminck, G.F. and Post, G.F. (1994) The geometry of differential difference equations. Indagationes Mathematicae, 5 (4). pp. 411-438. ISSN 0019-3577

1993

Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1993) A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics, 122 (1-3). pp. 37-49. ISSN 0012-365X

Broersma, H.J. (1993) A note on K4-closures in Hamiltonian graph theory. Discrete Mathematics, 121 (1-3). pp. 19-23. ISSN 0012-365X

Broersma, H.J. and Göbel, F. (1993) Coloring a graph optimally with two colors. Discrete Mathematics, 118 (1-3). pp. 23-31. ISSN 0012-365X

Broersma, H.J. and Heuvel, J. van den and Jung, H.A. and Veldman, H.J. (1993) Cycles containing all vertices of maximum degree. Journal of Graph Theory, 17 (3). pp. 373-385. ISSN 0364-9024

Broersma, H.J. and Faudree, R.J. and Heuvel, J. van den and Veldman, H.J. (1993) Decomposition of bipartite graphs under degree constraints. Networks, 23 (3). pp. 159-164. ISSN 0028-3045

Broersma, H.J. and Duijvestijn, A.J.W. and Göbel, F. (1993) Generating all 3-connected 4-regular planar graphs from the octahedron graph. Journal of Graph Theory, 17 (5). pp. 613-620. ISSN 0364-9024

Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1993) Long cycles, degree sums and neighborhood unions. Discrete Mathematics, 121 (1-3). pp. 25-35. ISSN 0012-365X

Broersma, H.J. and Li, Xueliang (1993) On "the matching polynomial of a polygraph". Discrete Applied Mathematics, 46 (1). pp. 79-86. ISSN 0166-218X

Faigle, Ulrich and Kern, Walter (1993) On some approximately balanced combinatorial cooperative games. Zeitschrift fur Operations Research, 38 (2). pp. 141-152. ISSN 0341-3306

1992

Kroese, Dirk P. and Schmidt, Volker (1992) A Continuous Polling System with General Service Times. Annals of Applied Probability, 2 (4). pp. 906-927. ISSN 1050-5164

Hoede, Cornelis (1992) A characterization of consistent marked graphs. Journal of Graph Theory, 16 (1). pp. 17-23. ISSN 0364-9024

Faigle, Ulrich and Schrader, Rainer (1992) A greedy reduction algorithm for setup optimization. Discrete Applied Mathematics, 35 (1). pp. 73-79. ISSN 0166-218X

Shawe-Taylor, John S. and Anthony, Martin H.G. and Kern, Walter (1992) Classes of feedforward neural networks and their circuit complexity. Neural Networks, 5 (6). pp. 971-977. ISSN 0893-6080

Erdös, Péter L. and Szekely, László A. (1992) Evolutionary trees: an integer multicommodity max-flow-min-cut theorem. Advances in Applied Mathematics, 13 (4). pp. 375-389. ISSN 0196-8858

Kern, W. (1992) Learning convex bodies under uniform distribution. Information Processing Letters, 43 (1). pp. 35-39. ISSN 0020-0190

Jongen, H.Th. and Twilt, F. and Weber, G.W. (1992) Semi-infinite optimization: Structure and stability of the feasible set. Journal of optimization theory and applications, 72 (3). pp. 529-552. ISSN 0022-3239

Faigle, Ulrich and Schrader, Rainer and Turan, Gyorgy (1992) The communication complexity of interval orders. Discrete Applied Mathematics, 40 (1). pp. 19-28. ISSN 0166-218X

Broersma, H.J. and Li, Xueliang (1992) The connectivity of the basis graph of a branching greedoid. Journal of graph theory, 16 (3). pp. 233-237. ISSN 0364-9024

1991

Helminck, G.F. and Post, G.F. (1991) A convergent framework for the multicomponent KP-hierarchy. Transactions of the American Mathematical Society, 324 (1). pp. 271-292. ISSN 0002-9947

Hijligenberg, N.W. van den and Post, G. (1991) Defining relations for Lie algebras of vector fields. Indagationes Mathematicae, 2 (2). pp. 207-218. ISSN 0019-3577

Cangalovic, Mirjana and Schreuder, Jan A.M. (1991) Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths. European Journal of Operational Research, 51 (2). pp. 248-258. ISSN 0377-2217

Göbel, F. and Orestes Cerdeira, J. and Veldman, H.J. (1991) Label-connected graphs and the gossip problem. Discrete Mathematics, 87 (1). pp. 29-40. ISSN 0012-365X

Broersma, H.J. and Veldman, H.J. (1991) Long dominating cycles and paths in graphs with large neighborhood unions. Journal of Graph Theory, 15 (1). pp. 29-38. ISSN 0364-9024

Jongen, H.Th. and Jonker, P. and Twilt, F. (1991) On the classification of plane graphs representing structurally stable rational Newton flows. Journal of Combinatorial Theory, Series B, 51 (2). pp. 256-270. ISSN 0021-9800

1990

Boyd, E. Andrew and Faigle, Ulrich (1990) An algorithmic characterization of antimatroids. Discrete Applied Mathematics, 28 (3). pp. 197-205. ISSN 0166-218X

Brucker, P. and Burkard, R. and Hurink, J.L. (1990) Cyclic schedules for r irregularly occurring event. Journal of Computational and Applied Mathematics, 30 (2). pp. 173-189. ISSN 0377-0427

Post, G. (1990) On Bäcklund transformations and identities in bilinear form. Journal of Physics A: Mathematical and general, 23 (23). p. 5661. ISSN 0305-4470

Arnim, Annelie von and Faigle, Ulrich and Schrader, Rainer (1990) The permutahedron of series-parallel posets. Discrete Applied Mathematics, 28 (1). pp. 3-9. ISSN 0166-218X

1989

Bauer, Douglas and Broersma, H.J. and Veldman, H.J. and Rao, Li (1989) A generalization of a result of Häggkvist and Nicoghossian. Journal of Combinatorial Theory, Series B, 47 (2). pp. 237-243. ISSN 0021-9800

Broersma, H.J. and Hoede, C. (1989) Path graphs. Journal of Graph Theory, 13 (4). pp. 427-444. ISSN 0364-9024

1988

Veldman, H.J. (1988) A result on Hamiltonian line graphs involving restrictions on induced subgraphs. Journal of Graph Theory, 12 (3). pp. 413-420. ISSN 0364-9024

Broersma, H.J. (1988) Existence of Δλ-cycles and Δλ-paths. Journal of Graph Theory, 12 (4). pp. 499-507. ISSN 0364-9024

Nawijn, W.M. (1988) Optimizing the performance of a blood analyser: Application of the set partitioning problem. European Journal of Operational Research, 36 (2). pp. 167-173. ISSN 0377-2217

Jongen, H.Th. and Jonker, P. and Twilt, F. (1988) The continuous, desingularized Newton method for meromorphic functions. Acta applicandae mathematicae, 13 (1-2). pp. 81-121. ISSN 0167-8019

1987

Broersma, H.J. and Veldman, H.J. (1987) 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. Journal of Graph Theory, 11 (3). pp. 399-407. ISSN 0364-9024

Brouwer, A.E. and Veldman, H.J. (1987) Contractibility and NP-completeness. Journal of Graph Theory, 11 (1). pp. 71-79. ISSN 0364-9024

Post, G. (1987) Note on 'N-pseudoreductions' of the KP hierarchy. Journal of Physics A: Mathematical and General, 20 (18). p. 6591. ISSN 0305-4470

1986

Jongen, H.Th. and Jonker, P. and Twilt, F. (1986) Critical sets in parametric optimization. Mathematical programming, 34 (3). pp. 333-353. ISSN 0025-5610

Göbel, F. and Veldman, H.J. (1986) Even graphs. Journal of Graph Theory, 10 (2). pp. 225-239. ISSN 0364-9024

Veldman, H.J. (1986) Existence of spanning and dominating trails and circuits. Journal of Graph Theory, 10 (1). pp. 23-31. ISSN 0364-9024

Benhocine, A. and Clark, L. and Köhler, N. and Veldman, H.J. (1986) On circuits and pancyclic line graphs. Journal of Graph Theory, 10 (3). pp. 411-425. ISSN 0364-9024

1977

Baas, Sjoerd M. and Kwakernaak, Huibert (1977) Rating and ranking of multiple-aspect alternatives using fuzzy sets. Automatica, 13 (1). pp. 47-58. ISSN 0005-1098

1976

Hettich, R. (1976) Chebyshev approximation by H-polynomials: A numerical method. Journal of Approximation Theory, 17 (1). pp. 97-106. ISSN 0021-9045

1967

Duursma, E.K. and Hoede, C. (1967) Theoretical, experimental and field studies concerning molecular diffusion of radioisotopes in sediments and suspended solid particles of the sea Part A: Theories and mathematical calculations. Netherlands Journal of Sea Research, 3 (3). pp. 432-457. ISSN 0077-7579

This list was generated on Thu Apr 24 06:09:51 2014 CEST.