Below, you find an automatically generated list of our group's publications, ordered by year. This list is generated from an external database and contains the most recent information available.
Jump to: 2025 | 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 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
2025
Improved linear programming relaxations for flow shop problems with makespan minimization (2025)Computers & operations research, 177. Article 106970. Wallrath, R., Franke, M. & Walter, M.https://doi.org/10.1016/j.cor.2024.106970Data and code underlying the publications: 'Configuration models for random directed hypergraphs' and 'Hypercurveball algorithm for sampling hypergraphs with fixed degrees' (2025)[Dataset Types › Dataset]. 4TU.Centre for Research Data. Kraakman, Y. & Stegehuis, C.https://doi.org/10.4121/9beea11f-2e93-473d-9d22-8d8a6bec9d5aExtreme values for the waiting time in large fork-join queues (2025)Queueing systems, 109(1). Article 9. Schol, D., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/s11134-025-09937-2Stationary distribution of node2vec random walks on household models (2025)[Working paper › Preprint]. ArXiv.org. Schroeder, L. & Stegehuis, C.https://doi.org/10.48550/arXiv.2502.19039Emergence of Scale-Free Traffic Jams in Highway Networks: A Probabilistic Approach (2025)[Working paper › Preprint]. ArXiv.org. Janicka, A., Sloothaak, F., Vlasiou, M. & Zwart, B.https://doi.org/10.48550/arXiv.2502.13944A Comparative Analysis of Early Departure Buttons in Coordinated Control of EV Charging (2025)In IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2024 (IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2024). IEEE. Ozceylan, B., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEUROPE62998.2024.10863525Optimizing Electric Vehicle Charging Through a Real-Time Control Mechanism (2025)In IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2024 (IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2024). IEEE. Reuling, J., Nijenhuis, B., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEUROPE62998.2024.10863524Relation Between Electrical Grid Congestion and Bus Characteristics (2025)In 2024 IEEE PES Innovative Smart Grid Technologies Europe (ISGT EUROPE). IEEE. Verdaasdonk, F., Vlasiou, M., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEUROPE62998.2024.10863286Safety and Security Dependencies for Gridshield (2025)In IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2024 (IEEE PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2024). IEEE. Soltani, R., Ozceylan, B., Lopuhaä-Zwakenberg, M., Kolb, C. & Hoogsteen, G.https://doi.org/10.1109/ISGTEUROPE62998.2024.10863084Importance Sampling of Rare Events for Distribution Networks with Stochastic Loads (2025)In 2024 Winter Simulation Conference, WSC 2024 (pp. 3590-3601) (Proceedings - Winter Simulation Conference). IEEE. Christianen, M., Lam, H., Vlasiou, M. & Zwart, B.https://doi.org/10.1109/WSC63780.2024.10838841Resilience of cellular networks: An analysis of multi-connectivity, beamforming and infrastructure sharing (2025)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Weedage, L.https://doi.org/10.3990/1.9789036563055Low rank specializations of elliptic surfaces (2025)Bulletin of the Australian Mathematical Society (E-pub ahead of print/First online). Melistas, M.https://doi.org/10.1017/S0004972724001175The Bakers and Millers Game with Restricted Locations (2025)[Working paper › Preprint]. ArXiv.org. Krogmann, S., Lenzner, P. & Skopalik, A.https://doi.org/10.48550/arXiv.2501.05334Identify structures underlying out-of-equilibrium reaction networks with random graph analysis (2025)Chemical science, 16(7), 3099-3106. Fernandes da Cunha, É., Kraakman, Y. J., Kriukov, D., van Poppel, T., Stegehuis, C. & Wong, A. S. Y.https://doi.org/10.1039/D4SC05234JPolyhedral Restrictions of Feasibility Regions in Optimal Power Flow for Distribution Networks (2025)IEEE transactions on control of network systems (E-pub ahead of print/First online). Christianen, M. H. M., Van Kempen, S., Vlasiou, M. & Zwart, B.https://doi.org/10.1109/TCNS.2025.3526718State-of-the-art Methods for Pseudo-Boolean Solving with SCIP (2025)[Working paper › Preprint]. ArXiv.org. Mexi, G., Kamp, D., Shinano, Y., Pu, S., Hoen, A., Bestuzheva, K., Hojny, C., Walter, M., Pfetsch, M. E., Pokutta, S. & Koch, T.https://doi.org/10.48550/arXiv.2501.03390Rigorous analysis of local search heuristics (2025)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. van Rhijn, J.https://doi.org/10.3990/1.9789036563277Turán numbers of general star forests in hypergraphs (2025)Discrete mathematics, 348(1). Article 114219. Zhang, L. P., Broersma, H. & Wang, L.https://doi.org/10.1016/j.disc.2024.114219
2024
SlimPark electric vehicle charging data 2022-2023 (2024)[Dataset Types › Dataset]. 4TU.Centre for Research Data. Hoogsteen, G.https://doi.org/10.4121/0fb5054c-0cc0-4c58-833e-fe89c8d13183Energy modi: transactive grid management scheme for resilient micro-grids (2024)In CIRED Chicago Workshop 2024: Resilience of Electric Distribution Systems (pp. 191-195). IET Digital Library. Pappu, A., Hoogsteen, G., Camilo López, J. & Hurink, J. L.Electric Vehicle Charging Session Data of Large Office Parking Lot (2024)[Dataset Types › Dataset]. 4TU.Centre for Research Data. de Bont, K., Hoogsteen, G., Hurink, J. L., Kokhuis, R., Kusche, F., Nijenhuis, B., Ozceylan, B., de Ruijter, J., Schubbel, A., van der Velden, J., Winschermann, L. & Zweistra, M.https://doi.org/10.4121/80ef3824-3f5d-4e45-8794-3b8791efbd13Hypercurveball algorithm for sampling hypergraphs with fixed degrees (2024)[Working paper › Preprint]. ArXiv.org. Kraakman, Y. J. & Stegehuis, C.https://doi.org/10.48550/arXiv.2412.05100Complexity of Local Search for Euclidean Clustering Problems (2024)In 35th International Symposium on Algorithms and Computation, ISAAC 2024 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 322). Dagstuhl. Manthey, B., Morawietz, N., van Rhijn, J. & Sommer, F.https://doi.org/10.4230/LIPIcs.ISAAC.2024.48Algorithmic solutions for maximizing shareable costs (2024)Networks, 84(4), 385-397. Zou, R., Lin, B., Uetz, M. & Walter, M.https://doi.org/10.1002/net.22240Maximal cliques in scale-free random graphs (2024)Network Science, 12(4), 366-391. Bläsius, T., Katzmann, M. & Stegehuis, C.https://doi.org/10.1017/nws.2024.13The influence of geometry on scale-free random graphs (2024)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Michielan, R.https://doi.org/10.3990/1.9789036563574Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number (2024)Discrete applied mathematics, 357, 241-257. Yang, X., Broersma, H. & Wang, L.https://doi.org/10.1016/j.dam.2024.06.019Reducing Stochastic Games to Semidefinite Programming (2024)[Working paper › Preprint]. ArXiv.org. Bodirsky, M., Loho, G. & Skomra, M.https://doi.org/10.48550/arXiv.2411.09646An analogue of a conjecture of Rasmussen and Tamagawa for abelian varieties over function fields (2024)Indagationes mathematicae, 35(6), 1270-1281. Melistas, M.https://doi.org/10.1016/j.indag.2024.06.007Growth rates of the bipartite Erdős–Gyárfás function (2024)Journal of graph theory, 107(3), 597-628. Li, X., Broersma, H. & Wang, L.https://doi.org/10.1002/jgt.23149On complete classes of valuated matroids (2024)TheoretiCS, 3. Article 24. Husić, E., Loho, G., Smith, B. & Végh, L. A.https://doi.org/10.46298/theoretics.24.24Comparative Assessment of Operation Thermal Characteristics of Different Types of Refrigeration/Heat Pump Systems for Space Cooling/Heating (2024)In International Refrigeration and Air Conditioning Conference (IRACC) at Purdue. Purdue University. Sharevska, M., Sharevska, M., Hajimolana, Y., Hoogsteen, G., Hurink, J. L. & Brem, G.https://docs.lib.purdue.edu/iracc/2616/Performance of High Temperature Heat Pumps Integrated in Industrial Multi Energy Systems (2024)In International Refrigeration and Air Conditioning Conference. Sharevska, M., Sharevska, M., Hajimolana, Y., Hoogsteen, G., Hurink, J. L. & Brem, G.https://docs.lib.purdue.edu/iracc/2615/Short paper - The Binary Linearization Complexity of Pseudo-Boolean Functions (2024)Open Journal of Mathematical Optimization, 5. Article 6. Walter, M.https://doi.org/10.5802/ojmo.34Turán problems for hypergraphs: avoiding path or star forests (2024)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zhang, L.https://doi.org/10.3990/1.9789036562553Stochastic Minimum Spanning Trees with a Single Sample (2024)[Working paper › Preprint]. ArXiv.org. Hoeksma, R., Speek, G. & Uetz, M.https://doi.org/10.48550/arXiv.2409.16119Local conditions for Hamiltonicity of graphs (2024)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Shang, W.https://doi.org/10.3990/1.9789036562478Price of Anarchy for Graphic Matroid Congestion Games (2024)In Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings (pp. 371-388) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 15156 LNCS). Springer. Fokkema, W., Hoeksma, R. & Uetz, M.https://doi.org/10.1007/978-3-031-71033-9_21Sizing energy storage in electricity grids containing flexible loads (2024)Journal of Energy Storage, 97. Article 112706. Schaefer, E., Hoogsteen, G., Hurink, J. L. & van Leeuwen, R. P.https://doi.org/10.1016/j.est.2024.112706The Distance Between: An Algorithmic Approach to Comparing Stochastic Models to Time-Series Data (2024)Bulletin of mathematical biology, 86(9). Article 111. Sherlock, B. D., Boon, M. A. A., Vlasiou, M. & Coster, A. C. F.https://doi.org/10.1007/s11538-024-01331-yThe Complexity of Symmetry Breaking Beyond Lex-Leader (2024)In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Article 3 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 307). Dagstuhl. Anders, M., Brenner, S. & Rattan, G.https://doi.org/10.4230/LIPIcs.CP.2024.3A Row-wise Algorithm for Graph Realization (2024)[Working paper › Preprint]. ArXiv.org. van der Hulst, R. & Walter, M.https://doi.org/10.48550/arXiv.2408.12869Satsuma: Structure-Based Symmetry Breaking in SAT (2024)In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (pp. 1-23). Article 4 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 305). Dagstuhl. Rattan, G., Anders, M. & Brenner, S.https://doi.org/10.4230/LIPIcs.SAT.2024.4On the correlation gap of matroids (2024)Mathematical programming (E-pub ahead of print/First online). Husić, E., Koh, Z. K., Loho, G. & Végh, L. A.https://doi.org/10.1007/s10107-024-02116-wLow rank specializations of elliptic surfaces (2024)[Working paper › Preprint]. ArXiv.org. Melistas, M.https://doi.org/10.48550/arXiv.2408.02419Universal quadratic forms and Dedekind zeta functions (2024)International Journal of Number Theory, 20(7), 1833–1847. Kala, V. & Melistas, M.https://doi.org/10.1142/S1793042124500908Reconstruction of geometric random graphs with the Simple algorithm (2024)[Working paper › Working paper]. ArXiv.org. Stegehuis, C. & Weedage, L.https://doi.org/10.48550/arXiv.2407.18591Learning by Doing: The Industrial and Applied Mathematics Program at Eindhoven University of Technology (2024)INFORMS Journal on Applied Analytics (E-pub ahead of print/First online). Bucchianico, A. D., Spieksma, F. & Vlasiou, M.https://doi.org/10.1287/inte.2023.0046Rethinking Safety and Security of the Energy System for a Green Future (2024)[Contribution to conference › Abstract] International Workshop on Safety-Security Interaction, Sensei 2024. van Rijswijk - Deij, R. M., Hoogsteen, G. & Hurink, J. L.Reduction types of CM curves (2024)Pacific Journal of Mathematics, 329(2), 233–257. Melistas, M.https://doi.org/10.2140/pjm.2024.329.233Distributed management of energy communities using stochastic profile steering (2024)International Journal of Electrical Power and Energy Systems, 158. Article 109973. López, J. C., Pappu, A., Hoogsteen, G., Hurink, J. L. & Rider, M. J.https://doi.org/10.1016/j.ijepes.2024.109973Oriented matroids from triangulations of products of simplices (2024)Selecta Mathematica, New Series, 30(3). Article 47. Celaya, M., Loho, G. & Yuen, C. H.https://doi.org/10.1007/s00029-024-00938-2Identify structures underlying out-of-equilibrium reaction networks with random graph analysis (2024)[Working paper › Preprint]. ChemRxiv. Fernandes da Cunha, É., Kraakman, Y., Kriukov, D., van Poppel, T., Stegehuis, C. & Wong, A. S. Y.https://doi.org/10.26434/chemrxiv-2024-brsrxReduction and isogenies of elliptic curves (2024)Acta arithmetica, 215(2), 179-192. Melistas, M.https://doi.org/10.4064/aa230929-17-4Improved likelihood estimation for noisy gamma degradation processes via sequential Monte Carlo (2024)Communications in statistics. Simulation and computation (E-pub ahead of print/First online). Buist, M., Vaisman, R. & Vlasiou, M.https://doi.org/10.1080/03610918.2024.2358128Modeling and Analyzing the Effect of Human Preferences on a Local Electricity Market (2024)IEEE Transactions on Energy Markets, Policy and Regulation, 2(2), 265-275. Article 10496199. Hönen, J., Doumen, S. C., Nguyen, P., Hurink, J. L., Zwart, B. & Kok, K.https://doi.org/10.1109/TEMPR.2024.3387270Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory (2024)Stochastic systems, 14(2), 131-166. Meijer, M. S., Schol, D., Jaarsveld, W. v., Vlasiou, M. & Zwart, B.https://doi.org/10.1287/stsy.2022.0014A flexible numerical tool for large dynamic DC networks (2024)[Working paper › Preprint]. ArXiv.org. Luesink, E., Giraldo, J., Geurts, B., Hurink, J. & Zwart, H.https://doi.org/10.48550/arXiv.2405.20704Quantifying Device Flexibility With Shapley Values in Demand Side Management (2024)[Contribution to conference › Paper] 15th ACM International Conference on Future and Sustainable Energy Systems, ACM e-Energy 2024. Varenhorst, I. A. M., Hurink, J. & Gerards, M. E. T.https://doi.org/10.1145/3632775.3661950Online Graph Coloring with Predictions (2024)In Combinatorial Optimization: 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers (pp. 289-302). Antoniadis, A., Broersma, H. & Meng, Y.https://doi.org/10.1007/978-3-031-60924-4_22Reduction types of CM curves (2024)[Working paper › Preprint]. ArXiv.org. Melistas, M.https://doi.org/10.48550/arXiv.2405.13414Sequencing Stochastic Jobs with a Single Sample (2024)In Combinatorial Optimization - 8th International Symposium, ISCO 2024, Revised Selected Papers (pp. 235-247) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14594 LNCS). Springer. te Rietmole, P. & Uetz, M.https://doi.org/10.1007/978-3-031-60924-4_18Optimal subgraphs in geometric scale-free random graphs (2024)[Working paper › Preprint]. ArXiv.org. Michielan, R., Stegehuis, C. & Walter, M.https://doi.org/10.48550/arXiv.2404.14972Asynchronous Distributed Energy Management with Co-Operative Agents (2024)In 2024 IEEE 8th Energy Conference (ENERGYCON). Pappu, A., Hurink, J. L., Hoogsteen, G. & Gerards, M. E. T.https://doi.org/10.1109/ENERGYCON58629.2024.10488799Enhancing Privacy Through Time Aggregation of Load Profiles in Energy Management (2024)In 2024 IEEE 8th Energy Conference (ENERGYCON). Article 10488782. IEEE. Varenhorst, I. A. M., Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ENERGYCON58629.2024.10488782Fair and Efficient Congestion Management for Low Voltage Distribution Networks (2024)In 2024 IEEE 8th Energy Conference (ENERGYCON). IEEE. Vadavathi, A. R., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ENERGYCON58629.2024.10488817The complexity of spanning tree problems involving graphical indices (2024)Discrete applied mathematics, 347, 143-154. Dong, Y., Broersma, H., Bai, Y. & Zhang, S.https://doi.org/10.1016/j.dam.2024.01.005On the resilience of cellular networks: How can national roaming help? (2024)IEEE transactions on network and service management, 21(2), 1702-1714. Weedage, L., Magalhaes, S. R. C., Stegehuis, C. & Bayhan, S.https://doi.org/10.1109/TNSM.2024.3352168Improving the optimization in model predictive controllers: Scheduling large groups of electric vehicles (2024)[Working paper › Working paper]. ArXiv.org. Winschermann, L., Gerards, M. E. T. & Hurink, J. L.https://doi.org/0.48550/arXiv.2403.16622Scale-free cascading failures: Generalized approach for all simple, connected graphs (2024)[Working paper › Preprint]. ArXiv.org. Janicka, A., Sloothaak, F. & Vlasiou, M.https://doi.org/10.48550/arXiv.2403.11727The Real Tropical Geometry of Neural Networks (2024)[Working paper › Working paper]. ArXiv.org. Brandenburg, M. C., Loho, G. & Montúfar, G.https://doi.org/10.48550/arXiv.2403.11871The Aα spectral moments of digraphs with a given dichromatic number (2024)Linear algebra and its applications, 685, 77-103. Yang, X., Broersma, H. & Wang, L.https://doi.org/10.1016/j.laa.2023.12.024The skew spectral radius and skew Randić spectral radius of general random oriented graphs (2024)Linear algebra and its applications, 685, 125-137. Hu, D., Broersma, H., Hou, J. & Zhang, S.https://doi.org/10.1016/j.laa.2024.01.003Equilibria in Two-Stage Facility Location with Atomic Clients (2024)[Working paper › Preprint]. ArXiv.org. Krogmann, S., Lenzner, P., Skopalik, A., Uetz, M. & Vos, M. C.https://doi.org/10.48550/arXiv.2403.03114ASIP tandem queues with consumption (2024)SIGMETRICS performance evaluation review, 51(4), 14-15. Yeger, Y., Boxma, O., Resing, J. & Vlasiou, M.https://doi.org/10.1145/3649477.3649486Local energy trading for microgrids: Modeling human behavior, uncertainty and grid constraints (2024)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Hönen, J.https://doi.org/10.3990/1.9789036560047Message from the Technical Program Committee Chairs (2024)SIGMETRICS performance evaluation review, 51(4), 3. Barford, P., Vlasiou, M. & Ying, L.https://doi.org/10.1145/3649477.3649480On the Distances Within Cliques in a Soft Random Geometric Graph (2024)Journal of statistical physics, 191(3). Article 38. Sönmez, E. & Stegehuis, C.https://doi.org/10.1007/s10955-024-03254-3Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering (2024)In 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. Article 52 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 289). Dagstuhl. Manthey, B. & van Rhijn, J.https://doi.org/10.4230/LIPIcs.STACS.2024.52Resource and location sharing in wireless networks (2024)PLoS ONE, 19(2). Article e0299396. Stegehuis, C. & Weedage, L.https://doi.org/10.1371/journal.pone.0299396Signed tropical halfspaces and convexity (2024)[Working paper › Preprint]. ArXiv.org. Loho, G. & Skomra, M.https://doi.org/10.48550/arXiv.2206.13919Configuration models for random directed hypergraphs (2024)[Working paper › Preprint]. ArXiv.org. Kraakman, Y. & Stegehuis, C.https://arxiv.org/abs/2402.06466The Worst-Case Complexity of Symmetric Strategy Improvement (2024)In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024) (pp. 24.1-24.19). Article 24. van Dijk, T., Loho, G. & Maat, M. T.https://doi.org/10.4230/LIPIcs.CSL.2024.24Torsion and twists of abelian varieties (2024)Bulletin of the London Mathematical Society, 56(2), 589-601. Melistas, M.https://doi.org/10.1112/blms.12952EV Allocation and Charging within Parking Lots Using a Locational Marginal Pricing Mechanism (2024)In 2023 IEEE PES Innovative Smart Grid Technologies Europe (ISGT EUROPE). Article 10408103. IEEE. Arias, N. B., Giraldo, J. S., López, J. C., Hoogsteen, G. & Hurink, J.https://doi.org/10.1109/ISGTEUROPE56780.2023.10408103A note on minimum degree, bipartite holes, and hamiltonian properties (2024)Discussiones mathematicae. Graph theory, 44(2), 717-726. Zhou, Q., Broersma, H., Wang, L. & Lu, Y.https://doi.org/10.7151/dmgt.2464ASIP tandem queues with consumption (2024)Performance evaluation, 163. Article 102380. Yeger, Y., Boxma, O., Resing, J. & Vlasiou, M.https://doi.org/10.1016/j.peva.2023.102380Combinatorial Matrix Recognition Library (2024)[Non-textual form › Software]. Walter, M., Truemper, K., van der Hulst, R. & Kraaij, H.https://discopt.github.io/cmr/Comparing Power Flow Models in Tree Networks with Stochastic Load Demands (2024)In Operations Research and Enterprise Systems: 11th International Conference, ICORES 2022, Virtual Event, February 3–5, 2022, and 12th International Conference, ICORES 2023, Lisbon, Portugal, February 19-21, 2023, Revised Selected Papers (pp. 138-167) (Communications in Computer and Information Science; Vol. 1985). Springer. Christianen, M. H. M., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/978-3-031-49662-2_8Edge Degree Conditions for Dominating and Spanning Closed Trails (2024)Discussiones mathematicae. Graph theory, 44(1), 363-381. Tian, T., Broersma, H. & Xiong, L.https://doi.org/10.7151/dmgt.2450Energy modi: transactive grid management scheme for resilient micro-grids (2024)In CIRED Chicago Workshop 2024: Resilience of Electric Distribution Systems (pp. 191-195). Article 1177 (IET Conference Proceedings; Vol. 2024). IET. Pappu, A., Camilo López, J., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1049/icp.2024.2596Equilibria in Two-Stage Facility Location with Atomic Clients (2024)In Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024 (pp. 2842-2850) (IJCAI International Joint Conference on Artificial Intelligence). International Joint Conferences on Artificial Intelligence. Krogmann, S., Lenzner, P., Skopalik, A., Uetz, M. & Vos, M. C.https://doi.org/10.24963/ijcai.2024/315Local energy management: A base model for the optimization of virtual economic units (2024)Energy Economics, 129. Article 107252. Hildebrandt, B., Hurink, J. & Manitz, M.https://doi.org/10.1016/j.eneco.2023.107252Obituary for Georg J. Still (13 November 1951–15 December 2023) (2024)Optimization, 73(10), 3019-3020. Dür, M., López Cerdá, M. A., Stein, O. & Uetz, M.https://doi.org/10.1080/02331934.2024.2331361Properly colored and rainbow C4' S in edge-colored graphs (2024)Journal of graph theory, 105(1), 110-135. Wu, F., Broersma, H., Zhang, S. & Li, B.https://doi.org/10.1002/jgt.23019Quotients of M-convex sets and M-convex functions (2024)[Working paper › Working paper]. ArXiv.org. Brandenburg, M. C., Loho, G. & Smith, B.https://doi.org/10.48550/arXiv.2403.07751Random graph models can determine important species in a Chemical Reaction Network (2024)[Contribution to conference › Poster] CHAINS 2024 (In preparation). Kraakman, Y. J., Fernandes da Cunha, É., Kriukov, D., van Poppel, T., Stegehuis, C. & Wong, A. S. Y.Relaxation Strength for Multilinear Optimization: McCormick Strikes Back (2024)In Integer Programming and Combinatorial Optimization. Proceedings of 25th IPCO (pp. 393-404). Schutte, E. & Walter, M.https://doi.org/10.1007/978-3-031-59835-7_29Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number (2024)Discrete mathematics, 347(1). Article 113659. Yang, X., Broersma, H. & Wang, L.https://doi.org/10.1016/j.disc.2023.113659Tuza's Conjecture for Binary Geometries (2024)SIAM journal on discrete mathematics, 38(2), 1676–1685. Nomoto, K. & van der Pol, J.https://doi.org/10.1137/22M1511229
2023
Approximation Ineffectiveness of a Tour-Untangling Heuristic (2023)In Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings (pp. 1-13) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14297 LNCS). Springer. Manthey, B. & van Rhijn, J.https://doi.org/10.1007/978-3-031-49815-2_1Complexity of Local Search for Euclidean Clustering Problems (2023)[Working paper › Preprint]. ArXiv.org. Manthey, B., Morawietz, N., van Rhijn, J. & Sommer, F.https://doi.org/10.48550/arXiv.2312.14916Polyhedral restrictions of feasibility regions in optimal power flow for distribution networks (2023)[Working paper › Preprint]. ArXiv.org. Christianen, M. H. M., Kempen, S. v., Vlasiou, M. & Zwart, B.The Distance Between: An algorithmic approach to comparing stochastic models to time-series data (2023)[Working paper › Preprint]. Research Square Publications. Sherlock, B., Boon, M. A., Vlasiou, M. & Coster, A.https://doi.org/10.21203/rs.3.rs-3712556/v1Robust and Predictive Charging of Large Electric Vehicle Fleets in Grid Constrained Parking Lots (2023)In 2023 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) (pp. 1-6). Article 10333900. IEEE. Hoogsteen, G., Winschermann, L., Nijenhuis, B., Arias, N. B. & Hurink, J. L.https://doi.org/10.1109/SmartGridComm57358.2023.10333900The Effect of Data Resolution on the Sizing of Energy Storage Systems Using a Load Profile Signal Decomposition Method (2023)In 2023 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) (pp. 1-6). Article 10333880. IEEE. Schaefer, E. W., Hoogsteen, G., Nijenhuis, B., Hurink, J. L. & Leeuwen, R. P. v.https://doi.org/10.1109/SmartGridComm57358.2023.10333880The Potential of Indicating Energy Flexibility Information by EV Users for Application in Energy Management Systems: a Dutch Case Study (2023)In 2023 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) (pp. 1-6). Article 10333882. IEEE. Nijenhuis, B., Reuling, J., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/SmartGridComm57358.2023.10333882Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics (2023)Algorithmica, 85(12), 3793-3815. Klootwijk, S. & Manthey, B.https://doi.org/10.1007/s00453-023-01167-3Improved Smoothed Analysis of 2-Opt for the Euclidean TSP (2023)In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Article 52 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 283). Dagstuhl. Manthey, B. & van Rhijn, J.https://doi.org/10.4230/LIPIcs.ISAAC.2023.52Universal quadratic forms and Dedekind zeta functions (2023)[Working paper › Preprint]. ArXiv.org. Kala, V. & Melistas, M.https://doi.org/10.48550/arXiv.2311.12911Grid-Aware Real-Time Control and Balancing Between Microgrids (2023)[Working paper › Preprint]. Hönen, J., Hurink, J. L. & Zwart, B.https://doi.org/10.48550/arXiv.2311.11294Threshold-Based Algorithms for an Online Rolling Horizon Framework Under Uncertainty - With an Application to Energy Management (2023)[Working paper › Preprint]. ArXiv.org. Hönen, J., Hurink, J. L. & Zwart, B.https://doi.org/10.48550/arXiv.2311.11307Almost every matroid has an M(K4)- or a W³-minor (2023)The Electronic journal of combinatorics, 30(4). Article P4.23. van der Pol, J.https://doi.org/10.37236/11946Relaxation strength for multilinear optimization: McCormick strikes back (2023)[Working paper › Preprint]. ArXiv.org. Schutte, E. & Walter, M.https://doi.org/10.48550/arXiv.2311.08570Spectral properties of digraphs with a fixed dichromatic number (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Yang, X.https://doi.org/10.3990/1.9789036558549A multi-objective decentralized optimization for voltage regulators and energy storage devices in active distribution systems (2023)International Journal of Electrical Power and Energy Systems, 153. Article 109330. Ahmadi, B., Giraldo, J. S., Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1016/j.ijepes.2023.109330Edge colorings of planar graphs (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zhang, L.https://doi.org/10.3990/1.9789036558716Properly colored and rainbow cycles in edge-colored graphs (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Wu, F.https://doi.org/10.3990/1.9789036558525Properly colored subgraphs in edge-colored graphs (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Han, T.https://doi.org/10.3990/1.9789036558693Recognizing Series-Parallel Matrices in Linear Time (2023)INFORMS journal on computing, 35(6), 1404-1418. Walter, M.https://doi.org/10.1287/ijoc.2021.0233Integrating Guarantees and Veto-Buttons into the Charging of Electric Vehicles at Office Buildings (2023)In 2023 IEEE PES Innovative Smart Grid Technologies Europe (ISGT EUROPE) (pp. 1-5). Article 10408515. IEEE. Winschermann, L., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEUROPE56780.2023.10408515Reduction and isogenies of elliptic curves (2023)[Working paper › Preprint]. Melistas, M.Face Posets of Tropical Polyhedra and Monomial Ideals (2023)The Electronic journal of combinatorics, 30(4). Article 4.11. Loho, G. & Smith, B.https://doi.org/10.37236/9999An analogue of a conjecture of Rasmussen and Tamagawa for abelian varieties over function fields (2023)[Working paper › Preprint]. Melistas, M.Torsion and twists of abelian varieties (2023)[Working paper › Preprint]. ArXiv.org. Melistas, M.https://doi.org/10.48550/arXiv.2310.11086Measuring Effects Of Mini-Lectures On Improving Student Engagement And Outcomes (2023)In SEFI Annual Conference 2023: Engineering Education for Sustainability (pp. 2020-2029). Article 36. Societe Europeenne pour la Formation des Ingenieurs (SEFI). Engbers, V., Gündlach, R., Regis, M. & Vlasiou, M.https://doi.org/10.21427/MPG1-QC26Assessing the value of information for electric vehicle charging strategies at office buildings (2023)Renewable & sustainable energy reviews, 185, 113600. Article 113600. Winschermann, L., Bañol Arias, N., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1016/j.rser.2023.113600Tail asymptotics for the delay in a Brownian fork-join queue (2023)Stochastic processes and their applications, 164, 99-138. Schol, D., Vlasiou, M. & Zwart, B.https://doi.org/10.1016/j.spa.2023.06.013Extreme values for the waiting time in large fork-join queues (2023)[Working paper › Preprint]. ArXiv.org. Schol, D., Vlasiou, M. & Zwart, B.https://doi.org/10.48550/arXiv.2309.08373Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits (2023)[Working paper › Working paper]. ArXiv.org (Submitted). Winschermann, L., Gerards, M. E. T., Antoniadis, A., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.48550/arXiv.2309.06174Maximal Cliques in Scale-Free Random Graphs (2023)[Working paper › Preprint]. ArXiv.org. Bläsius, T., Katzmann, M. & Stegehuis, C.https://doi.org/10.48550/arXiv.2309.02990The Worst-Case Complexity of Symmetric Strategy Improvement (2023)[Working paper › Preprint]. Dijk, T. v., Loho, G. & Maat, M.https://doi.org/10.48550/arXiv.2309.02223Asymptotic analysis of Emden–Fowler type equation with an application to power flow models: Special Issue dedicated to the memory of J.W. Cohen (2023)Indagationes mathematicae, 34(5), 1146-1180. Christianen, M. H. M., Janssen, A. J. E. M., Vlasiou, M. & Zwart, B.https://doi.org/10.1016/j.indag.2022.12.001PV Inverter-Based Fair Power Quality Control (2023)IEEE transactions on smart grid, 14(5), 3776-3790. Vadavathi, A. R., Hoogsteen, G. & Hurink, J.https://doi.org/10.1109/TSG.2023.3244601Approximation Ineffectiveness of a Tour-Untangling Heuristic (2023)[Working paper › Preprint]. ArXiv.org (Accepted/In press). Manthey, B. & van Rhijn, J.https://arxiv.org/abs/2302.11264Sequencing Stochastic Jobs with a Single Sample (2023)[Working paper › Working paper]. ArXiv.org. te Rietmole, P. & Uetz, M.https://doi.org/10.48550/arXiv.2308.11461On the distances within cliques in a soft random geometric graph (2023)[Working paper › Preprint]. Sönmez, E. & Stegehuis, C.Securing Smart Grids Locally using a Power Flow-based Intrusion Detection System (2023)In 2023 IEEE Belgrade PowerTech. Article 10202762. IEEE. Menzel, V., Arias, N. B., Hurink, J. L. & Remke, A.https://doi.org/10.1109/PowerTech55446.2023.10202762Polynomial algorithms for computing the isolated toughness of interval and split graphs (2023)Concurrency and computation, 35(17). Article e6345. Li, F., Ye, Q., Broersma, H. & Zhang, X.https://doi.org/10.1002/cpe.6345Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise (2023)[Working paper › Preprint]. ArXiv.org. Künnemann, M., Manthey, B. & Veenstra, R.https://doi.org/10.48550/arXiv.2308.00306Enhanced Distributed Self-Healing System for Electrical Distribution Networks Using ADMM (2023)In 2023 IEEE Power and Energy Society General Meeting, PESGM 2023 (pp. 1-5). Article 10253390 (IEEE Power and Energy Society General Meeting; Vol. 2023). IEEE. Camilo López, J., Gerards, M. E. T., Hurink, J. L. & Rider, M. J.https://doi.org/10.1109/PESGM52003.2023.10253390Dynamic Rolling Horizon-Based Robust Energy Management for Microgrids Under Uncertainty (2023)[Working paper › Preprint]. ArXiv.org. Hönen, J., Hurink, J. L. & Zwart, B.https://doi.org/10.48550/arXiv.2307.05154Pricing Mechanisms for Energy Communities: The GridFlex Heeten Project (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Reijnders, V. M. J. J.https://doi.org/10.3990/1.9789036556996Simple odd β -cycle inequalities for binary polynomial optimization (2023)Mathematical programming. Pia, A. D. & Walter, M.https://doi.org/10.1007/s10107-023-01992-yGraph entropy and related topics (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Dong, Y.https://doi.org/10.3990/1.9789036556675Estimating Risk-aware Flexibility Areas for Electric Vehicle Charging Pools via AC Stochastic Optimal Power Flow (2023)Journal of Modern Power Systems and Clean Energy, 11(4), 1247-1256. Giraldo, J. S., Arias, N. B., Vergara, P. P., Vlasiou, M., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.35833/MPCE.2022.000452Strategic Facility Location with Clients That Minimize Total Waiting Time (2023)In Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023 (pp. 5714-5721) (Proceedings AAAI Conference on Artificial Intelligence (AAAI); Vol. 2023). AAAI. Krogmann, S., Lenzner, P. & Skopalik, A.https://doi.org/10.1609/aaai.v37i5.25709Environmental and financial impact assessment of off-grid microgrids with energy storage and PV (2023)In 27th International Conference on Electricity Distribution (CIRED 2023) (pp. 2833-2837). IEEE. Schaefer, E., Desta, J., Goselink, E., Hoogsteen, G., Hurink, J. L. & van Leeuwen, R. P.https://doi.org/10.1049/icp.2023.1037Optimizing Parcel Transportation of PostNL (2023)[Working paper › Working paper]. European Consortium for Mathematics in Industry (ECMI). Hoeksma, R., Hojny, C., van Ommeren, J. C. W. & Walter, M.https://doi.org/10.33774/miir-2023-7dh5pImpact of Multi-connectivity on Channel Capacity and Outage Probability in Wireless Networks (2023)IEEE transactions on vehicular technology, 72(6), 7973 - 7986. Weedage, L., Stegehuis, C. & Bayhan, S.https://doi.org/10.1109/TVT.2023.3242358On the Correlation Gap of Matroids (2023)In Integer Programming and Combinatorial Optimization: 24th International Conference, IPCO 2023 Madison, WI, USA, June 21-23, 2023. Proceedings (pp. 203-216) (Lecture Notes in Computer Science; Vol. 13904). Springer. Husić, E., Koh, Z. K., Loho, G. & Végh, L. A.https://doi.org/10.1007/978-3-031-32726-1_15Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number (2023)[Working paper › Preprint]. ArXiv.org. Yang, X., Broersma, H. & Wang, L.https://doi.org/10.48550/arXiv.2305.06362Dynamic Hunting Leadership optimization: Algorithm and applications (2023)Journal of computational science, 69. Article 102010. Ahmadi, B., Giraldo, J. S. & Hoogsteen, G.https://doi.org/10.1016/j.jocs.2023.102010Strategic Resource Selection with Homophilic Agents (2023)[Working paper › Preprint]. ArXiv.org. Harder, J. G., Krogmann, S., Lenzner, P. & Skopalik, A.https://doi.org/10.48550/arXiv.2305.00843Resource and location sharing in wireless networks (2023)[Working paper › Preprint]. ArXiv.org. Stegehuis, C. & Weedage, L.https://doi.org/10.48550/arXiv.2304.11881Resource sharing in wireless networks with co-location (2023)[Working paper › Working paper]. ArXiv.org. Stegehuis, C. & Weedage, L.https://arxiv.org/abs/2304.11881v1Spectral radius conditions for the existence of all subtrees of diameter at most four (2023)Linear algebra and its applications, 663, 80-101. Liu, X., Broersma, H. & Wang, L.https://doi.org/10.1016/j.laa.2023.01.004A divisibility related to the Birch and Swinnerton-Dyer conjecture (2023)Journal of Number Theory, 245, 150-168. Melistas, M.https://doi.org/10.1016/j.jnt.2022.10.004Comparison of stability regions for a line distribution network with stochastic load demands (2023)Queueing systems, 103(3-4), 187-239. Christianen, M. H. M., Cruise, J., Janssen, A. J. E. M., Shneer, S., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/s11134-023-09873-zLarge deviations for triangles in scale-free random graphs (2023)[Working paper › Preprint]. Stegehuis, C. & Zwart, B.Sufficient conditions for properly colored C3’s and C4’s in edge-colored complete graphs (2023)Discrete applied mathematics, 327, 101-109. Han, T., Broersma, H., Bai, Y. & Zhang, S.https://doi.org/10.1016/j.dam.2022.12.020GridShield—Optimizing the Use of Grid Capacity during Increased EV Adoption (2023)World Electric Vehicle Journal, 14(3). Article 68. van Sambeek, H. L., Zweistra, M., Hoogsteen, G., Varenhorst, I. A. M. & Janssen, S.https://doi.org/10.3390/wevj14030068Localized geometry detection in scale-free random graphs (2023)[Working paper › Preprint]. Bet, G., Michielan, R. & Stegehuis, C.https://doi.org/10.48550/arXiv.2303.02965Solutions for cooperative games with restricted coalition formation and almost core allocations (2023)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zou, R.https://doi.org/10.3990/1.9789036555319A classification scheme for local energy trading (2023)OR Spectrum = OR Spektrum, 45, 85-118. Hönen, J., Hurink, J. L. & Zwart, B.https://doi.org/10.1007/s00291-022-00697-6Two-step Shapley-solidarity value for cooperative games with coalition structure (2023)OR Spectrum = OR Spektrum, 45, 1–25. Zou, R., Li, W., Uetz, M. & Xu, G.https://doi.org/10.1007/s00291-022-00694-9Algorithmic Solutions for Maximizing Shareable Costs (2023)[Working paper › Preprint]. ArXiv.org. Zou, R., Lin, B., Uetz, M. & Walter, M.https://doi.org/10.48550/arXiv.2303.00052Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes (2023)[Working paper › Preprint]. ArXiv.org. Haase, C., Hertrich, C. & Loho, G.https://doi.org/10.48550/arXiv.2302.12553Generalized Permutahedra and Positive Flag Dressians (2023)International Mathematics Research Notices, 2023(19), 16748-16777. Joswig, M., Loho, G., Luber, D. & Olarte, J. A.https://doi.org/10.1093/imrn/rnac349Speed-robust scheduling: sand, bricks, and rocks (2023)Mathematical programming, 197(2), 1009–1048. Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.1007/s10107-022-01829-0The Binary Linearization Complexity of Pseudo-Boolean Functions (2023)[Working paper › Preprint]. Walter, M.The effect of graph operations on the degree-based entropy (2023)Applied mathematics and computation, 437. Article 127533. Dong, Y., Broersma, H., Song, C., Wan, P. & Zhang, S.https://doi.org/10.1016/j.amc.2022.127533Estimating Risk-Aware Flexibility Areas for EV Charging Pools via Stochastic AC-OPF (2023)[Working paper › Preprint]. ArXiv.org. Giraldo, J. S., Bañol Arias, N., Vergara, P. P., Vlasiou, M., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.48550/arXiv.2301.00564Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes (2023)[Contribution to conference › Paper] 11th International Conference on Learning Representations, ICLR 2023. Haase, C., Hertrich, C. & Loho, G.https://openreview.net/forum?id=2mvALOAWaxYModeling and Demonstrating the Effect of Human Decisions on the Distribution Grid (2023)In 2023 IEEE Power and Energy Society Innovative Smart Grid Technologies Conference, ISGT 2023 (IEEE Power and Energy Society Innovative Smart Grid Technologies Conference (ISGT); Vol. 2023). IEEE. Doumen, S. C., Hönen, J., Nguyen, P., Hurink, J. L., Zwart, B. & Kok, K.https://doi.org/10.1109/ISGT51731.2023.10066376On the resilience of cellular networks: how can national roaming help? (2023)[Working paper › Working paper]. ArXiv.org. Weedage, L., Rangel, S., Stegehuis, C. & Bayhan, S.https://doi.org/10.48550/arXiv.2301.03250Paging with Succinct Predictions (2023)Proceedings of Machine Learning Research, 202, 952-968. Antoniadis, A., Boyar, J., Eliáš, M., Favrholdt, L. M., Hoeksma, R., Larsen, K. S., Polak, A. & Simon, B.Scale-free graphs with many edges (2023)Electronic Communications in Probability, 28. Article 62. Stegehuis, C. & Zwart, B.https://doi.org/10.1214/23-ECP567Simulation Study for the Comparison of Power Flow Models for a Line Distribution Network with Stochastic Load Demands (2023)In ICORES 2023 - Proceedings of the 12th International Conference on Operations Research and Enterprise Systems (pp. 167-174) (International Conference on Operations Research and Enterprise Systems). SCITEPRESS. Christianen, M., Vlasiou, M. & Zwart, B.https://doi.org/10.5220/0011670600003396Strategic Resource Selection with Homophilic Agents (2023)In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023 (pp. 2701-2709) (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2023). International Joint Conferences on Artificial Intelligence. Harder, J. G., Krogmann, S., Lenzner, P. & Skopalik, A.https://doi.org/10.24963/ijcai.2023/301Tropical Carathéodory with Matroids (2023)Discrete and computational geometry, 69(1), 139-155. Loho, G. & Sanyal, R.https://doi.org/10.1007/s00454-022-00446-0Tropical positivity and determinantal varieties (2023)Algebraic Combinatorics, 6(4), 999-1040. Brandenburg, M. C., Loho, G. & Sinn, R.https://doi.org/10.5802/alco.286Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering (2023)[Working paper › Preprint]. ArXiv.org (Accepted/In press). Manthey, B. & van Rhijn, J.https://arxiv.org/abs/2309.10368You can make random uniform directed hypergraphs (2023)[Contribution to conference › Poster] 21st INFORMS Applied Probability Society Conference 2023 (In preparation). Kraakman, Y. & Stegehuis, C.
2022
Sharpest possible clustering bounds using robust random graph analysis (2022)Physical review E: covering statistical, nonlinear, biological, and soft matter physics, 106(6). Article 064311. Brugman, J., Van Leeuwaarden, J. S. H. & Stegehuis, C.https://doi.org/10.1103/PhysRevE.106.064311Queues on interacting networks (2022)[Working paper › Preprint]. ArXiv.org. Vlasiou, M.https://doi.org/10.48550/arXiv.2212.07945Scale-free graphs with many edges (2022)[Working paper › Preprint]. ArXiv.org. Stegehuis, C. & Zwart, B.https://doi.org/10.48550/arXiv.2212.05907Simulation study for the comparison of power flow models for a line distribution network with stochastic load demands (2022)[Working paper › Preprint]. Christianen, M. H. M., Vlasiou, M. & Zwart, B.On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees (2022)Discrete mathematics, 345(12). Article 113112. Liu, X., Broersma, H. & Wang, L.https://doi.org/10.1016/j.disc.2022.113112Patchworking oriented matroids (2022)Journal of the London Mathematical Society, 106(4), 3545-3576. Celaya, M., Loho, G. & Yuen, C. H.https://doi.org/10.1112/jlms.12667Improved Smoothed Analysis of 2-Opt for the Euclidean TSP (2022)[Working paper › Preprint]. Manthey, B. & Rhijn, J. v.Recuperation of railcar braking energy using energy storage at station level (2022)In 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe) (pp. 1-6). IEEE. Schaefer, E., Homan, B., Hoogsteen, G., van Leeuwen, R. P. & Hurink, J. L.https://doi.org/10.1109/ISGT-Europe54678.2022.9960571A Compensation Mechanism for EV Flexibility Services using Discrete Utility Functions (2022)In 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe). Giraldo, J. S., Bañol Arias, N., Duque, E. M. S., Hurink, J. L. & Hoogsteen, G.https://doi.org/10.1109/ISGT-Europe54678.2022.9960542Distributed Co-operative Demand Side Management for Energy Communities (2022)In 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe) (pp. 1-5). Article 9960572. IEEE. Pappu, A., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGT-Europe54678.2022.9960572GridShield: A Robust Fall-Back Control Mechanism for Congestion Management in Distribution Grids (2022)In 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe) (pp. 1-5). Article 9960301. IEEE. Tangerding, F., Varenhorst, I. A. M., Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGT-Europe54678.2022.9960301On the Effects of Active Energy Community Participation in the Energy System (2022)In 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe) (pp. 1-5). Article 9960552. IEEE. Hoogsteen, G., Pappu, A., Ahmadi, B., Hurink, J. L., Schaefer, E. W., Gercek, C. & Leeuwen, R. P. v.https://doi.org/10.1109/ISGT-Europe54678.2022.9960552Strategic Facility Location with Clients that Minimize Total Waiting Time (2022)[Working paper › Preprint]. ArXiv.org. Krogmann, S., Lenzner, P. & Skopalik, A.The spectra of random mixed graphs (2022)Linear algebra and its applications, 653, 320-338. Hu, D., Broersma, H., Hou, J. & Zhang, S.https://doi.org/10.1016/j.laa.2022.08.019Maximum waiting time in heavy-tailed fork-join queues (2022)[Working paper › Preprint]. Schol, D., Vlasiou, M. & Zwart, B.A hybrid electricity pricing mechanism for joint system optimization and social acceptance within energy communities (2022)Energy Reports, 8, 13281-13292. Reijnders, V. M. J. J., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1016/j.egyr.2022.10.021A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (2022)Discrete optimization, 46. Article 100741. Siemann, M. R. & Walter, M.https://doi.org/10.1016/j.disopt.2022.100741Detecting hyperbolic geometry in networks: Why triangles are not enough (2022)Physical review E: covering statistical, nonlinear, biological, and soft matter physics, 106(5). Article 054303. Michielan, R., Litvak, N. & Stegehuis, C.https://doi.org/10.1103/PhysRevE.106.054303Power surplus solutions for weighted hypergraph communication situations (2022)International transactions in operational research, 29(6), 3346-3369. Li, X., Joosten, R., Uetz, M. & Li, Y.https://doi.org/10.1111/itor.13118A Classification Scheme for Local Energy Trading (2022)[Working paper › Preprint]. ArXiv.org. Hönen, J., Hurink, J. L. & Zwart, B.https://doi.org/10.48550/arXiv.2210.15344Multi-objective Advanced Grey Wolf optimization Framework for Smart Charging Scheduling of EVs in Distribution Grids (2022)In 2022 57th International Universities Power Engineering Conference: Big Data and Smart Grids, UPEC 2022 - Proceedings. Article Multi-objective Advanced Grey Wolf optimization. IEEE. Ahmadi, B., Bañol Arias, N., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/UPEC55022.2022.9917961Multi-Objective Optimization Framework for Integration of Distributed Energy Resources in Smart Communities (2022)In 2022 57th International Universities Power Engineering Conference: Big Data and Smart Grids, UPEC 2022 - Proceedings. Article 9917732. IEEE. Ahmadi, B., Pappu, A., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/UPEC55022.2022.9917732Paging with Succinct Predictions (2022)[Working paper › Preprint]. ArXiv.org. Antoniadis, A., Boyar, J., Eliáš, M., Favrholdt, L. M., Hoeksma, R., Larsen, K. S., Polak, A. & Simon, B.In memoriam Gerhard Woeginger (2022)Journal of scheduling, 25(5), 503-505. Lenstra, J. K., Rendl, F., Spieksma, F. & Uetz, M.https://doi.org/10.1007/s10951-022-00748-4Interior point methods are not worse than Simplex (2022)In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 267-277) (IEEE Annual Symposium on Foundations of Computer Science (FOCS); Vol. 2022). IEEE. Allamigeon, X., Dadush, D., Loho, G., Natura, B. & Végh, L. A.https://doi.org/10.1109/focs54457.2022.00032Purely additive reduction of abelian varieties with torsion (2022)Journal of Number Theory, 239, 21-39. Melistas, M.https://doi.org/10.1016/j.jnt.2021.10.015The Erdős–Gyárfás function with respect to Gallai-colorings (2022)Journal of graph theory, 101(2), 242-264. Li, X., Broersma, H. & Wang, L.https://doi.org/10.1002/jgt.22822A Decentralized Control Strategy for Voltage Regulators and Energy Storage Devices in Active Unbalanced Distribution Systems (2022)In SEST 2022 - 5th International Conference on Smart Energy Systems and Technologies. Article 9898481. IEEE. Ahmadi, B., Giraldo, J. S., Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/SEST53650.2022.9898481Sharpest possible clustering bounds using robust random graph analysis (2022)[Working paper › Preprint]. Brugman, J., Leeuwaarden, J. S. H. v. & Stegehuis, C.Towards a Lower Bound for the Average Case Runtime of Simulated Annealing on TSP (2022)[Working paper › Preprint]. Manthey, B. & Rhijn, J. v.Tail Asymptotics for the Delay in a Brownian Fork-Join Queue (2022)[Working paper › Preprint]. Schol, D., Vlasiou, M. & Zwart, B.Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees (2022)In 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. Article 64 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 241). Dagstuhl. Koh, Z. K. & Loho, G.https://doi.org/10.4230/LIPIcs.MFCS.2022.63Online search for a hyperplane in high-dimensional Euclidean space (2022)Information processing letters, 177. Article 106262. Antoniadis, A., Hoeksma, R., Kisfaludi-Bak, S. & Schewior, K.https://doi.org/10.1016/j.ipl.2022.106262Sizing of hybrid energy storage through analysis of load profile characteristics: A household case study (2022)Journal of Energy Storage, 52(Part A). Article 104768. Schaefer, E. W., Hoogsteen, G., Hurink, J. L. & van Leeuwen, R. P.https://doi.org/10.1016/j.est.2022.104768Tamagawa numbers of elliptic curves with torsion points (2022)Archiv der Mathematik, 119, 155-165. Melistas, M.https://doi.org/10.1007/s00013-022-01722-4Hybrid energy storage to increase grid flexibility when charging an EV fleet (2022)In CIRED Porto Workshop 2022: E-mobility and power distribution systems (pp. 404-408). Article 1236. IET. Schaefer, E., Nijenhuis, B., Hoogsteen, G., Hurink, J. L. & van Leeuwen, R.https://doi.org/10.1049/icp.2022.0736The Battery Materials Sourcing Engineer - Mark Huijben - University of Twente (2022)[Dataset Types › Dataset]. Zenodo. Huijben, M. & Hoogsteen, G.https://doi.org/10.5281/zenodo.6886173Robust Energy Management for a Microgrid (2022)In ENERGYCON 2022 - 2022 IEEE 7th International Energy Conference, Proceedings. IEEE. Hönen, J., Hurink, J. L. & Zwart, B.https://doi.org/10.1109/ENERGYCON53164.2022.9830301Asymptotic analysis of Emden-Fowler type equation with an application to power flow models (2022)[Working paper › Preprint]. ArXiv.org. Christianen, M. H. M., Janssen, A. J. E. M., Vlasiou, M. & Zwart, B.https://doi.org/10.48550/arXiv.2206.14653Beam-align: distributed user association for mmWave networks with multi-connectivity (2022)[Working paper › Preprint]. ArXiv.org. Weedage, L., Stegehuis, C. & Bayhan, S.https://doi.org/10.48550/arXiv.2206.13166GridShield – Optimizing the Use of Grid Capacity during Increased EV Adoption (2022)[Contribution to conference › Paper] 35th International Electric Vehicle Symposium and Exhibition, EVS 2022. Zweistra, M., van Sambeek, H. & Hoogsteen, G.Detecting hyperbolic geometry in networks: why triangles are not enough (2022)[Working paper › Preprint]. ArXiv.org. Litvak, N., Michielan, R. & Stegehuis, C.https://doi.org/10.48550/arXiv.2206.01553Protecting the distribution grid while maximizing EV energy flexibility with transparency and active user engagement (2022)In CIRED Porto Workshop 2022: E-mobility and power distribution systems (pp. 209-213). Article 9841922. IET. Nijenhuis, B., Winschermann, L., Bañol Arias, N., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1049/icp.2022.0696Using mobility data and agent-based models to generate future E-mobility charging demand patterns (2022)In CIRED Porto Workshop 2022: E-mobility and power distribution systems (pp. 214-218). Article 9841830. IET. Nijenhuis, B., Doumen, S. C., Hönen, J. & Hoogsteen, G.https://doi.org/10.1049/icp.2022.0697A Fluid Model of an Electric Vehicle Charging Network (2022)Stochastic systems, 12(2), 151-180. Aveklouris, A., Vlasiou, M. & Zwart, B.https://doi.org/10.1287/stsy.2021.0084Bringing network science to primary school (2022)Network Science, 10(2), 207-213. Stegehuis, C.https://doi.org/10.1017/nws.2022.15On Hop-Constrained Steiner Trees in Tree-Like Metrics (2022)SIAM journal on discrete mathematics, 36(2), 1249-1273. Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B.https://doi.org/10.1137/21M1425487The Hamiltonian properties in K1,r-free split graphs (2022)Discrete mathematics, 345(6). Article 112826. Dai, G., Zhang, Z. B., Broersma, H. & Zhang, X.https://doi.org/10.1016/j.disc.2022.112826A Compensation Mechanism for EV Flexibility Services using Discrete Utility Functions (2022)[Working paper › Preprint]. ArXiv.org. Giraldo, J. S., Bañol Arias, N., Duque, E. M. S., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.48550/arXiv.2205.15737Integer colorings with no rainbow 3-term arithmetic progression (2022)The Electronic journal of combinatorics, 29(2). Article P2.28. Li, X., Broersma, H. & Wang, L.https://doi.org/10.37236/10249In Memoriam Gerhard Woeginger (2022)Operations research letters, 50(3), iii. Lenstra, J. K., Rendl, F., Spieksma, F. & Uetz, M.https://doi.org/10.1016/S0167-6377(22)00069-4Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times (2022)Mathematics of operations research, 47(2), 1335-1364. Schol, D., Vlasiou, M. & Zwart, B.https://doi.org/10.1287/moor.2021.1171On a Reduction for a Class of Resource Allocation Problems (2022)INFORMS journal on computing, 34(3), 1387-1402. Uiterkamp, M. H. H. S., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1287/ijoc.2021.1104Some New Bounds for the Inverse Sum Indeg Energy of Graphs (2022)Axioms, 11(5). Article 243. Li, F., Ye, Q. & Broersma, H.https://doi.org/10.3390/axioms11050243Queues on interacting networks (2022)Queueing systems, 100(3-4), 553-555. Vlasiou, M.https://doi.org/10.1007/s11134-022-09771-wTesting of a price-based system for power balancing on real-life HVAC installation in real life (2022)Bulletin of the Polish Academy of Sciences: Technical Sciences, 70(2). Article e140690. Radziszewska, W., Bugaj, M. A., Łuniewski, M., Hoogsteen, G., Chaja, P. & Bykuć, S.https://doi.org/10.24425/bpasts.2022.140690Model Supported Business Case Scenario Analysis for Decentral Hydrogen Conversion, Storage and Consumption within Energy Hubs (2022)Energies, 15(6). Article 2065. van Leeuwen, R. P., Boerman, A. E., Schaefer, E. W., Hoogsteen, G. & Hajimolana, Y. S.https://doi.org/10.3390/en15062065Exact Price of Anarchy for Weighted Congestion Games with Two Players (2022)[Working paper › Preprint]. ArXiv.org. van den Bosse, J., Uetz, M. & Walter, M.https://doi.org/10.48550/arXiv.2203.01740Benefits of cross-border citizen energy communities at distribution system level (2022)Energy Strategy Reviews, 40. Article 100821. Stroink, A., Diestelmeier, L., Hurink, J. L. & Wawer, T.https://doi.org/10.1016/j.esr.2022.100821Distinguishing Power-Law Uniform Random Graphs from Inhomogeneous Random Graphs Through Small Subgraphs (2022)Journal of statistical physics, 186(3). Article 37. Stegehuis, C.https://doi.org/10.1007/s10955-022-02884-9Integer dynamics (2022)International Journal of Number Theory, 18(2), 397-415. Lorenzini, D., Melistas, M., Suresh, A., Suwama, M. & Wang, H.https://doi.org/10.1142/s1793042122500245A Class of Convex Quadratic Nonseparable Resource Allocation Problems with Generalized Bound Constraints (2022)INFORMS Journal on Optimization, 4(2), 215-247. Schoot Uiterkamp, M. H. H., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1287/ijoo.2021.0065Cliques in geometric inhomogeneous random graphs (2022)Journal of Complex Networks, 10(1). Article cnac002. Michielan, R. & Stegehuis, C.https://doi.org/10.1093/comnet/cnac002Comparison of stability regions for a line distribution network with stochastic load demands (2022)[Working paper › Preprint]. ArXiv.org. Christianen, M. H. M., Cruise, J., Janssen, A. J. E. M., Shneer, S., Vlasiou, M. & Zwart, B.https://doi.org/10.48550/arXiv.2201.06405Degree distributions in AB random geometric graphs (2022)Physica A, 586. Article 126460. Stegehuis, C. & Weedage, L.https://doi.org/10.1016/j.physa.2021.126460Exact Price of Anarchy for Weighted Congestion Games with Two Players (2022)In Combinatorial Optimization: 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers (pp. 159-171) (Lecture Notes in Computer Science; Vol. 13526). Springer. van den Bosse, J., Uetz, M. & Walter, M.https://doi.org/10.1007/978-3-031-18530-4_12On complete classes of valuated matroids (2022)In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 945-962). Association for Computing Machinery. Husić, E., Loho, G., Smith, B. & Végh, L. A.https://doi.org/10.1137/1.9781611977073.41On the call intake process in service planning (2022)In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2022 (pp. 265-278). Post, G. F. & Mijsters, S.Simple Odd β -Cycle Inequalities for Binary Polynomial Optimization (2022)In Integer Programming and Combinatorial Optimization. IPCO 2022: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings (pp. 181–194) (Lecture Notes in Computer Science; Vol. 13265). Springer. Del Pia, A. & Walter, M.https://doi.org/10.1007/978-3-031-06901-7_14Subdivisions of Generalized Permutahedra (2022)In FPSAC 2022: Proceedings of the 34th Conference on Formal Power Series and Algebraic Combinatorics (Bangalore) (Séminaire Lotharingien de Combinatoire - FPSAC 2022). Universitat Wien. Joswig, M., Loho, G., Luber, D. & Olarte, J. A.https://www.mat.univie.ac.at/~slc/wpapers/FPSAC2022/53.html
2021
Probabilistic properties of highly connected random geometric graphs (2021)Discrete applied mathematics, 366-376. Manthey, B. & Reijnders, V. M. J. J.https://doi.org/10.1016/j.dam.2019.04.007Speed Robust Scheduling Supplemental Material (2021)[Non-textual form › Software]. 4TU.Centre for Research Data. Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.4121/17159216Speed Robust Scheduling Supplemental Material (2021)[Dataset Types › Dataset]. 4TU.Centre for Research Data. Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.4121/17159216.v1On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees (2021)[Working paper › Preprint]. ArXiv.org. Liu, X., Broersma, H. & Wang, L.https://doi.org/10.48550/arXiv.2112.13253Comparison of Fairness based Coordinated Grid Voltage Control Methods for PV Inverters (2021)In 2021 IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe) (pp. 1-5). Vadavathi, A. R., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope52324.2021.9639982Multi-Objective Optimized Operation of Energy Storage Devices (2021)In 2021 IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe). IEEE. Homan, B., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope52324.2021.9640150Multi-Objective Optimized Operation of Energy Storage Devices - Poster (2021)[Contribution to conference › Poster] 2021 IEEE PES Innovative Smart Grid Technologies Europe, ISGT Europe 2021. Homan, B., Hoogsteen, G. & Hurink, J. L.Securing SCADA networks for smart grids via a distributed evaluation of local sensor data (2021)In 2021 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) (pp. 405-411). IEEE. Menzel, V., Hurink, J. L. & Remke, A.https://doi.org/10.1109/SmartGridComm51999.2021.9632283Network processes on clique-networks with high average degree: The limited effect of higher-order structure (2021)Journal of Physics: Complexity, 2(4). Article 045011. Stegehuis, C. & Peron, T.https://doi.org/10.1088/2632-072X/ac35b7Recognizing Series-Parallel Matrices in Linear Time (2021)[Working paper › Working paper]. ArXiv.org. Walter, M.In Memoriam Walter Kern (2021)Discrete applied mathematics, 303, 2-3. Hochstättler, W., Hurink, J., Manthey, B., Paulusma, D., Peis, B. & Still, G.https://doi.org/10.1016/j.dam.2021.08.034Preface: 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019) (2021)Discrete applied mathematics, 303, 1. Manthey, B. & Hurink, J.https://doi.org/10.1016/j.dam.2021.08.033Simple odd β-cycle inequalities for binary polynomial optimization (2021)[Working paper › Working paper]. ArXiv.org. Pia, A. D. & Walter, M.https://doi.org/10.48550/arXiv.2111.04858Probabilistic Analyses of Combinatorial Optimization Problems on Random Shortest Path Metrics (2021)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Klootwijk, S.https://doi.org/10.3990/1.9789036552493A fast algorithm for quadratic resource allocation problems with nested constraints (2021)Computers & operations research, 135. Article 105451. Schoot Uiterkamp, M. H. H., Hurink, J. L. & Gerards, M. E. T.https://doi.org/10.1016/j.cor.2021.105451Extremal problems and results related to Gallai-colorings (2021)Discrete mathematics, 344(11). Article 112567. Li, X., Broersma, H. & Wang, L.https://doi.org/10.1016/j.disc.2021.112567Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals (2021)Mathematics of operations research, 46(4), 1452-1478. Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T. & Vredeveld, T.https://doi.org/10.1287/moor.2020.1105Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs (2021)Graphs and combinatorics, 37(6), 2467-2485. Zhou, Q., Broersma, H., Wang, L. & Lu, Y.https://doi.org/10.1007/s00373-021-02369-8An Outage Probability Model for Electric Vehicles in Low Voltage Grids (2021)In 2021 IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe) (pp. 1-5). Article 9640169. IEEE. Nijenhuis, B., Gerards, M. E. T., Hoogsteen, G. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope52324.2021.9640169Complete resource pooling of a load-balancing policy for a network of battery swapping stations (2021)Queueing systems, 99(1-2), 65-120. Sloothaak, F., Cruise, J., Shneer, S., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/s11134-021-09707-wOn a conjecture of Agashe (2021)Transactions of the American Mathematical Society, 374(10), 7143-7160. Melistas, M.https://doi.org/10.1090/tran/8419Robust subgraph counting with distribution-free random graph analysis (2021)Physical review E: covering statistical, nonlinear, biological, and soft matter physics, 104(4). Article A41. van Leeuwaarden, J. S. H. & Stegehuis, C.https://doi.org/10.1103/PhysRevE.104.044313Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes (2021)Neuromorphic Computing and Engineering, 1(2). Article 024002. Ruiz Euler, H.-C., Alegre Ibarra, U., van de Ven, B., Broersma, H., Bobbert, P. A. & van der Wiel, W. G.https://doi.org/10.1088/2634-4386/ac1a7fOnline Search for a Hyperplane in High-Dimensional Euclidean Space (2021)[Working paper › Working paper]. ArXiv.org. Antoniadis, A., Hoeksma, R., Kisfaludi-Bak, S. & Schewior, K.Edge-colored complete graphs without properly colored even cycles: A full characterization (2021)Journal of graph theory, 98(1), 110-124. Li, R., Broersma, H., Yokota, M. & Yoshimoto, K.https://doi.org/10.1002/jgt.22684Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (2021)Mathematics of operations research, 46(3), 1230-1234. Gupta, V., Moseley, B., Uetz, M. & Xie, Q.https://doi.org/10.1287/MOOR.2021.1149Locating highly connected clusters in large networks with HyperLogLog counters (2021)Journal of Complex Networks, 9(2). Article cnab023. Weedage, L., Litvak, N. & Stegehuis, C.https://doi.org/10.1093/comnet/cnab023Robust subgraph counting with distribution-free random graph analysis (2021)[Working paper › Working paper]. ArXiv.org. Leeuwaarden, J. S. H. v. & Stegehuis, C.https://arxiv.org/abs/2107.10089Solving the shift and break design problem using integer linear programming (2021)Annals of operations research, 302(2), 341-362. Akkermans, A., Post, G. & Uetz, M.https://doi.org/10.1007/s10479-019-03487-6The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space (2021)Operations research letters, 49(4), 623-624. Walter, M.https://doi.org/10.1016/j.orl.2021.06.015The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space (2021)[Working paper › Preprint]. ArXiv.org. Walter, M.https://doi.org/10.48550/arXiv.2106.10097On sufficient spectral radius conditions for hamiltonicity (2021)Discrete applied mathematics, 296, 26-38. Zhou, Q., Broersma, H., Wang, L. & Lu, Y.https://doi.org/10.1016/j.dam.2020.01.031Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs (2021)In Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings (pp. 399-412) (Lecture Notes in Computer Science; Vol. 12707). Springer. Walter, M.https://doi.org/10.1007/978-3-030-73879-2_28Cliques in geometric inhomogeneous random graph (2021)[Working paper › Working paper]. ArXiv.org. Michielan, R. & Stegehuis, C.Contact tracing in configuration models (2021)Journal of Physics: Complexity, 2(2). Article 025004. Kryven, I. & Stegehuis, C.https://doi.org/10.1088/2632-072X/abd3adOptimization of inventory and capacity in large-scale assembly systems using extreme-value theory (2021)[Working paper › Preprint]. ArXiv.org. Meijer, M. S., Schol, D., van Jaarsveld, W., Vlasiou, M. & Zwart, B.https://doi.org/10.48550/arXiv.2105.09189Speed-Robust Scheduling: Sand, Bricks, and Rocks (2021)In Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Proceedings (pp. 283-296) (Lecture Notes in Computer Science; Vol. 12707). Springer. Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.1007/978-3-030-73879-2_20Two-Stage Facility Location Games with Strategic Clients and Facilities (2021)[Working paper › Working paper]. ArXiv.org. Krogmann, S., Lenzner, P., Molitor, L. & Skopalik, A.https://arxiv.org/abs/2105.01425Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph (2021)Discussiones mathematicae. Graph theory, 41(2), 559-587. Wu, J., Broersma, H., Mao, Y. & Ma, Q.https://doi.org/10.7151/dmgt.2209Toughness, Forbidden Subgraphs and Pancyclicity (2021)Graphs and combinatorics, 37, 839-866. Zheng, W., Broersma, H. & Wang, L.https://doi.org/10.1007/s00373-021-02284-yNetwork processes on clique-networks with high average degree: the limited effect of higher-order structure (2021)[Working paper › Working paper]. ArXiv.org. Stegehuis, C. & Peron, T.https://arxiv.org/abs/2104.14776Energy consumption data of the GridFlex Heeten project (2021)[Dataset Types › Dataset]. 4TU.Centre for Research Data. Reijnders, V. M. J. J., Hurink, J. L. & Gerards, M. E. T.https://doi.org/10.4121/14447257.v1Duality-driven optimization in energy management: Offline and online algorithms for resource allocation problems (2021)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Schoot Uiterkamp, M. H. H.https://doi.org/10.3990/1.9789036551618Impact of Multi-connectivity on Channel Capacity and Outage Probability in Wireless Networks (2021)[Working paper › Working paper]. ArXiv.org. Weedage, L., Stegehuis, C. & Bayhan, S.https://arxiv.org/abs/2104.09823Probabilistic analysis of optimization problems on generalized random shortest path metrics (2021)Theoretical computer science, 866, 107-122. Klootwijk, S., Manthey, B. & Visser, S. K.https://doi.org/10.1016/j.tcs.2021.03.016Degree distributions in AB random geometric graphs (2021)[Working paper › Working paper]. ArXiv.org. Stegehuis, C. & Weedage, L.https://arxiv.org/abs/2104.03711Optimal subgraph structures in scale-free configuration models (2021)Annals of applied probability, 31(2), 501-537. Van der Hofstad, R., Van Leeuwaarden, J. S. H. & Stegehuis, C.https://doi.org/10.1214/20-AAP1580Implementing Algorithms to Reduce Ward Occupancy Fluctuation Through Advanced Planning (2021)In Handbook of Healthcare Logistics: Bridging the Gap between Theory and Practice (pp. 129-150) (International Series in Operations Research & Management Science; Vol. 302). Springer. Vanberkel, P. T., Boucherie, R., Hans, E. W., Hurink, J. L., van Lent, W. A. M. & van Harten, W. H.https://doi.org/10.1007/978-3-030-60212-3_8Extremality of VDB topological indices over f–benzenoids with given order (2021)Applied mathematics and computation, 393. Article 125757. Li, F., Ye, Q., Broersma, H., Ye, R. & Zhang, X.https://doi.org/10.1016/j.amc.2020.125757Online electric vehicle charging with discrete charging rates (2021)Sustainable Energy, Grids and Networks, 25. Article 100423. Schoot Uiterkamp, M. H. H., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1016/j.segan.2020.100423Solutions to sequencing and bargaining games (2021)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Yang, G.https://doi.org/10.3990/1.9789036551298Optimal Algorithm of Isolated Toughness for Interval Graphs (2021)In Parallel and Distributed Computing, Applications and Technologies: 21st International Conference, PDCAT 2020, Shenzhen, China, December 28–30, 2020, Proceedings (pp. 379-388) (Lecture Notes in Computer Science; Vol. 12606). Springer. Li, F., Ye, Q., Broersma, H. & Zhang, X.https://doi.org/10.1007/978-3-030-69244-5_34Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (2021)[Working paper › Working paper]. ArXiv.org. Stegehuis, C.Integer colorings with no rainbow 3-term arithmetic progression (2021)[Working paper › Preprint]. ArXiv.org. Li, X., Broersma, H. & Wang, L.https://doi.org/10.48550/arXiv.2102.08995A better lower bound for Lower-Left Anchored Rectangle Packing (2021)[Working paper › Preprint]. Hoeksma, R. & Maat, M.https://arxiv.org/abs/2102.05747Greedy algorithm for local heating problem (2021)Discrete optimization, 39. Article 100627. Fink, J. & Hurink, J. L.https://doi.org/10.1016/j.disopt.2021.100627On the spectra of general random mixed graphs (2021)The Electronic journal of combinatorics, 28(1). Article P1.3. Hu, D., Broersma, H., Hou, J. & Zhang, S.https://doi.org/10.37236/9638Persistency of linear programming relaxations for the stable set problem (2021)Mathematical programming. Rodríguez-Heck, E., Stickler, K., Walter, M. & Weltge, S.https://doi.org/10.1007/s10107-020-01600-3Locating highly connected clusters in large networks with HyperLogLog counters (2021)[Working paper › Working paper]. ArXiv.org. Weedage, L., Litvak, N. & Stegehuis, C.https://doi.org/10.48550/arXiv.2101.04610AI As An Accelerator Of The Eenergy Transition: Opportunities for a carbon-free energy system (2021)[Book/Report › Report]. Agterberg, P., Bijl, M., Hurink, J. L., LaPoutre, H., van de Vreede, G. & de Weerdt, M.Almost eulerian compatible spanning circuits in edge-colored graphs (2021)Discrete mathematics, 344(1). Article 112174. Guo, Z., Broersma, H., Li, B. & Zhang, S.https://doi.org/10.1016/j.disc.2020.112174Extreme-value theory for large fork-join queues, with an application to high-tech supply chains (2021)[Working paper › Preprint]. Meijer, M. S., Schol, D., van Jaarsveld, W., Vlasiou, M. & Zwart, B.https://doi.org/10.48550/arXiv.2105.09189Gallai-Ramsey numbers for graphs and their generalizations (2021)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Li, X.https://doi.org/10.3990/1.9789036552486On hamiltonicity of 1-tough triangle-free graphs (2021)Electronic journal of graph theory and applications, 9(2), 433-441. Zheng, W., Broersma, H. & Wang, L.https://doi.org/10.5614/ejgta.2021.9.2.15Sharp upper bounds for augmented zagreb index of graphs with fixed parameters (2021)Match, 85(2), 257-274. Li, F., Ye, Q., Broersma, H. & Ye, R.Two-Stage Facility Location Games with Strategic Clients and Facilities (2021)In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021): Montreal, 19-27 August 2021 (pp. 292-298) (IJCAI International Joint Conference on Artificial Intelligence). International Joint Conferences on Artificial Intelligence. Krogmann, S., Lenzner, P., Molitor, L. & Skopalik, A.https://doi.org/10.24963/ijcai.2021/41
2020
Improving Approximate Pure Nash Equilibria in Congestion Games (2020)In Web and Internet Economics: 16th International Conference, WINE 2020, Proceedings (pp. 280-294) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12495 LNCS). Springer. Ravindran Vijayalakshmi, V. & Skopalik, A.https://doi.org/10.1007/978-3-030-64946-3_20Limit theorems for assortativity and clustering in null models for scale-free networks (2020)Advances in applied probability, 52(4), 1035-1084. van der Hofstad, R., van der Hoorn, P., Litvak, N. & Stegehuis, C.https://doi.org/10.1017/apr.2020.42Influence of co-depositor materials and modification of substrate on the formation of dendrites on the anode of a zinc-based secondary battery (2020)Sustainable Energy Technologies and Assessments, 42. Article 100820. Homan, B., Quintero Pulido, D. F., ten Kortenaar, M. V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1016/j.seta.2020.100820Smoothed Analysis of Local Search (2020)In Beyond the Worst-Case Analysis of Algorithms (pp. 285-308). Cambridge University Press. Manthey, B.https://doi.org/10.1017/9781108637435.018Tropical Ehrhart theory and tropical volume (2020)Research in Mathematical Sciences, 7(4). Article 30. Loho, G. & Schymura, M.https://doi.org/10.1007/s40687-020-00228-1A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem (2020)[Working paper › Working paper]. ArXiv.org. Siemann, M. & Walter, M.Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs (2020)[Working paper › Working paper]. ArXiv.org. Walter, M.https://doi.org/10.48550/arXiv.2011.06076Optimization of Multi-Energy Systems Using the Profile Steering Coordination Framework (2020)In 2020 IEEE PES Innovative Smart Grid Technologies Europe (ISGT-Europe) (pp. 91-95). Article 9248766. IEEE. Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGT-Europe47291.2020.9248766Profile Steering with Non-regular Time-Intervals (2020)In 2020 IEEE PES Innovative Smart Grid Technologies Europe: Smart Grids: key enablers of a green power system (pp. 284-288). Article 9248922. IEEE. Bollen, L. M., Heinsius, L. R., Souilljee, M. L., Boe, M., Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGT-Europe47291.2020.9248922Speed-Robust Scheduling (2020)[Working paper › Working paper]. ArXiv.org. Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.48550/arXiv.2011.05181Speed-Robust Scheduling: Sand, Bricks, and Rocks (2020)[Working paper › Preprint]. ArXiv.org. Eberle, F., Hoeksma, R., Megow, N., Nölke, L., Schewior, K. & Simon, B.https://doi.org/10.48550/arXiv.2011.05181Batteries in Smart Microgrids (2020)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Homan, B.https://doi.org/10.3990/1.9789036549578On sufficient spectral radius conditions for hamiltonicity of k-connected graphs (2020)Linear algebra and its applications, 604, 129-145. Zhou, Q., Broersma, H., Wang, L. & Lu, Y.https://doi.org/10.1016/j.laa.2020.06.012Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (2020)Journal of combinatorial optimization, 40(4), 1008-1019. Guo, Z., Broersma, H., Li, R. & Zhang, S.https://doi.org/10.1007/s10878-020-00644-7A deep learning approach to realize funtionality in nanoelectronic devices (2020)Nature nanotechnology, 15, 992-998. Ruiz Euler, H.-C., Boon, M. N., Wildeboer, J. T., van de Ven, B., Chen, T., Broersma, H., Bobbert, P. A. & van der Wiel, W. G.https://doi.org/10.1038/s41565-020-00779-yCross-border Energy Communities on a Distribution Grid Level (2020)In 2020 17th International Conference on the European Energy Market (EEM). Article 9221917. IEEE. Stroink, A., Wawer, T. & Hurink, J. L.https://doi.org/10.1109/EEM49802.2020.9221917Contact tracing in configuration models (2020)[Working paper › Working paper]. ArXiv.org. Kryven, I. & Stegehuis, C.https://doi.org/10.48550/arXiv.2010.05590Spectral properties of inverse sum indeg index of graphs (2020)Journal of Mathematical Chemistry, 58(9), 2108-2139. Li, F., Li, X. & Broersma, H.https://doi.org/10.1007/s10910-020-01170-xSpeed of convergence to the quasi-stationary distribution for Lévy input fluid queues (2020)Queueing systems, 96(1-2), 153-167. Palmowski, Z. & Vlasiou, M.https://doi.org/10.1007/s11134-020-09664-wCompatible spanning circuits in edge-colored graphs (2020)[Thesis › PhD Thesis - Research external, graduation UT]. University of Twente. Guo, Z.https://doi.org/10.3990/1.9789036550468A fast algorithm for quadratic resource allocation problems with nested constraints (2020)[Working paper › Preprint]. ArXiv.org. Uiterkamp, M. H. H. S., Hurink, J. L. & Gerards, M. E. T.https://doi.org/10.48550/arXiv.2009.03880Matching fields and lattice points of simplices (2020)Advances in Mathematics, 370. Article 107232. Loho, G. & Smith, B.https://doi.org/10.1016/j.aim.2020.107232On a reduction for a class of resource allocation problems (2020)[Working paper › Preprint]. ArXiv.org. Uiterkamp, M. H. H. S., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.48550/arXiv.2008.11829Oddo: Online Duality-Driven Optimization (2020)[Working paper › Preprint]. ArXiv.org. Uiterkamp, M. H. H. S., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.48550/arXiv.2008.09838Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (2020)In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (pp. 18:1-18:15). Article MFCS-2020-18 (Leibniz International Proceedings in Informatics (LIPIcs)). Dagstuhl. Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B.https://doi.org/10.4230/LIPIcs.MFCS.2020.18Counting triangles in power-law uniform random graphs (2020)The Electronic journal of combinatorics, 27(3), 1-28. Article P3.19. Gao, P., van der Hofstad, R., Southwell, A. & Stegehuis, C.https://doi.org/10.37236/9239Closure coefficients in scale-free complex networks (2020)Journal of Complex Networks, 8(3). Article cnaa020. Stegehuis, C.https://doi.org/10.1093/comnet/cnaa020Improving approximate pure Nash equilibria in congestion games (2020)[Working paper › Preprint]. ArXiv.org. Skopalik, A. & Ravindran Vijayalakshmi, V.https://doi.org/10.48550/arXiv.2007.15520Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes (2020)[Working paper › Working paper]. ArXiv.org. Ruiz, H.-C., Alegre Ibarra, U., van de Ven, B., Broersma, H., Bobbert, P. A. & van der Wiel, W. G.https://arxiv.org/abs/2007.12371Quadratic nonseparable resource allocation problems with generalized bound constraints (2020)[Working paper › Preprint]. ArXiv.org. Schoot Uiterkamp, M. H. H., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.48550/arXiv.2007.06280Cooperative sequencing games with position-dependent learning effect (2020)Operations research letters, 48(4), 428-434. Yang, G., Sun, H. & Uetz, M.https://doi.org/10.1016/j.orl.2020.04.013Efficient inference in stochastic block models with vertex labels (2020)IEEE Transactions on Network Science and Engineering, 7(3), 1215-1225. Stegehuis, C. & Massoulié, L.https://doi.org/10.1109/TNSE.2019.2913949On sufficient degree conditions for traceability of claw-free graphs (2020)Discrete mathematics, 343(7). Article 111883. Tian, T., Broersma, H. & Xiong, L.https://doi.org/10.1016/j.disc.2020.111883Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs (2020)Journal of graph theory, 94(3), 476-493. Li, R., Broersma, H. & Zhang, S.https://doi.org/10.1002/jgt.22536Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics (2020)In 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020). Article 19 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 159). Dagstuhl. Klootwijk, S. & Manthey, B.https://doi.org/10.4230/LIPIcs.AofA.2020.19A PTAS for Euclidean TSP with Hyperplane Neighborhoods (2020)ACM transactions on algorithms, 16(3). Article 38. Antoniadis, A., Fleszar, K., Hoeksma, R. & Schewior, K.https://doi.org/10.1145/3383466Greed works-online algorithms for unrelated machine stochastic scheduling (2020)Mathematics of operations research, 45(2), 497-516. Gupta, V., Moseley, B., Uetz, M. & Xie, Q.https://doi.org/10.1287/moor.2019.0999Persistency of Linear Programming Relaxations for the Stable Set Problem (2020)In Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings (pp. 351-363) (Lecture Notes in Computer Science; Vol. 12125). Springer. Rodríguez-Heck, E., Stickler, K., Walter, M. & Weltge, S.https://doi.org/10.1007/978-3-030-45771-6_27A fluid model of an electric vehicle charging network (2020)[Working paper › Preprint]. ArXiv.org. Aveklouris, A., Vlasiou, M. & Zwart, B.https://arxiv.org/abs/2004.05637Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics (2020)[Working paper › Working paper]. ArXiv.org. Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B.https://arxiv.org/abs/2003.05699On Hop-Constrained Steiner Trees in Tree-Like Metrics (2020)[Working paper › Preprint]. ArXiv.org. Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B.https://doi.org/10.48550/arXiv.2003.05699Hiring Secretaries over Time: The Benefit of Concurrent Employment (2020)Mathematics of operations research, 45(1), 323-352. Disser, Y., Fearnley, J., Gairing, M., Göbel, O., Klimm, M., Schmand, D., Skopalik, A. & Tönnis, A.https://doi.org/10.1287/moor.2019.0993A Greedy algorithm for local heating (2020)[Working paper › Preprint]. ArXiv.org. Fink, J. & Hurink, J. L.https://doi.org/10.48550/arXiv.2001.08409Classification with a disordered dopant-atom network in silicon (2020)Nature, 577, 341-345. Chen, T., van Gelder, J., van de Ven, B., Amitonov, S. V., de Wilde, B., Ruiz Euler, H.-C., Broersma, H., Bobbert, P. A., Zwanenburg, F. A. & van der Wiel, W. G.https://doi.org/10.1038/s41586-019-1901-0Parity polytopes and binarization (2020)Discrete applied mathematics, 272, 24-30. Ermel, D. & Walter, M.https://doi.org/10.1016/j.dam.2018.04.008A Hybrid Pricing Mechanism for Joint System Optimization and Social Acceptance (2020)[Contribution to conference › Paper] 6th IEEE International Energy Conference 2020. Reijnders, V. M. J. J., Gerards, M. E. T. & Hurink, J. L.Abstract tropical linear programming (2020)The Electronic journal of combinatorics, 27(2), 1-68. Article P2.51. Loho, G.https://doi.org/10.37236/7718Anticipatory Vehicle Routing for Same-Day Pick-up and Delivery using Historical Data Clustering (2020)In 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC). IEEE. Lochem, J. v., Kronmueller, M., van 't Hof, P. & Alonso-Mora, J.https://doi.org/10.1109/ITSC45102.2020.9294424Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs (2020)Discrete mathematics, 343(1). Article 111644. Zheng, W., Broersma, H., Wang, L. & Zhang, S.https://doi.org/10.1016/j.disc.2019.111644Monomial tropical cones for multicriteria optimization (2020)SIAM journal on discrete mathematics, 34(2), 1172-1191. Joswig, M. & Loho, G.https://doi.org/10.1137/17M1153066Probabilistic analysis of facility location on random shortest path metrics (2020)[Contribution to conference › Abstract] 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017. Klootwijk, S. & Manthey, B.Signed tropical convexity (2020)In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Article 24 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 151). Dagstuhl. Loho, G. & Végh, L. A.https://doi.org/10.4230/LIPIcs.ITCS.2020.24Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm (2020)Journal of graph algorithms and applications, 24(3), 397-421. Cornelissen, K. & Manthey, B.https://doi.org/10.7155/jgaa.00539
2019
Large fork-join queues with nearly deterministic arrival and service times (2019)[Working paper › Preprint]. ArXiv.org. Schol, D., Vlasiou, M. & Zwart, B.Developing a method for the operational control of an ecovat system (2019)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. de Goeijen, G. J. H.https://doi.org/10.3990/1.9789036549097Maximizing the degree of autarky of a 16 house neighbourhood by locally produced energy and smart control (2019)Sustainable Energy, Grids and Networks, 20. Article 100270. Homan, B., Hoogsteen, G., Smit, G. J. M., Hurink, J. L. & Nebiolo, S.https://doi.org/10.1016/j.segan.2019.100270Closure coefficients in scale-free complex networks (2019)[Working paper › Working paper]. ArXiv.org. Stegehuis, C.https://arxiv.org/abs/1911.11410DEMKit: a Decentralized Energy Management Simulation and Demonstration Toolkit (2019)In IEEE PES Innovative Smart Grid Technologies Europe (ISGT-Europe). Article 8905439. IEEE. Hoogsteen, G., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope.2019.8905439Improving the Degree of Autarky of a 16 House Neighbourhood in the Netherlands: A case study (2019)In 2019 IEEE PES Innovative Smart Grid Technologies Europe: New Businesses for Energy Transition. Article 8905491. IEEE. Homan, B., Nebiolo, S., Hoogsteen, G., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2019.8905491Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials (2019)[Working paper › Working paper]. ArXiv.org. Hojny, C., Pfetsch, M. E. & Walter, M.Persistency of Linear Programming Formulations for the Stable Set Problem (2019)[Working paper › Working paper]. ArXiv.org. Rodríguez-Heck, E., Stickler, K., Walter, M. & Weltge, S.https://arxiv.org/abs/1911.01478Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs (2019)Discussiones mathematicae. Graph theory, 42(1), 187-196. Zheng, W., Broersma, H. & Wang, L.https://doi.org/10.7151/dmgt.2247The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing (2019)Mathematics of operations research, 44(4), 1286-1303. Correa, J., de Jong, J., de Keijzer, B. & Uetz, M.https://doi.org/10.1287/moor.2018.0968Energy Storage Technologies for Off-grid Houses (2019)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Quintero Pulido, D. F.https://doi.org/10.3990/1.9789036548267Bounds and limit theorems for a layered queueing model in electric vehicle charging (2019)Queueing systems, 83-137. Aveklouris, A., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/s11134-019-09616-zFrom hotelling to load balancing: Approximation and the principle of minimum differentiation (2019)In 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 (pp. 1949-1951) (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 4). The International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). Feldotto, M., Molitor, L., Lenzner, P. & Skopalik, A.https://dl.acm.org/doi/10.5555/3306127.3331973A Stochastic Resource-Sharing Network for Electric Vehicle Charging (2019)IEEE transactions on control of network systems, 6(3), 1050-1061. Aveklouris, A., Vlasiou, M. & Zwart, B.https://doi.org/10.1109/TCNS.2019.2915651Degree correlations in scale-free random graph models (2019)Journal of applied probability, 56(3), 672-700. Stegehuis, C.https://doi.org/10.1017/jpr.2019.45Extended formulations for radial cones (2019)Operations research letters, 47(5), 458-463. Walter, M. & Weltge, S.https://doi.org/10.1016/j.orl.2019.05.004Inconsistenties in de Arbeidstijdenwet: Wiskunde toegepast in de weerbarstige praktijk (2019)STAtOR, 20(3), 26-29. Post, G. F., van der Veen, E., Fijn van Draat, L. & De Greef, S.On the complexity of anchored rectangle packing (2019)In 27th Annual European Symposium on Algorithms, ESA 2019 (pp. 1-14). Article 8 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 144). Dagstuhl. Antoniadis, A., Cristi, A., Hoeksma, R., Kling, P., Biermeier, F., Damerius, C., Kaaser, D. & Nölke, L.https://doi.org/10.4230/LIPIcs.ESA.2019.8Subgraphs in preferential attachment models (2019)Advances in applied probability, 51(3), 898-926. Garavaglia, A. & Stegehuis, C.https://doi.org/10.1017/apr.2019.36The quality of equilibria for set packing and throughput scheduling games (2019)International journal of game theory, 49, 321-344. de Jong, J. & Uetz, M.https://doi.org/10.1007/s00182-019-00693-1An average case analysis of the minimum spanning tree heuristic for the power assignment problem (2019)Random Structures and Algorithms, 55(1), 89-103. Article RSA20831. de Graaf, M., Boucherie, R., Hurink, J. L. & van Ommeren, J. C. W.https://doi.org/10.1002/rsa.20831Multi-Unit Bilateral Trade (2019)In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (pp. 1973-1980). AAAI. Gerstgrasser, M., Goldberg, P. W., Keijzer, B. d., Lazos, P. & Skopalik, A.https://doi.org/10.1609/aaai.v33i01.33011973A polynomial algorithm for weighted scattering number in interval graphs (2019)Discrete applied mathematics, 264, 118-124. Li, F., Zhang, X. & Broersma, H.https://doi.org/10.1016/j.dam.2019.01.004The Almost-Disjoint 2-Path Decomposition Problem (2019)[Working paper › Working paper]. Thome, A. & Walter, M.Network investment games with wardrop followers (2019)In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Article 151 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 132). Dagstuhl. Schmand, D., Schröder, M. & Skopalik, A.https://doi.org/10.4230/LIPIcs.ICALP.2019.151Scheduling self-suspending tasks: New and old results (2019)In 31st Euromicro Conference on Real-Time Systems, ECRTS 2019 (pp. 1-23). Article 16 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 133). Dagstuhl. Chen, J.-J., Hahn, T., Hoeksma, R., Megow, N. & von der Brüggen, G.https://doi.org/10.4230/LIPIcs.ECRTS.2019.16Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (2019)SIAM journal on discrete mathematics, 33(2), 1061-1094. Walter, M.https://doi.org/10.1137/16M1089691Scale-free network clustering in hyperbolic and other random graphs (2019)Journal of physics A: mathematical and theoretical, 52(29). Article 295101. Stegehuis, C., Hofstad, R. v. d. & Leeuwaarden, J. S. H. v.https://doi.org/10.1088/1751-8121/ab2269Probabilistic Analysis of Facility Location on Random Shortest Path Metrics (2019)In Computing with Foresight and Industry: 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings (pp. 37-49) (Lecture Notes in Computer Science; Vol. 11558). Springer. Klootwijk, S. & Manthey, B.https://doi.org/10.1007/978-3-030-22996-2_4Combining distributed synchronized high frequency measurements with a control system for smart low voltage grids (2019)In Proceedings of the 25th International Conference on Electricity Distribution (CIRED 2019). Article 1058. CIRED. Hoogsteen, G., Gerards, M. E. T., Hurink, J. L., Smit, G. J. M., Mansour, O. & Bijwaard, D.PV Predictions Made Easy: Flexibility Through Simplicity (2019)In Proceedings of the 25th International Conference on Electricity Distribution (CIRED 2019). Article 1857 (CIRED Conference Proceedings). CIRED. Gerards, M. E. T. & Hurink, J. L.https://www.cired-repository.org/handle/20.500.12455/610Characteristics of halide oxidation at graphite electrode for use in halide batteries (2019)Sustainable Energy Technologies and Assessments, 33, 14-23. Quintero Pulido, D. F., Kortenaar, M. V. t., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1016/j.seta.2019.03.001Pricing mechanism based on losses using grid topology (2019)In 2019 IEEE Milan PowerTech. Article 8810436 (2019 IEEE Milan PowerTech, PowerTech 2019). IEEE. Reijnders, V. M. J. J., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/PTC.2019.8810436Using the ecovat system to supply the heat demand of a neighbourhood (2019)In 2019 IEEE Milan PowerTech, PowerTech 2019. Article 8810724. IEEE. de Goeijen, G. J. H., Hoogsteen, G., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2019.8810724The role of off-grid houses in the energy transition with a case study in the Netherlands (2019)Energies, 12(10). Article 2033. Quintero Pulido, D. F., Ten Kortenaar, M. V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.3390/en12102033Variational principle for scale-free network motifs (2019)Scientific reports, 9. Article 6762. Stegehuis, C., Hofstad, R. v. d. & Leeuwaarden, J. S. H. v.https://doi.org/10.1038/s41598-019-43050-8Decompositions of graphs based on a new graph product (2019)Discrete applied mathematics, 259, 31 - 40. Boode, A. H. & Broersma, H.https://doi.org/10.1016/j.dam.2018.12.014Network Investment Game with Wardrop Followers (2019)[Working paper › Preprint]. ArXiv.org. Schmand, D., Schröder, M. & Skopalik, A.https://doi.org/10.48550/arXiv.1904.10417Switch chain mixing times and triangle counts in simple random graphs with given degrees (2019)Journal of Complex Networks, 7(2), 210-225. Article cny013. Bannink, T., Hofstad, R. v. d. & Stegehuis, C.https://doi.org/10.1093/comnet/cny013Probabilistic Analysis of Facility Location on Random Shortest Path Metrics (2019)[Working paper › Preprint]. ArXiv.org. Klootwijk, S. & Manthey, B.https://doi.org/10.48550/arXiv.1903.11980A realistic model for battery state of charge prediction in energy management simulation tools (2019)Energy, 171, 205-217. Homan, B., Ten Kortenaar, M., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1016/j.energy.2018.12.134From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation (2019)[Working paper › Working paper]. Feldotto, M., Lenzner, P., Molitor, L. & Skopalik, A.https://arxiv.org/abs/1903.04265The sequential price of anarchy for affine congestion games with few players (2019)Operations research letters, 47(2), 133-139. de Jong, J. & Uetz, M. J.https://doi.org/10.1016/j.orl.2019.01.008Complaint, compromise and solution concepts for cooperative games (2019)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Sun, P.https://doi.org/10.3990/1.9789036547192Values for Cooperative Games with Restricted Coalition Formation (2019)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Li, X.https://doi.org/10.3990/1.9789036547208Pure Nash equilibria in restricted budget games (2019)Journal of combinatorial optimization, 37(2), 620-638. Drees, M., Feldotto, M., Riechers, S. & Skopalik, A.https://doi.org/10.1007/s10878-018-0269-7Complete resource pooling of a load balancing policy for a network of battery swapping stations (2019)[Working paper › Preprint]. ArXiv.org. Sloothaak, F., Cruise, J. R., Shneer, S., Vlasiou, M. & Zwart, B.The price of anarchy for utilitarian scheduling games on related machines (2019)Discrete optimization, 31, 29-39. Hoeksma, R. P. & Uetz, M.https://doi.org/10.1016/j.disopt.2018.08.001Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs (2019)Graphs and combinatorics, 35(1), 261-286. Li, R., Broersma, H. & Zhang, S.https://doi.org/10.1007/s00373-018-1989-2A PTAS for Euclidean TSP with hyperplane neighborhoods (2019)In Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1089-1105). SIAM. Antoniadis, A., Fleszar, K., Hoeksma, R. & Schewior, K.https://doi.org/10.1137/1.9781611975482.67Compatible spanning circuits in edge-colored Fan-type graphs (2019)[Contribution to conference › Paper] 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. Guo, Z., Broersma, H., Li, B. & Zhang, S.Degree, Toughness and Subgraph Conditions for Hamiltonian Properties of Graphs (2019)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zheng, W.https://doi.org/10.3990/1.9789036548083Implicit heavy subgraph conditions for hamiltonicity of almost distance-hereditary graphs (2019)[Contribution to conference › Paper] 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018. Zheng, W., Broersma, H. & Wang, L.Lower bound computations for the nonnegative rank (2019)[Contribution to conference › Paper] 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. Fiorini, S., Guo, K., Macchia, M. & Walter, M.Multi-Unit Bilateral Trade (2019)[Working paper › Working paper]. ArXiv.org. Gerstgrasser, M., Goldberg, P. W., de Keijzer, B., Lazos, P. & Skopalik, A.https://arxiv.org/abs/1811.05130v1Network congestion games are robust to variable demand (2019)Transportation research. Part B: Methodological, 119, 69-78. Correa, J., Hoeksma, R. & Schröder, M.https://doi.org/10.1016/j.trb.2018.11.010On sufficient spectral radius conditions for hamiltonicity (2019)[Contribution to conference › Paper] 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. Zhou, Q., Broersma, H., Wang, L. & Lu, Y.On the spectra of general random mixed graphs (2019)[Contribution to conference › Paper] 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018. Hu, D., Broersma, H., Hou, J. & Zhang, S.Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics (2019)In WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27-March 2, 2019. Proceedings (pp. 108-120) (Lecture Notes in Computer Science; Vol. 11355) (Theoretical Computer Science and General Issues). Springer. Klootwijk, S., Manthey, B. & Visser, S. K.https://doi.org/10.1007/978-3-030-10564-8_9Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (2019)[Book/Report › Book] 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. University of Twente. Hurink, J. L., Klootwijk, S., Manthey, B., Reijnders, V. & Schoot Uiterkamp, M.Sufficient conditions for hamiltonian properties of graphs (2019)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zhou, Q.https://doi.org/10.3990/1.9789036548649Sufficient degree conditions for traceability of claw-free graphs (2019)[Contribution to conference › Paper] 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018. Tian, T., Broersma, H. & Xiong, L.The VeRoLog Solver Challenge 2019 (2019)Journal on Vehicle Routing Algorithms, 2, 109. Gromicho, J. A. S., van 't Hof, P. & Vigo, D.https://doi.org/10.1007/s41604-019-00011-8Toughness and forbidden subgraphs for hamiltonian-connected graphs (2019)[Contribution to conference › Paper] 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. Zheng, W., Broersma, H. & Wang, L.
2018
Offline and online scheduling of electric vehicle charging with a minimum charging threshold (2018)In 2018 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) . Article 8587556. IEEE. Schoot Uiterkamp, M. H. H., van der Klauw, T., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/SmartGridComm.2018.8587556A Heuristic Approach to Control the Ecovat System (2018)In 2018 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe). IEEE. de Goeijen, G. J. H., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2018.8571598Fill-level prediction in online valley-filling algorithms for electric vehicle charging (2018)In Proceedings - 2018 IEEE PES Innovative Smart Grid Technologies Conference Europe, ISGT-Europe 2018. Article 8571605. IEEE. Schoot Uiterkamp, M. H. H., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope.2018.8571605Implementation and Verification of a Realistic Battery Model in the DEMKit Simulation Software (2018)In 2018 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe). Article 8571691. IEEE. Homan, B., Reijnders, V. M. J. J., Hoogsteen, G., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2018.8571691On the Scalability of Decentralized Energy Management using Profile Steering (2018)In Proceedings - 2018 IEEE PES Innovative Smart Grid Technologies Conference Europe, ISGT-Europe 2018. Article 8571823. IEEE. Hoogsteen, G., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope.2018.8571823Analysis of Equilibria for Generalized Market Sharing Games (2018)[Contribution to conference › Poster] 14th Conference on Web and Internet Economics, WINE 2018 . Brethouwer, J.-T., de Jong, J., Uetz, M. J. & Skopalik, A.Mesoscopic scales in hierarchical configuration models (2018)Stochastic processes and their applications, 128(12), 4246-4276. van der Hofstad, R., van Leeuwaarden, J. S. H. & Stegehuis, C.https://doi.org/10.1016/j.spa.2018.02.006Simulation of sizing of energy storage for off-grid decentralized wastewater treatment units: A case study in the Netherlands (2018)Water Practice and Technology, 13(4), 771–779. Quintero Pulido, D. F., Barreto , C. M., ten Kortenaar, M. V., Balda, R. R., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.2166/wpt.2018.087Extremal benzenoid systems for two modified versions of the Randić index (2018)Applied mathematics and computation, 337, 14-24. Li, F., Broersma, H., Rada, J. & Sun, Y.https://doi.org/10.1016/j.amc.2018.05.021Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions (2018)Algorithmica, 80(11), 3132-3157. Boros, E., Elbassioni, K., Fouz, M., Gurvich, V., Makino, K. & Manthey, B.https://doi.org/10.1007/s00453-017-0372-7Congestion games with mixed objectives (2018)Journal of combinatorial optimization, 36(4), 1145-1167. Feldotto, M., Leder, L. & Skopalik, A.https://doi.org/10.1007/s10878-017-0189-yRecent Developments in Prophet Inequalities (2018)ACM SIGecom Exchanges, 17(1), 61-70. Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T. & Vredeveld, T.https://doi.org/10.1145/3331033.3331039Triadic closure in configuration models with unbounded degree fluctuations (2018)Journal of statistical physics, 173(3-4), 746-774. Hofstad, R. v. d., Leeuwaarden, J. S. H. v. & Stegehuis, C.https://doi.org/10.1007/s10955-018-1952-xProbabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics (2018)[Working paper › Preprint]. ArXiv.org. Klootwijk, S., Manthey, B. & Visser, S. K.https://doi.org/10.48550/arXiv.1810.11232Bounds and Limit Theorems for a Layered Queueing Model in Electric Vehicle Charging (2018)[Working paper › Preprint]. ArXiv.org. Aveklouris, A., Vlasiou, M. & Zwart, B.https://arxiv.org/abs/1810.05473Implementation and Verification of a Realistic Battery Model in the DEMKit Simulation Software (2018)[Contribution to conference › Poster] 8th IEEE PES Innovative Smart Grid Technologies Conference Europe 2018. Homan, B., Reijnders, V. M. J. J., Hoogsteen, G., Hurink, J. L. & Smit, G. J. M.Degree Conditions for Hamiltonian Properties of Claw-free Graphs (2018)[Thesis › PhD Thesis - Research UT, graduation UT]. Ipskamp Printing. Tian, T.https://doi.org/10.3990/1.9789036546102The spectral analysis of random graph matrices (2018)[Thesis › PhD Thesis - Research UT, graduation UT]. Ipskamp Printing. Hu, D.https://doi.org/10.3990/1.9789036546089Het toewijzen van voorkeursactiviteiten (2018)STAtOR, 19(3), 20-23. Kleinluchtenbeld, S. & Post, G. F.Belief propagation for the maximum-weight independent set and minimum spanning tree problems (2018)Theoretical computer science, 738, 53-64. Cornelissen, K. & Manthey, B.https://doi.org/10.1016/j.tcs.2018.04.046SciSports: Learning football kinematics through two-dimensional tracking data (2018)[Working paper › Working paper]. Babic, A., Bansal, H., Finocchio, G., Golak, J., Peletier, M., Portegies, J., Stegehuis, C., Tyagi, A., Vincze, R. & Yoo, W. W.https://arxiv.org/abs/1808.04550A Unified Nurse Rostering Model Based on XHSTT (2018)In PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling (pp. 81-96). PATAT. Kingston, J. H., Post, G. F. & Vanden Berghe, G.Thematic poster on women in mathematics in the Netherlands (2018)[Contribution to conference › Poster]. Vlasiou, M.Computability and Complexity of Unconventional Computing Devices (2018)In Computational Matter (pp. 185-229) (Natural Computing Series). Springer. Broersma, H., Stepney, S. & Wendin, G.https://doi.org/10.1007/978-3-319-65826-1_11Philosophy of Computation (2018)In Computational Matter (pp. 153-184) (Natural Computing Series). Springer. Konkoli, Z., Stepney, S., Broersma, H., Dini, P., Nehaniv, C. L. & Nichele, S.https://doi.org/10.1007/978-3-319-65826-1_10The SCIP Optimization Suite 6.0 (2018)[Book/Report › Report]. Zuse Institute Berlin. Gleixner, A., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R. L., Hendel, G., Hojny, C., Koch, T., Lübbecke, M. E., Maher, S. J., Miltenberger, M., Müller, B., Pfetsch, M. E., Puchert, C., Rehfeldt, D., Schlösser, F., Schubert, C., Serrano, F., … Witzig, J.http://nbn-resolving.de/urn:nbn:de:0297-zib-69361A tutorial on mechanism design in scheduling (2018)In The SECOND international workshop on dynamic scheduling problems. Polish Mathematical Society. Hoeksma, R.https://doi.org/10.14708/isbn.978-83-951298-0-3p31-36On the automation of periodic hard real-time processes: a graph-theoretical approach (2018)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Boode, A. H.https://doi.org/10.3990/1.9789036545518A market-based framework for demand side flexibility scheduling and dispatching (2018)Sustainable Energy, Grids and Networks, 14, 47-61. Torbaghan, S. S., Blaauwbroek, N., Kuiken, D., Gibescu, M., Haji Ghasemi, M., Phuong Nguyen, Smit, G. J. M., Roggenkamp, M. & Hurink, J.https://doi.org/10.1016/j.segan.2018.03.003Disaggregating User Evaluations Using the Shapley Value (2018)In Proceedings of NetEcon '18 the 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018) : the 13th Workshop on the Economics of Networks, Systems and Computation : June 18, 2018, Irvine, California, USA (pp. 5:1-5:6). Association for Computing Machinery. Feldotto, M., Haake, C.-J., Skopalik, A. & Stroh-Maraun, N.https://doi.org/10.1145/3230654.3230659Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics (2018)[Contribution to conference › Paper] 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018. Klootwijk, S., Manthey, B. & Visser, S. K.Stochastic networks for electric vehicle charging (2018)[Contribution to conference › Poster]. Vlasiou, M.SUPERSET: A (Super) natural variant of the card game SET (2018)In 9th International Conference on Fun with Algorithms, FUN 2018 (pp. 12:1-12:17). Article 12 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 100). Dagstuhl. Botler, F., Cristi, A., Hoeksma, R., Schewior, K. & Tönnis, A.https://doi.org/10.4230/LIPIcs.FUN.2018.12Testing grid-based electricity prices and batteries in a field test (2018)In CIRED 2018 Ljubljana Workshop on Microgrids and Local Energy Communities. Article 0500 (CIRED Workshop Series). CIRED. Reijnders, V. M. J. J., Gerards, M. E. T., Hurink, J. L. & Smit, G. J. M.https://www.cired-repository.org/handle/20.500.12455/1155Testing Grid-Based Electricity Prices and Batteries in a Field Test (2018)[Contribution to conference › Poster] CIRED 2018 Ljubljana Workshop on Microgrids and Local Energy Communities. Reijnders, V. M. J. J., Gerards, M. E. T., Hurink, J. L. & Smit, G. J. M.Finding induced subgraphs in scale-free inhomogeneous random graphs (2018)In Algorithms and Models for the Web Graph: 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings (pp. 1-15). Springer. Cardinaels, E., Leeuwaarden, J. S. H. v. & Stegehuis, C.https://doi.org/10.1007/978-3-319-92871-5_1Evolving Networks To Have Intelligence Realized At Nanoscale (2018)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Lawrence, C. P.https://doi.org/10.3990/1.9789036545471Conditions for graphs to be path partition optimal (2018)Discrete mathematics, 341(5), 1350-1358. Li, B., Broersma, H. & Zhang, S.https://doi.org/10.1016/j.disc.2018.02.011A PTAS for Euclidean TSP with Hyperplane Neighborhoods (2018)[Working paper › Working paper]. ArXiv.org. Antoniadis, A., Fleszar, K., Hoeksma, R. & Schewior, K.https://arxiv.org/abs/1804.03953Queueing Networks for Electric Vehicle Charging (2018)[Contribution to conference › Poster]. Vlasiou, M.Integrated scheduling of tasks and gynecologists to improve patient appointment scheduling: a case study (2018)Operations research for health care, 16, 10-19. van de Vrugt, N. M., Luen-English, S. T., Bastiaansen, W. A. P., Kleinluchtenbeld, S., Lardinois, W. T. P., Pots, M. H., Schoonbergen, D. H., Hans, E. W., Hurink, J. L. & Boucherie, R. J.https://doi.org/10.1016/j.orhc.2017.11.002Perturbation resilience for the facility location problem (2018)Operations research letters, 46(2), 215-218. Manthey, B. & Tijink, M. B.https://doi.org/10.1016/j.orl.2018.01.003The VeRoLog solver challenge 2016–2017 (2018)Journal on Vehicle Routing Algorithms, 1(1), 69-71. Dullaert, W., Gromicho, J. A. S., van Hoorn, J., Post, G. F. & Vigo, D.https://doi.org/10.1007/s41604-016-0001-7Approximation Algorithms for Connected Graph Factors of Minimum Weight (2018)Theory of computing systems, 62(2), 441-464. Cornelissen, K., Hoeksma, R., Manthey, B., Narayanaswamy, N. S., Rahul, C. S. & Waanders, M.https://doi.org/10.1007/s00224-016-9723-zCharacterization of Storage Sizing for an Off-Grid House in the US and the Netherlands (2018)Energies, 11(2). Article 265. Quintero Pulido, D. F., Hoogsteen, G., Ten Kortenaar, M. V., Hurink, J. L., Hebner, R. E. & Smit, G. J. M.https://doi.org/10.3390/en11020265Properly colored cycles in edge-colored graphs (2018)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Li, R.https://doi.org/10.3990/1.9789036544719Evolution in Nanomaterio: The NASCENCE Project (2018)In Inspired by Nature: Essays Presented to Julian F. Miller on the Occasion of his 60th Birthday (pp. 87-111) (Emergence, Complexity and Computation; Vol. 28). Springer. Broersma, H.https://doi.org/10.1007/978-3-319-67997-6_4Probabilistic Properties of Highly Connected Random Geometric Graphs (2018)In Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Proceedings: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings (pp. 59-72) (Communications in Computer and Information Science; Vol. 10743 LNCS). Springer. Manthey, B. & Reijnders, V. M. J. J.https://doi.org/10.1007/978-3-319-74180-2_5Solving the Shifts and Breaks Design Problem Using Integer Linear Programming (2018)In PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling (pp. 137-152). Article 16. Akkermans, A., Post, G. F. & Uetz, M. J.https://patatconference.org/patat2018/files/proceedings/paper16.pdfThe asymptotic price of anarchy for k-uniform congestion games (2018)In Approximation and Online Algorithms: 15th International Workshop, WAOA 2017, Revised Selected Papers (pp. 317-328) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10787 LNCS). Springer. de Jong, J., Kern, W., Steenhuisen, B. & Uetz, M.https://doi.org/10.1007/978-3-319-89441-6_23
2017
Heavy-traffic approximations for a layered network with limited resources (2017)Probability and mathematical statistics, 37(2), 497-532. Aveklouris, A., Vlasiou, M., Zhang, J. & Zwart, B.https://doi.org/10.19195/0208-4147.37.2.15Limit theorems for assortativity and clustering in null models for scale-free networks (2017)[Working paper › Preprint]. ArXiv.org. van der Hofstad, R., van der Hoorn, P., Litvak, N. & Stegehuis, C.https://doi.org/10.48550/arXiv.1712.08097A Cyber-Physical Systems Perspective on Decentralized Energy Management (2017)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Hoogsteen, G.https://doi.org/10.3990/1.9789036544320Improving an Integer Linear Programming Model of an Ecovat Buffer by Adding Long-Term Planning (2017)Energies. Article 2039. de Goeijen, G. J. H., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.3390/en10122039Greed Works - Online Algorithms For Unrelated Machine Stochastic Scheduling (2017)[Working paper › Working paper]. ArXiv.org. Gupta, V., Moseley, B., Uetz, M. & Xie, Q.https://arxiv.org/abs/1703.01634A Stochastic Resource-Sharing Network for Electric Vehicle Charging (2017)[Working paper › Preprint]. ArXiv.org. Aveklouris, A., Vlasiou, M. & Zwart, B.https://arxiv.org/abs/1711.05561Speed of convergence to the quasi-stationary distribution for Lévy input fluid queues (2017)[Working paper › Preprint]. Vlasiou, M.Clustering Spectrum of scale-free networks (2017)Physical review E: covering statistical, nonlinear, biological, and soft matter physics, 96. Article 042309. Stegehuis, C., Hofstad, R. v. d., Leeuwaarden, J. S. H. v. & Janssen, A. J. E. M.https://doi.org/10.1103/PhysRevE.96.042309Congestion games with mixed objectives (2017)In Combinatorial optimization and applications: 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016. Proceedings (pp. 655-670) (Lecture Notes in Computer Science; Vol. 10043). Springer. Feldotto, M., Leder, L. & Skopalik, A.https://doi.org/10.1007/978-3-319-48749-6Charging electric vehicles, baking pizzas, and melting a fuse in Lochem (2017)CIRED: Open Access Proceedings Journal, 2017(1), 1629-1633. Article 340. Hoogsteen, G., Molderink, A., Smit, G. J. M., Hurink, J. L., Kootstra, B. & Schuring, F.https://doi.org/10.1049/oap-cired.2017.0340Demand side management in a field test: lessons learned (2017)CIRED: Open Access Proceedings Journal, 2017(1), 1678-1681. Gerards, M. E. T., Hurink, J. L. & Hübner, R.https://doi.org/10.1049/oap-cired.2017.1238Probabilistic analysis of power assignments (2017)Random Structures and Algorithms, 51(3), 483-505. de Graaf, M. & Manthey, B.https://doi.org/10.1002/rsa.20714The Quality of Equilibria for Set Packing Games (2017)[Working paper › Working paper]. ArXiv.org. Jong, J. d. & Uetz, M.https://arxiv.org/abs/1709.10289Multi-commodity support in profile steering (2017)[Contribution to conference › Paper] IEEE PES Innovative Smart Grid Technologies Conference, ISGT-Europe 2017. Schoot Uiterkamp, M. H. H., Hoogsteen, G., Gerards, M. E. T., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2017.8260190Assemble-to-order systems: A review (2017)European journal of operational research, 261(3), 866-879. Atan, Z., Ahmadi, T., Stegehuis, C., de Kok, T. & Adan, I.https://doi.org/10.1016/j.ejor.2017.02.029Paths, cycles and related partitioning problems in graphs (2017)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zhang, Z.https://doi.org/10.3990/1.9789036543859A novel incentive-based retail demand response program for collaborative participation of small customers (2017)[Contribution to conference › Paper] 12th IEEE PES PowerTech Conference. Zehir, M. A., Wevers, M. H., Batman, A., Bagriyanik, M., Hurink, J. L., Kucuk, U., Soares, F. J. & Ozdemir, A.https://doi.org/10.1109/PTC.2017.7981059On integrating device level schedules into market based control (2017)[Contribution to conference › Paper] 12th IEEE PES PowerTech Conference. Nutma, J. S., Hoogsteen, G., Molderink, A., Wijbrandi, W. E., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2017.7980984Planning based real-time control using DEMKit (2017)[Contribution to conference › Paper] 12th IEEE PES PowerTech Conference. Hajighasemi, M., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2017.7980903A QPTAS for the general scheduling problem with identical release dates (2017)In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 (pp. 31:1-31:14). Article 31 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 80). Dagstuhl. Antoniadis, A., Hoeksma, R., Meißner, J., Verschae, J. & Wiese, A.https://doi.org/10.4230/LIPIcs.ICALP.2017.31Pure Nash Equilibria in Restricted Budget Games (2017)[Contribution to conference › Paper] 24th International Conference on Computing and Combinatorics, COCOON 2018. Drees, M. W., Feldotto, M., Riechers, S. & Skopalik, A.https://doi.org/10.1007/978-3-319-62389-4_15Posted price mechanisms for a random stream of customers (2017)In EC 2017 - Proceedings of the 2017 ACM Conference on Economics and Computation (pp. 169-186) (EC 2017 - Proceedings of the 2017 ACM Conference on Economics and Computation). Association for Computing Machinery. Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T. & Vredeveld, T.https://doi.org/10.1145/3033274.3085137Asynchronous event driven distributed energy management using profile steering (2017)In 2017 IEEE Manchester PowerTech. Article 7980986. Hoogsteen, G., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2017.7980986On the value of device flexibility in smart grid applications (2017)[Contribution to conference › Paper] 12th IEEE PES PowerTech Conference. Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/PTC.2017.7981170Probabilistic Properties of Highly Connected Random Geometric Graphs (2017)[Contribution to conference › Abstract] 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017. Reijnders, V. M. J. J. & Manthey, B.http://ctw.uni-koeln.de/booklet.pdfCycle extension in edge-colored complete graphs (2017)Discrete mathematics, 340(6), 1235-1241. Li, R., Broersma, H. J., Xu, C. & Zhang, S.https://doi.org/10.1016/j.disc.2017.01.023MatchTheNet - An educational game on 3-dimensional polytopes (2017)In 33rd International Symposium on Computational Geometry, SoCG 2017 (pp. 661-665) (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 77). Dagstuhl. Joswig, M., Loho, G., Lorenz, B. & Raber, R.https://doi.org/10.4230/LIPIcs.SoCG.2017.66Stochastic online scheduling on unrelated machines (2017)In Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings (pp. 228-240) (Lecture Notes in Computer Science ; Vol. 10328). Springer. Gupta, V., Moseley, B., Uetz, M. & Xie, Q.https://doi.org/10.1007/978-3-319-59250-3_19Decentralized Energy Management with Profile Steering: Resource Allocation Problems in Energy Management (2017)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. van der Klauw, T.https://doi.org/10.3990/1.9789036543019Towards 100% renewable energy supply for urban areas and the role of smart control (2017)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. van Leeuwen, R. P.https://doi.org/10.3990/1.9789036543460Editing to a planar graph of given degrees (2017)Journal of computer and system sciences, 85, 168-182. Dabrowski, K. K., Golovach, P. A., van 't Hof, P., Paulusma, D. & Thilikos, D. M.https://doi.org/10.1016/j.jcss.2016.11.009A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm (2017)[Working paper › Working paper]. Kaibel, V. & Walter, M.https://arxiv.org/abs/1703.09505Approximating bounded-degree spanning trees and connected factors with leaves (2017)Operations research letters, 45(2), 115-118. Kern, W. & Manthey, B.https://doi.org/10.1016/j.orl.2017.01.002Adaptive Naive Bayes classification for wireless sensor networks (2017)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zwartjes, G. J.https://doi.org/10.3990/1.9789036542630Local clustering in scale-free networks with hidden variables (2017)Physical review E: covering statistical, nonlinear, biological, and soft matter physics, 95(2). Article 022307. Van Der Hofstad, R., Janssen, A. J. E. M., Van Leeuwaarden, J. S. H. & Stegehuis, C.https://doi.org/10.1103/PhysRevE.95.022307Resource allocation problems in decentralized energy management (2017)OR Spectrum = OR Spektrum, 39, 749–773. van der Klauw, T., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1007/s00291-017-0474-2Using neural networks to predict the functionality of reconfigurable nano-material networks (2017)International journal on advances in intelligent systems, 9(3&4), 339-351. Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., van der Wiel, W. G. & Schmidhuber, J.https://www.thinkmind.org/index.php?view=article&articleid=intsys_v9_n34_2016_10A Practical Approach in Glycerol Oxidation for the Development of A Glycerol Fuel Cell (2017)Trends in Green Chemistry, 3(1:5), 1-17. Quintero Pulido, D. F., Ten Kortenaar, M. V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.21767/2471-9889.100018An exact formula for all star-kipas Ramsey numbers (2017)Graphs and combinatorics, 33(1), 141-148. Li, B., Zhang, Y. & Broersma, H.https://doi.org/10.1007/s00373-016-1746-3Computing approximate pure nash equilibria in shapley value weighted congestion games (2017)In Web and Internet Economics: 13th International Conference, WINE 2017, Bangalore, India, December 17–20, 2017, Proceedings (pp. 191-204) (Lecture Notes in Computer Science; Vol. 10660). Springer. Feldotto, M., Gairing, M., Kotsialou, G. & Skopalik, A.https://doi.org/10.1007/978-3-319-71924-5_14Congestion Games with Complementarities (2017)In Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings (pp. 222-233) (Lecture Notes in Computer Science; Vol. 10236). Springer. Feldotto, M., Leder, L. & Skopalik, A.https://doi.org/10.1007/978-3-319-57586-5_19Electric vehicle charging: A queueing approach (2017)SIGMETRICS performance evaluation review, 45(2). Aveklouris, A., Nakahira, Y., Vlasiou, M. & Zwart, B.https://doi.org/10.1145/3152042.3152054Extremal and degree donditions for path extendability in digraphs (2017)SIAM journal on discrete mathematics, 31(3), 1990-2014. Zhang, Z.-B., Zhang, X., Broersma, H. & Lou, D.https://doi.org/10.1137/16M1077453Game Theory and Applications: 3rd Joint China-Dutch Workshop and 7th China Meeting, GTA 2016, Fuzhou, China, November 20-23, 2016, Revised Selected Papers (2017)[Book/Report › Book editing]. Springer. Li, D.-F., Yang, X.-G., Uetz, M. & Xi, G.-J.https://doi.org/10.1007/978-981-10-6753-2Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App (2017)In Designing the Digital Transformation: 12th International Conference, DESRIST 2017, Karlsruhe, Germany, May 30 – June 1, 2017, Proceedings (pp. 462-467) (Lecture Notes in Computer Science; Vol. 10243). Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K. & Skopalik, A.https://doi.org/10.1007/978-3-319-59144-5_32Network congestion games are robust to variable demand (2017)[Contribution to conference › Abstract] 13th International Conference on Web and Internet Economics, WINE 2017. Correa, J., Hoeksma, R. & Schröder, M.Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource (2017)In SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 123-132). ACM Press. Kling, P., Maecker, A., Riechers, S. & Skopalik, A.https://doi.org/10.1145/3087556.3087578Smart charging of electric vehicles (2017)In Markov Decision Processes in Practice (pp. 387-404) (International Series in Operations Research & Management Science; Vol. 248). Springer. Kempker, P. L., van Dijk, N. M., Scheinhardt, W., van den Berg, H. & Hurink, J.https://doi.org/10.1007/978-3-319-47766-4_14The price of connectivity for feedback vertex set (2017)Discrete applied mathematics, 217, 132-143. Belmonte, R., van 't Hof, P., Kamiński, M. & Paulusma, D.https://doi.org/10.1016/j.dam.2016.08.011
2016
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope (2016)Discrete applied mathematics, 215, 136-145. Hoeksma, R. P., Manthey, B. & Uetz, M. J.https://doi.org/10.1016/j.dam.2016.06.031Hoe laat laad ik mijn auto? (2016)STAtOR, 17(3), 13-17. Kempker, P., van Dijk, N., Scheinhardt, W., van den Berg, H. & Hurink, J.https://www.vvsor.nl/members/pages/publications/stator/archive-stator/A simulation tool for evolving functionalities in disordered nanoparticle networks (2016)In 2016 IEEE Congress on Evolutionary Computation (CEC 2016) (pp. 5238-5245). IEEE. van Damme, R. M. J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P. & van der Wiel, W. G.https://doi.org/10.1109/CEC.2016.7748354Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types (2016)Operations research, 64(6), 1438-1450. Hoeksma, R. & Uetz, M.https://doi.org/10.1287/opre.2016.1522Stochastic Online Scheduling on Unrelated Machines (2016)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Gupta, V., Moseley, B., Uetz, M. J. & Xie, Q.Effective and efficient coordination of flexibility in smart grids (2016)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Toersche, H. A.https://doi.org/10.3990/1.9789036541978Forbidden subgraphs for hamiltonicity of 1-tough graphs (2016)Discussiones mathematicae. Graph theory, 36(4), 915-929. Li, B., Broersma, H. J. & Zhang, S.https://doi.org/10.7151/dmgt.1897Planning of on/off devices with minimum run-times (2016)[Contribution to conference › Paper] 2016 IEEE PES Innovative Smart Grid Technologies Europe, ISGT Europe 2016. Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope.2016.7856220QUEST: Eliminating online supervised learning for efficient classification algorithms (2016)Sensors (Switzerland), 16(10). Article 1629. Zwartjes, A., Havinga, P. J. M., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.3390/s16101629Using demand-side management to decrease transformer ageing (2016)In 2016 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe) (pp. 186). IEEE. van der Klauw, T., Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope.2016.7856205Balancing islanded residential microgrids using demand side management (2016)In 2016 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT) (pp. 1-5). IEEE. Hoogsteen, G., van der Klauw, T., Molderink, A., Hurink, J. L., Smit, G. J. M., Feng, X. & Hebner, R. E.https://doi.org/10.1109/ISGT.2016.7781167On fan-wheel and tree-wheel Ramsey numbers (2016)Discrete mathematics, 339(9), 2284-2287. Zhang, Y., Broersma, H. J. & Chen, Y.https://doi.org/10.1016/j.disc.2016.03.013Assessing the potential of residential HVAC systems for demand-side management (2016)In IEEE Power & Energy Society Innovative Smart Grid Technologies Conference, ISGT 2016 (pp. 107). IEEE. van der Klauw, T., Hoogsteen, G., Gerards, M. E. T., Hurink, J. L., Feng, X. & Hebner, R. E.https://doi.org/10.1109/ISGT.2016.7781193Efficiency of equilibria in uniform matroid congestion games (2016)In Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT 2016) (pp. 105-116) (Lecture Notes in Computer Science; Vol. 9928). Springer. de Jong, J., Klimm, M. & Uetz, M. J.https://doi.org/10.1007/978-3-662-53354-3_9Extended Formulations for Independence Polytopes of Regular Matroids (2016)Graphs and combinatorics, 32(5), 1931-1944. Kaibel, V., Lee, J., Walter, M. & Weltge, S.https://doi.org/10.1007/s00373-016-1709-8Routing Games With Progressive Filling (2016)IEEE/ACM transactions on networking, 24(4), 2553-2562. Harks, T., Hoefer, M., Schewior, K. & Skopalik, A.https://doi.org/10.1109/TNET.2015.2468571Unrelated Machine Scheduling with Stochastic Processing Times (2016)Mathematics of operations research, 41(3), 851-864. Skutella, M., Sviridenko, M. & Uetz, M.https://doi.org/10.1287/moor.2015.0757An integer linear programming model for an Ecovat buffer (2016)Energies, 9(8). Article 592. de Goeijen, G. J. H., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.3390/en9080592Robust peak-shaving for a neighborhood with electric vehicles (2016)Energies, 9(8). Article 594. Gerards, M. E. T. & Hurink, J. L.https://doi.org/10.3390/en9080594Epidemic spreading on complex networks with community structures (2016)Scientific reports, 6. Article 29748. Stegehuis, C., Van Der Hofstad, R. & Van Leeuwaarden, J. S. H.https://doi.org/10.1038/srep29748Soft-islanding a group of houses through scheduling of CHP, PV and storage (2016)In IEEE International Energy Conference, ENERGYCON 2016 (pp. 1-6). IEEE. Perez, K. X., Baldea, M., Edgar, T. F., Hoogsteen, G., van Leeuwen, R. P., van der Klauw, T., Homan, B., Fink, J. & Smit, G. J. M.https://doi.org/10.1109/ENERGYCON.2016.7513972Weighted digraphs and tropical cones (2016)Linear algebra and its applications, 501, 304-343. Joswig, M. & Loho, G.https://doi.org/10.1016/j.laa.2016.02.027Power-law relations in random networks with communities (2016)Physical review E: covering statistical, nonlinear, biological, and soft matter physics, 94(1). Article 012302. Stegehuis, C., Van Der Hofstad, R. & Van Leeuwaarden, J. S. H.https://doi.org/10.1103/PhysRevE.94.012302On the complexity of edge-colored subgraph partitioning problems in network optimization (2016)Discrete mathematics and theoretical computer science, 17(3), 227-244. Zhang, X., Zhang, Z.-B., Broersma, H. & Wen, X.https://doi.org/10.46298/dmtcs.2159Quantitative solutions for future energy systems and markets (2016)OR Spectrum = OR Spektrum, 38(3), 541-543. Hurink, J., Schultz, R. & Wozabal, D.https://doi.org/10.1007/s00291-016-0449-8Scheduling of electricity storage for peak shaving with minimal device wear (2016)Energies, 9(6). Article 465. van der Klauw, T., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.3390/en9060465Quality of Equilibria in Resource Allocation Games (2016)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. de Jong, J.https://doi.org/10.3990/1.9789036541275Interview Wim Klein Haneveld en Jan Karel Lenstra: De geschiedenis herhaalt zich (2016)Nieuw archief voor wiskunde, 17(2), 89-93. Boucherie, R. & Hurink, J.http://www.nieuwarchief.nl/serie5/toonnummer.php?deel=17&nummer=2The lockmaster's problem (2016)European journal of operational research, 251(2), 432-441. Passchyn, W., Coene, S., Briskorn, D., Hurink, J. L., Spieksma, F. C. R. & Vanden Berghe, G.https://doi.org/10.1016/j.ejor.2015.12.007Smoothed analysis of belief propagation and minimum-cost flow algorithms (2016)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Cornelissen, K.https://doi.org/10.3990/1.9789036540971Electrochemical Oxidation of Glycerol and Reduction of Oxygen in Alkaline Media (2016)[Contribution to conference › Poster] 19th Topical Meeting of the International Society of Electrochemistry 2016. Quintero Pulido, D. F., Ten Kortenaar, M. V., Vaidya, M., Hurink, J. L. & Smit, G. J. M.https://www.ise-online.org/ise-conferences/annmeet/folder/19-topical-program-BoA.pdfNote on VCG vs. Price Raising for Matching Markets (2016)[Working paper › Preprint]. ArXiv.org. Kern, W., Manthey, B. & Uetz, M.https://doi.org/10.48550/arXiv.1604.04157Generation of flexible domestic load profiles to evaluate demand side management approaches (2016)In 2016 IEEE International Energy Conference (ENERGYCON) (pp. 1279). IEEE. Hoogsteen, G., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ENERGYCON.2016.7513873A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering (2016)Annals of operations research, 239(1), 189-206. van der Veen, E., Hurink, J. L., Schutten, J. M. J. & Uijland, S. T.https://doi.org/10.1007/s10479-014-1540-7An assessment of a days off decomposition approach to personnel shift scheduling (2016)Annals of operations research, 239(1), 207-223. van Veldhoven, S., Post, G. F., van der Veen, E. & Curtois, T.https://doi.org/10.1007/s10479-014-1674-7Considering grid limitations in profile steering (2016)In 2016 IEEE International Energy Conference (ENERGYCON) (pp. 1491). IEEE. van der Klauw, T., Gerards, M. E. T., Hoogsteen, G., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.1109/ENERGYCON.2016.7514033Server waiting times in infinite supply polling systems with preparation times (2016)Probability in the engineering and informational sciences, 30(2), 153-184. Dorsman, J.-P. L., Perel, N. & Vlasiou, M.https://doi.org/10.1017/S0269964815000339The third international timetabling competition (2016)Annals of operations research, 239(1), 69-75. Post, G. F., Schaerf, A., Kingston, J. H. & Di Gaspero, L.https://doi.org/10.1007/s10479-013-1340-5On star-critical and upper size Ramsey numbers (2016)Discrete applied mathematics, 202, 174-180. Zhang, Y., Broersma, H. J. & Chen, Y.https://doi.org/10.1016/j.dam.2015.08.020A multi-commodity simulation tool based on TRIANA (2016)In Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems, 18th International GI/ITG Conference, MMB & DFT 2016 (pp. 55-59) (Lecture Notes in Computer Science; Vol. 9629). Springer. Hajighasemi, M., Haji Ghasemi, M., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.1007/978-3-319-31559-1_6Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks (2016)In The Eighth International Conference on Future Computational Technologies and Applications, FUTURE COMPUTING 2016 (pp. 15-20). International Academy, Research, and Industry Association (IARIA). Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., van der Wiel, W. G. & Schmidhuber, J.http://eprints.eemcs.utwente.nl/secure2/26922/01/future_computing_2016_1_30_30037.pdfOn a cardinality-constrained transportation problem with market choice (2016)Operations research letters, 44(2), 170-173. Walter, M., Damci-Kurt, P., Dey, S. S. & Küçükyavuz, S.https://doi.org/10.1016/j.orl.2015.12.001Efficiency of equilibria in uniform matroid congestion games (2016)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). de Jong, J., Klimm, M. & Uetz, M. J.A survey of offline algorithms for energy minimization under deadline constraints (2016)Journal of scheduling, 19(1), 3-19. Gerards, M. E. T., Hurink, J. L. & Holzenspies, P. K. F.https://doi.org/10.1007/s10951-015-0463-8Narrowing down the gap on cycle-star Ramsey numbers (2016)Journal of combinatorics (Somerville), 7(2-3), 481-493. Zhang, Y., Broersma, H. J. & Chen, Y.https://doi.org/10.4310/JOC.2016.v7.n2.a13Average case analysis of the MST-heuristic for the power assignment problem: Special cases (2016)EAI Endorsed Transactions on Energy Web, 16(10). Article e5. de Graaf, M., Boucherie, R. J., Hurink, J. L. & van Ommeren, J. C. W.https://doi.org/10.4108/eai.14-12-2015.2262699Approximation Algorithms for k-Connected Graph Factors (2016)In Proceedings of the 13th Workshop on Approximation and Online Algorithms (WAOA 2015) (pp. 1-12) (Lecture Notes in Computer Science; Vol. 9499). Springer. Manthey, B. & Waanders, M.https://doi.org/10.1007/978-3-319-28684-6_1Asymptotic error bounds for truncated buer approximations of a 2-node tandem queue (2016)In Ninth International Conference on Matrix-Analytic Methods in Stochastic Models. Vatamidou, E., Adan, I., Vlasiou, M. & Zwart, B.Asymptotic error bounds for truncated buffer approximations of a 2-node tandem queue: Ninth International Conference on Matrix-Analytic Methods in Stochastic Models (MAM9), 28-30 June 2016, Budapest, Hungary (2016)[Contribution to conference › Paper]. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.Computational matter: evolving computational functions in nanoscale materials (2016)In Advances in Unconventional Computing, Volume 2: Prototypes, Models and Algorithms (pp. 397-428) (Emergence, Complexity and Computation; Vol. 23). Springer. Broersma, H. J., Miller, J. F. & Nichele, S.https://doi.org/10.1007/978-3-319-33921-4_16Editing to Eulerian graphs (2016)Journal of computer and system sciences, 82(2), 213-228. Dabrowski, K. K., Golovach, P. A., van 't Hof, P. & Paulusma, D.https://doi.org/10.1016/j.jcss.2015.10.003Hamiltonian properties of almost locally connected claw-free graphs (2016)Ars combinatoria, 124, 95-109. Chen, X., Li, M., Liao, W. & Broersma, H. J.http://www.combinatorialmath.ca/arscombinatoria/vol124.htmlInvestigating Polyhedra by Oracles and Analyzing Simple Extensions of Polytopes (2016)[Thesis › PhD Thesis - Research external, graduation external]. Otto von Guericke University Magdeburg. Walter, M.https://doi.org/10.25673/4390Linear programs and convex hulls over fields of puiseux fractions (2016)In Mathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Revised Selected Papers (pp. 429-445) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9582). Springer. Joswig, M., Loho, G., Lorenz, B. & Schröter, B.https://doi.org/10.1007/978-3-319-32859-1_37Maximal induced matchings in triangle-free graphs (2016)Journal of graph theory, 83(3), 231-250. Basavaraju, M., Heggernes, P., van 't Hof, P., Saei, R. & Villanger, Y.https://doi.org/10.1002/jgt.21994On the computational complexity of vertex integrity and component order connectivity (2016)Algorithmica, 76(4), 1181-1201. Drange, P. G., Dregi, M. S. & van 't Hof, P.https://doi.org/10.1007/s00453-016-0127-xStrategic online facility location (2016)In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 593-607) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10043 LNCS). Springer. Drees, M., Feldkord, B. & Skopalik, A.https://doi.org/10.1007/978-3-319-48749-6_43
2015
Shortest Path to Mechanism Design (2015)In Gems of Combinatorial Optimization and Graph Algorithms (pp. 83-94). Springer. Müller, R. & Uetz, M. J.https://doi.org/10.1007/978-3-319-24971-1_8Evolution of a designless nanoparticle network into reconfigurable Boolean logic (2015)Nature nanotechnology, 10(12), 1048-1052. Bose, S. K., Lawrence, C. P., Liu, Z., Makarenko, K. S., van Damme, R. M. J., Broersma, H. J. & van der Wiel, W. G.https://doi.org/10.1038/nnano.2015.207The curse of sequentiality in routing games (2015)In 11th International Conference on Web and Internet Economics, WINE 2015 (pp. 258-271) (Lecture Notes in Computer Science; Vol. 9470). Springer. Correa, J., de Jong, J., de Keijzer, B. & Uetz, M. J.https://doi.org/10.1007/978-3-662-48995-6_1912th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013) : editorial (2015)Discrete applied mathematics, 195, 1-1. Hurink, J. L. & Manthey, B.https://doi.org/10.1016/j.dam.2015.06.013Linear programming control of a group of heat pumps (2015)Energy, sustainability and society, 5(33), -. Fink, J., van Leeuwen, R. P., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1186/s13705-015-0061-9Three results on cycle-wheel Ramsey numbers (2015)Graphs and combinatorics, 31(6), 2467-2479. Zhang, Y., Broersma, H. & Chen, Y.https://doi.org/10.1007/s00373-014-1523-0On a directed tree problem motivated by a newly introduced graph product (2015)Electronic journal of graph theory and applications, 3(2), 162-181. Boode, A. H., Broersma, H. & Broenink, J. F.https://doi.org/10.5614/ejgta.2015.3.2.5How tough is toughness? (2015)Bulletin of the European Association for Theoretical Computer Science, 117, 28-52. Broersma, H.http://bulletin.eatcs.org/index.php/beatcs/article/view/362The curse of sequentiality in routing games (2015)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Correa, J., de Jong, J., de Keijzer, B. & Uetz, M. J.Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems (2015)Algorithmica, 73(1), 42-62. Bringmann, K., Engels, C., Manthey, B. & Rao, B. V. R.https://doi.org/10.1007/s00453-014-9901-9Electrochemical Behavior of Halogens Redox Couples at Carbon Graphite Electrode in Aqueous Solutions (2015)[Contribution to conference › Other] The 15th International Symposium on Electroanalytical Chemistry 2015. Quintero Pulido, D. F., Ten Kortenaar, M., Hurink, J. L. & Smit, G. J. M.http://www.ciac.cas.cn/xwzx/xshy/201508/W020150811296803287072.pdfClosing the gap on path-kipas Ramsey numbers (2015)The Electronic journal of combinatorics, 22(3), 3.21. Li, B., Zhang, Y., Bielak, H., Broersma, H. J. & Holub, P.http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p21Smoothed Analysis of Local Search Algorithms (2015)In Proceedings of the 14th International Symposium on Algorithms and Data Structures (WADS 2015) (pp. 518-527) (Lecture Notes in Computer Science; Vol. 9214). Springer. Manthey, B.https://doi.org/10.1007/978-3-319-21840-3_43Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (2015)In Proceedings of the 21st Computing and Combinatorics Conference (COCOON 2015) (pp. 701-712) (Lecture Notes in Computer Science; Vol. 9198). Springer. Cornelissen, K. & Manthey, B.https://doi.org/10.1007/978-3-319-21398-9_55A note on Ramsey numbers for fans (2015)Bulletin of the Australian Mathematical Society, 92(1), 19-23. Zhang, Y., Broersma, H. J. & Chen, Y.https://doi.org/10.1017/S0004972715000398Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs (2015)Journal of graph theory, 79(4), 282-299. Broersma, H., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D. & Proskurowski, A.https://doi.org/10.1002/jgt.21832Impact of peak electricity demand in distribution grids: a stress test (2015)In IEEE PowerTech, 2015 (pp. 1-6). IEEE. Hoogsteen, G., Molderink, A., Hurink, J. L., Smit, G. J. M., Schuring, F. & Kootstra, B.https://doi.org/10.1109/PTC.2015.7232412Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (2015)Theoretical computer science, 590, 86-95. Chaplick, S., Fiala, J., van 't Hof, P., Paulusma, D. & Tesar, M.https://doi.org/10.1016/j.tcs.2015.01.028Waarom wiskunde? Omdat je het spel strategisch wilt spelen (2015)NRC.next, Jaargang 1(90), 12-13. Uetz, M. J.http://www.nrc.nl/next/2015/07/22/waarom-wiskunde-omdat-je-het-spel-strategisch-wil-1516840Subgraph polytopes and independence polytopes of count matroids (2015)Operations research letters, 43(5), 457-460. Article 5968. Conforti, M., Kaibel, V., Walter, M. & Weltge, S.https://doi.org/10.1016/j.orl.2015.06.011Computational matter: evolving computational solutions in materials (2015)In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion 2015 (pp. 769-770). Association for Computing Machinery. Miller, J. F. & Broersma, H. J.https://doi.org/10.1145/2739482.2764939Predicting the long-term citation impact of recent publications (2015)Journal of informetrics, 9(3), 642-657. Stegehuis, C., Litvak, N. & Waltman, L.https://doi.org/10.1016/j.joi.2015.06.005Energy management with TRIANA on FPAI (2015)In 2015 IEEE PowerTech Eindhoven (pp. 1-6). IEEE. Toersche, H., Hurink, J. L. & Konsman, M. J.https://doi.org/10.1109/PTC.2015.7232650Demand side management using profile steering (2015)In 2015 IEEE PowerTech Eindhoven (pp. 457759:1-457759:6). IEEE. Gerards, M. E. T., Toersche, H. A., Hoogsteen, G., van der Klauw, T., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2015.7232328Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (2015)In Automata, Languages, and Programming: 42nd International Colloquium on Automata, Languages and Programming (ICALP 2015) (pp. 859-871) (Lecture Notes in Computer Science; Vol. 9134). Springer. Künnemann, M. & Manthey, B.https://doi.org/10.1007/978-3-662-47672-7_70Predicting the long-term citation impact of recent publications (2015)[Book/Report › Report]. University of Twente. Stegehuis, C., Litvak, N. & Waltman, L.On the interplay between global DVFS and scheduling tasks with precedence constraints (2015)IEEE transactions on computers, 64(6), 1742-1754. Gerards, M. E. T., Hurink, J. L. & Kuper, J.https://doi.org/10.1109/TC.2014.2345410Ramsey numbers of trees versus fans (2015)Discrete mathematics, 338(6), 994-999. Zhang, Y., Broersma, H. J. & Chen, Y.https://doi.org/10.1016/j.disc.2015.01.030Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (2015)In Proceedings of the 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (pp. 157-160). Ozyegin Universitesi and Marmara Universitesi. Cornelissen, K. & Manthey, B.Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP (2015)In Proceedings of the 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (pp. 1-4). Özyegin Üniversitesi and Marmara Üniversitesi. Künnemann, M. & Manthey, B.Characterizing heavy subgraph pairs for pancyclicity (2015)Graphs and combinatorics, 31(3), 649-667. Li, B., Ning, B., Broersma, H. & Zhang, S.https://doi.org/10.1007/s00373-014-1406-4Smoothed Complexity Theory (2015)ACM transactions on computation theory, 7(2), 6. Bläser, M. & Manthey, B.https://doi.org/10.1145/2656210Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses (2015)European journal of operational research, 242(2), 644-650. Fink, J. & Hurink, J. L.https://doi.org/10.1016/j.ejor.2014.10.040Simple extensions of polytopes (2015)Mathematical programming, 154(1-2), 381-406. Kaibel, V. & Walter, M.https://doi.org/10.1007/s10107-015-0885-2Generalized Ramsey numbers for graphs (2015)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zhang, Y.https://doi.org/10.3990/1.9789036538329A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs (2015)Theoretical computer science, 571, 58-66. Wang, L., Zhang, X., Zhang, Z. & Broersma, H.https://doi.org/10.1016/j.tcs.2015.01.005Approximate pure Nash equilibria in weighted congestion games: Existence, efficient computation, and structure (2015)ACM Transactions on Economics and Computation, 3(1). Article 2. Caragiannis, I., Fanelli, A., Gravin, N. & Skopalik, A.https://doi.org/10.1145/2614687The S-Bahn Challenge in Berlin (2015)OR-News : das Magazin der GOR, 53, 10-14. Beckenbach, I., Borndörfer, R., Knoben, L., Kretz, D. & Uetz, M. J.On optimal mechanism design for a sequencing problem (2015)Journal of scheduling, 18(1), 45-59. Duives, J., Heydenreich, B., Mishra, D., Müller, R. & Uetz, M. J.https://doi.org/10.1007/s10951-014-0378-9Shift rostering using decomposition: assign weekend shifts first (2015)Journal of scheduling, 18(1), 29-43. van der Veen, E., Hans, E. W., Post, G. F. & Veltman, B.https://doi.org/10.1007/s10951-014-0385-xMechanisms for scheduling games with selfish players (2015)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Hoeksma, R. P.https://doi.org/10.3990/1.9789036538275Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs (2015)Theoretical computer science, 562, 252-269. Heggernes, P., van 't Hof, P., Meister, D. & Villanger, Y.https://doi.org/10.1016/j.tcs.2014.10.002Analysis of algorithms beyond the worst case (2015)Dagstuhl reports, 4(9), 30-49. Balcan, M.-F., Manthey, B., Röglin, H. & Roughgarden, T.https://doi.org/10.4230/DagRep.4.9.30Best monotone degree conditions for graph properties: a survey (2015)Graphs and combinatorics, 31(1), 1-22. Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N., Nevo, A., Schmeichel, E., Woodall, D. R. & Yatauro, M.https://doi.org/10.1007/s00373-014-1465-6Computing the metric dimension for chain graphs (2015)Information processing letters, 115(9), 671-676. Fernau, H., Heggernes, P., van 't Hof, P., Meister, D. & Saei, R.https://doi.org/10.1016/j.ipl.2015.04.006Dynamic server assignment in an extended machine-repair model (2015)IISE Transactions, 47(4), 392-413. Dorsman, J. L., Bhulai, S. & Vlasiou, M.https://doi.org/10.1080/0740817X.2014.928962Editing to a planar graph of given degrees (2015)In Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings (pp. 143-156) (Lecture Notes in Computer Science; Vol. 9139). Springer. Dabrowski, K. K., Golovach, P. A., van 't Hof, P., Paulusma, D. & Thilikos, D. M.https://doi.org/10.1007/978-3-319-20297-6_10Finding disjoint paths in split graphs (2015)Theory of computing systems, 57, 140-159. Heggernes, P., van 't Hof, P., van Leeuwen, E. J. & Saei, R.https://doi.org/10.1007/s00224-014-9580-6Hadwiger Number of Graphs with Small Chordality (2015)SIAM journal on discrete mathematics, 29(3), 1427-1451. Golovach, P. A., Heggernes, P., van 't Hof, P. & Paul, C.https://doi.org/10.1137/140975279Heavy-traffic asymptotics for networks of parallel queues with Markov-modulated service speeds (2015)Queueing systems, 79(3), 293-319. Dorsman, J. L., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/s11134-014-9422-xMarkovian polling systems with an application to wireless random-access networks (2015)Performance evaluation, 85-86, 33-51. Dorsman, J. L., Borst, S. C., Boxma, O. J. & Vlasiou, M.https://doi.org/10.1016/j.peva.2015.01.008Modifying a Graph Using Vertex Elimination (2015)Algorithmica, 72(1), 99-125. Golovach, P. A., Heggernes, P., van 't Hof, P., Manne, F., Paulusma, D. & Pilipczuk, M.https://doi.org/10.1007/s00453-013-9848-2On existence and properties of approximate pure nash equilibria in bandwidth allocation games (2015)In Algorithmic Game Theory - 8th International Symposium, SAGT 2015 (pp. 178-189). Article A14 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9347). Springer. Drees, M., Feldotto, M., Riechers, S. & Skopalik, A.https://doi.org/10.1007/978-3-662-48433-3_14On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties (2015)Algorithmica, 72(3), 687-713. Heggernes, P., van 't Hof, P., Marx, D., Misra, N. & Villanger, Y.https://doi.org/10.1007/s00453-014-9868-6Optimization of charging strategies for electric vehicles in PowerMatcher-driven smart energy grids (2015)In Proceedings 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Valuetools 2015 (pp. 1-8). Association for Computing Machinery. Kempker, P., van Dijk, N. M., Scheinhardt, W. R. W., van den Berg, H. L. & Hurink, J. L.https://doi.org/10.4108/eai.4-1-2016.151091Smoothed Analysis of the Successive Shortest Path Algorithm (2015)SIAM journal on computing, 44(6), 1798-1819. Brunsch, T., Cornelissen, K., Manthey, B., Röglin, H. & Rösner, C.https://doi.org/10.1137/140989893
2014
The sequential price of anarchy for atomic congestion games (2014)In Proceedings of the 10th Conference on Web and Internet Economics, WINE 2014 (pp. 429-434) (Lecture Notes In Computer Science; Vol. 8877). Springer. de Jong, J. & Uetz, M. J.https://doi.org/10.1007/978-3-319-13129-0_35Managing energy in time and space in smart grids using TRIANA (2014)In Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference Europe, ISGT-Europe 2014 (pp. 1-6). IEEE. Hoogsteen, G., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2014.7028973Optimal scheduling of electrical vehicle charging under two types of steering signals (2014)In IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe) (pp. 0122). IEEE. van der Klauw, T., Gerards, M. E. T., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.1109/ISGTEurope.2014.7028746Approximate pure nash equilibria in weighted congestion games (2014)In Leibniz International Proceedings in Informatics, LIPIcs (pp. 242-257) (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 28). Dagstuhl. Hansknecht, C., Klimm, M. & Skopalik, A.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242The sequential price of anarchy for atomic congestion games (2014)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). de Jong, J. & Uetz, M.Reducing the number of required beds by rearranging the OR-schedule (2014)OR Spectrum = OR Spektrum, 36(3), 585-605. van Essen, J. T., Bosch, J. M., Hans, E. W., van Houdenhoven, M. & Hurink, J. L.https://doi.org/10.1007/s00291-013-0323-xRound-robin tournaments with homogeneous rounds (2014)Annals of operations research, 218(1), 115-128. Buiteveld, B., van Holland, E., Post, G. F. & Smit, D.https://doi.org/10.1007/s10479-011-0981-5XHSTT: an XML archive for high school timetabling problems in different countries (2014)Annals of operations research, 218(1), 295-301. Post, G. F., Kingston, J. H., Ahmadi, S., Daskalaki, S., Gogos, C., Kyngas, J., Nurmi, C., Musliu, N., Pillay, N., Santos, H. & Schaerf, A.https://doi.org/10.1007/s10479-011-1012-2Clustering clinical departments for wards to achieve a prespecified blocking probability (2014)OR Spectrum = OR Spektrum, 37(1), 243-271. van Essen, J. T., van Houdenhoven, M. & Hurink, J. L.https://doi.org/10.1007/s00291-014-0368-5Copositive Programming and Related Problems (2014)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Ahmed, F.https://doi.org/10.3990/1.9789036536721Cascaded column generation for scalable predictive demand side management (2014)In Proceedings of the 2014 IEEE International Energy Conference (ENERGYCON) (pp. 1228-1235). IEEE. Toersche, H., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ENERGYCON.2014.6850580Algorithmic and structural aspects of graph partitioning and related problems (2014)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Zhang, X.https://doi.org/10.3990/1.9789036536264Decomposition algorithm for the single machine scheduling polytope (2014)In Combinatorial Optimization, Third International Symposium, ISCO 2014 (pp. 280-291) (Lecture Notes in Computer Science; Vol. 8596). Springer. Hoeksma, R. P., Manthey, B. & Uetz, M. J.https://doi.org/10.1007/978-3-319-09174-7_24On toughness and hamiltonicity of 2K2-free graphs (2014)Journal of graph theory, 75(3), 244-255. Broersma, H. J., Patel, V. & Pyatkin, A.https://doi.org/10.1002/jgt.21734Contracting chordal graphs and bipartite graphs to paths and trees (2014)Discrete applied mathematics, 164(2), 444-449. Heggernes, P., van 't Hof, P., Lévêque, B. & Paul, C.https://doi.org/10.1016/j.dam.2013.02.025Stochastic scheduling on unrelated machines (2014)In 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 (pp. 639-650) (Leibniz International Proceedings in Informatics; Vol. 25). Dagstuhl. Skutella, M., Sviridenko, M. & Uetz, M. J.https://doi.org/10.4230/LIPIcs.STACS.2014.639Road pricing mechanisms: A game theoretic and multi-level approach (2014)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Ohazulike, A. E.https://doi.org/10.3990/1.9789055841707A Lévy input fluid queue with input and workload regulation (2014)Queueing systems, 76(1), 21-36. Palmowski, Z. B., Vlasiou, M. & Zwart, B.https://doi.org/10.1007/s11134-013-9358-6A remark on star-C4 and wheel-C4 Ramsey numbers (2014)Electronic journal of graph theory and applications, 2(2), 110-114. Zhang, Y., Broersma, H. J. & Chen, Y.https://doi.org/10.5614/ejgta.2014.2.2.3A simulation framework for analyzing complex infinitely repeated games (2014)In SIMULTECH 2014 - Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (pp. 625-630) (Proceedings of the International Conference on Simulation and Modeling Methodologies, Technologies and Applications - SIMULTECH; Vol. 2014). SCITEPRESS. Feldotto, M. & Skopalik, A.https://doi.org/10.5220/0005110406250630Analytic clock frequency selection for global DVFS (2014)In 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2014 (pp. 512-519). IEEE. Gerards, M. E. T., Hurink, J. L., Holzenspies, P. K. F., Kuper, J. & Smit, G. J. M.https://doi.org/10.1109/PDP.2014.103Approximability of Connected Factors (2014)In Proceedings of the 11th Workshop on Approximation and Online Algorithms (WAOA 2013) (pp. 120-131) (Lecture Notes in Computer Science; Vol. 8447). Springer. Cornelissen, K., Hoeksma, R. P., Manthey, B., Narayanaswamy, N. S. & Rahul, C. S.https://doi.org/10.1007/978-3-319-08001-7_11Approximate Pure Nash Equilibria in Social Context Congestion Games (2014)In Web and Internet Economics: 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014. Proceedings (pp. 480-485) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8877). Gairing, M., Kotsialou, G. & Skopalik, A.https://doi.org/10.1007/978-3-319-13129-0_43Bounding the potential function in congestion games and approximate pure Nash equilibria (2014)In Web and Internet Economics: 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014. Proceedings (pp. 30-43) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8877). Feldotto, M., Gairing, M. & Skopalik, A.https://doi.org/10.1007/978-3-319-13129-0_3Break-even analysis for the storage of PV in power distribution grids (2014)International journal of energy research, 38(9), 1112-1128. Nykamp, S., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1002/er.3106Budget-restricted utility games with ordered strategic decisions (2014)In Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (pp. 110-121) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8768). Drees, M., Riechers, S. & Skopalik, A.https://doi.org/10.1007/978-3-662-44803-8_10Corrected phase-type approximations for heavy-tailed queueing models in a Markovian environment: Stochastic Networks Conference 2014, 23-27 June 2014, Amsterdam, The Netherlands (2014)[Contribution to conference › Paper]. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.Corrected phase-type approximations of heavy-tailed queueing models in a Markovian environment (2014)Stochastic models, 30(4), 598-638. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, B.https://doi.org/10.1080/15326349.2014.956227Corrected phase-type approximations of heavy-tailed queueing models in a Markovian environment (2014)[Book/Report › Report]. EURANDOM. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.Detecting fixed patterns in chordal graphs in polynomial time (2014)Algorithmica, 69(3), 501-521. Belmonte, R., Golovach, P. A., Heggernes, P., van 't Hof, P., Kaminski, M. & Paulusma, D.https://doi.org/10.1007/s00453-013-9748-5Editing to Eulerian Graphs (2014)In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India (pp. 97-108) (LIPIcs; Vol. 29). Dagstuhl. Dabrowski, K. K., Golovach, P. A., van 't Hof, P. & Paulusma, D.https://doi.org/10.4230/LIPIcs.FSTTCS.2014.97Erratum: Optimizing the strategic patient mix combining queueing theory and dynamic programing (2014)Computers & operations research, 2013(45), 116-116. Vanberkel, P. T., Boucherie, R. J., Hans, E. W. & Hurink, J. L.https://doi.org/10.1016/j.cor.2013.12.005Finding disjoint paths in split graphs (2014)In SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings (pp. 315-326) (Lecture Notes in Computer Science; Vol. 8327). Springer. Heggernes, P., van 't Hof, P., Leeuwen, E. J. v. & Saei, R.https://doi.org/10.1007/978-3-319-04298-5_28Forbidden induced subgraphs and the price of connectivity for Feedback Vertex Set (2014)In Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part (pp. 57-68) (Lecture Notes in Computer Science; Vol. 8635). Springer. Belmonte, R., van 't Hof, P., Kaminski, M. J. & Paulusma, D.https://doi.org/10.1007/978-3-662-44465-86Graph classes and Ramsey numbers (2014)Discrete applied mathematics, 173, 16-27. Belmonte, R., Heggernes, P., van 't Hof, P., Rafiey, A. & Saei, R.https://doi.org/10.1016/j.dam.2014.03.016Hadwiger number of graphs with small chordality (2014)In Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers (pp. 201-213) (Lecture Notes in Computer Science; Vol. 8747). Springer. Golovach, P. A., Heggernes, P., van 't Hof, P. & Paul, C.https://doi.org/10.1007/978-3-319-12340-0_17Heavy subgraph pairs for traceability of block-chains (2014)Discussiones mathematicae. Graph theory, 34(2), 287-307. Li, B., Li, B., Broersma, H. J. & Zhang, S.https://doi.org/10.7151/dmgt.1737Insensitivity of proportional fairness in critically loaded bandwidth sharing networks (2014)[Working paper › Preprint]. ArXiv.org. Vlasiou, M., Zhang, J. & Zwart, B.https://arxiv.org/abs/1411.4841Integral multidisciplinary rehabilitation treatment planning (2014)Operations research for health care, 3(3), 145-159. Braaksma, A., Kortbeek, N., Post, G. F. & Nollet, F.https://doi.org/10.1016/j.orhc.2014.02.001Markovian polling systems with an application to wireless random-access networks (2014)[Book/Report › Report]. EURANDOM. Dorsman, J. L., Borst, S. C., Boxma, O. J. & Vlasiou, M.Maximal induced matchings in triangle-free graphs (2014)In Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers (pp. 93-104) (Lecture Notes in Computer Science; Vol. 8747). Springer. Basavaraju, M., Heggernes, P., van 't Hof, P., Saei, R. & Villanger, Y.https://doi.org/10.1007/978-3-319-12340-0_8Multilevel Network Games (2014)In Web and Internet Economics: 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014. Proceedings (pp. 435-440) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8877). Abshoff, S., Cord-Landwehr, A., Jung, D. & Skopalik, A.https://doi.org/10.1007/978-3-319-13129-0_36On the accuracy of phase-type approximations of heavy-tailed risk models (2014)Scandinavian actuarial journal, 2014(6), 510-534. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.https://doi.org/10.1080/03461238.2012.729154On the computational complexity of Vertex Integrity and Component Order Connectivity (2014)In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (pp. 285-297) (Lecture Notes in Computer Science; Vol. 8889). Springer. Drange, P. G., Dregi, M. S. & van 't Hof, P.https://doi.org/10.1007/978-3-319-13075-0_23Optimizing the strategic patient mix combining queueing theory and dynamic programming (2014)Computers & operations research, 43(March), 271-279. Vanberkel, P. T., Boucherie, R. J., Hans, E. W. & Hurink, J. L.https://doi.org/10.1016/j.cor.2013.09.020Parameterized complexity of three edge contraction problems with degree constraints (2014)Acta informatica, 51(7), 473-497. Belmonte, R., Golovach, P. A., van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/s00236-014-0204-zProbabilistic analysis of power assignments (2014)In 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014) (pp. 201-212) (Lecture Notes in Computer Science; Vol. 8635). Springer. de Graaf, M. & Manthey, B.https://doi.org/10.1007/978-3-662-44465-8_18Removable edges and chords of longest cycles in 3-connected graphs (2014)Graphs and combinatorics, 30(3), 743-753. Wu, J., Broersma, H. & Kang, H.https://doi.org/10.1007/s00373-013-1296-xSimple extensions of polytopes (2014)In Integer Programming and Combinatorial Optimization: 17th International Conference, IPCO 2014, Proceedings (pp. 309-320) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8494 LNCS). Springer. Kaibel, V. & Walter, M.https://doi.org/10.1007/978-3-319-07557-0_26Vector connectivity in graphs (2014)Networks, 63(4), 277-285. Boros, E., Heggernes, P., van 't Hof, P. & Milanic, M.https://doi.org/10.1002/net.21545
2013
Decomposition algorithm for the single machine scheduling polytope (2013)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Hoeksma, R. P., Manthey, B. & Uetz, M. J.On the Complexity of Pareto-Optimal Nash and Strong Equilibria (2013)Theory of computing systems, 53, 441-453. Hoefer, M. & Skopalik, A.https://doi.org/10.1007/s00224-012-9433-0Flowing through hospitals (2013)[Thesis › PhD Thesis - Research UT, graduation UT]. Centre for Telematics and Information Technology (CTIT). van Essen, J. T.https://doi.org/10.3990/1.9789036507257Parameterized complexity of vertex deletion into perfect graph classes (2013)Theoretical computer science, 511, 172-180. Heggernes, P., van 't Hof, P., Jansen, B. M. P., Kratsch, S. & Villanger, Y.https://doi.org/10.1016/j.tcs.2012.03.013Analysis of Smith's rule in stochastic machine scheduling (2013)Operations research letters, 41(6), 570-575. Jagtenberg, C., Schwiegelshohn, U. & Uetz, M. J.https://doi.org/10.1016/j.orl.2013.08.001Integrating renewables in distribution grids: Storage, regulation and the interaction of different stakeholders in future grids (2013)[Thesis › PhD Thesis - Research UT, graduation UT]. Centre for Telematics and Information Technology (CTIT). Nykamp, S.https://doi.org/10.3990/1.9789036500579Approximability of Connected Factors (2013)[Working paper › Preprint]. ArXiv.org. Cornelissen, K., Hoeksma, R., Manthey, B., Narayanaswamy, N. S. & Rahul, C. S.https://doi.org/10.48550/arXiv.1310.2387Column generation based planning in smart grids using TRIANA (2013)In 4th IEEE/PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2013 (pp. 0537). IEEE. Toersche, H., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2013.6695431Integrating lv network models and load-flow calculations into smart grid planning (2013)In 4th IEEE/PES Innovative Smart Grid Technologies Europe, ISGT EUROPE 2013 (pp. 1-5) (Innovative Smart Grid Technologies Europe). IEEE. Hoogsteen, G., Molderink, A., Bakker, V. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2013.6695427Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs (2013)In Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013 (pp. 35-46). IEEE. de Groote, R., Holzenspies, P. K. F., Kuper, J. & Broersma, H. J.http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6670939Computing pure Nash and strong equilibria in bottleneck congestion games (2013)Mathematical programming, 141(1-2), 193-215. Harks, T., Hoefer, M., Klimm, M. & Skopalik, A.https://doi.org/10.1007/s10107-012-0521-3Models for ambulance planning on the strategic and the tactical level (2013)[Book/Report › Report]. TU Eindhoven, Research School for Operations Management and Logistics (BETA). van Essen, J. T., Hurink, J. L., Nickel, S. & Reuter, M.A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering (2013)[Book/Report › Report]. University of Twente. van der Veen, E., Hurink, J. L., Schutten, J. M. J. & Uijland, S. T.Value of storage in distribution grids-competition or cooperation of stakeholders? (2013)IEEE transactions on smart grid, 4(3), 1361-1370. Nykamp, S., Bosman, M. G. C., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/TSG.2013.2254730Extensions of the Shapley Value and their Characterizations (2013)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Feng, Y.https://doi.org/10.3990/1.9789036500043Fractional Programming in Cooperative Games (2013)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Qui, X.https://doi.org/10.3990/1.9789036500005Models, theory and applications in cooperative game theory (2013)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Hou, D.https://doi.org/10.3990/1.9789036500050Improving the performance of periodic real-time processes: a graph theoretical approach (2013)In Communicating Process Architectures 2013 (pp. 57-79) (35th WoTUG conference on concurrent and parallel programming). Open Channel Publishing Ltd. Boode, A. H., Broersma, H. J. & Broenink, J. F.http://www.wotug.org/papers/CPA-2013/Boode13/Boode13.pdfOn indirect controlled cost function based DSM strategies (2013)In Proceedings of IEEE PowerTech (POWERTECH) (pp. 1-6). IEEE. Molderink, A., Bakker, V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2013.6652464Controlling and optimizing of energy streams in local buildings in a field test (2013)In 22nd International Conference and Exhibition on Electricity Distribution, CIRED 2013 (pp. 1-4). IET Digital Press. Bakker, V., Molderink, A., Nykamp, S., Hurink, J. L., Smit, G. J. M. & Reinelt, J.https://doi.org/10.1049/cp.2013.0771Minimal dominating sets in graph classes: Combinatorial bounds and enumeration (2013)Theoretical computer science, 487, 82-94. Couturier, J.-F., Heggernes, P., van 't Hof, P. & Kratsch, D.https://doi.org/10.1016/j.tcs.2013.03.026Stochastic scheduling on unrelated machines (2013)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Skutella, M., Sviridenko, M. & Uetz, M. J.An assessment of a days off decomposition approach to personnel scheduling (2013)[Book/Report › Report]. University of Twente. van Veldhoven, S., Post, G. F., van der Veen, E. & Curtois, T.An assessment of a days off decomposition approach to personnel shift scheduling (2013)[Book/Report › Report]. University of Twente. van Veldhoven, S., Post, G., van der Veen, E. & Curtois, T.Selection of tests for outlier detection (2013)In 31st IEEE VLSI Test Symposium, VTS 2013 (pp. 1-6). IEEE. Bossers, H. C. M., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/VTS.2013.6548885Obtaining planarity by contracting few edges (2013)Theoretical computer science, 476, 38-46. Golovach, P. A., van 't Hof, P. & Paulusma, D.https://doi.org/10.1016/j.tcs.2012.12.041Implementation of a unimodularity test (2013)Mathematical Programming Computation, 5(1), 57-73. Walter, M. & Truemper, K.https://doi.org/10.1007/s12532-012-0048-xChoosability on H-free graphs (2013)Information processing letters, 113(4), 107-110. Golovach, P. A., Heggernes, P., van 't Hof, P. & Paulusma, D.https://doi.org/10.1016/j.ipl.2012.12.003Storage Operation for Peak Shaving of Distributed PV and Wind Generation (2013)In 2013 IEEE PES Innovative Smart Grid Technologies Conference (ISGT 2013) (pp. 1-6). IEEE. Nykamp, S., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGT.2013.6497786De derde internationale timetabling competitie : op zoek naar het beste schoolrooster (2013)STAtOR, 14(1), 22-25. Kingston, J. H. & Post, G. F.https://www.vvsor.nl/stator/pages/archive/Bipartite Graphs and the Decomposition of Systems of Equations (2013)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Bomhoff, M. J.https://doi.org/10.3990/1.9789036534765Analysis of a two-layered network by means of the power-series algorithm (2013)Performance evaluation, 70(12), 1072-1089. Dorsman, J. L., Mei van der, R. D. & Vlasiou, M.https://doi.org/10.1016/j.peva.2013.09.005Analytic properties of two-carousel systems (2013)Probability in the engineering and informational sciences, 27(1), 57-84. Bossier, R., Vlasiou, M. & Adan, I.https://doi.org/10.1017/S0269964812000307Approximating independent set in perturbed graphs (2013)Discrete applied mathematics, 161(12), 1761-1768. Manthey, B. & Plociennik, K.https://doi.org/10.1016/j.dam.2012.06.008Bisimplicial edges in bipartite graphs (2013)Discrete applied mathematics, 161(12), 1699-1706. Bomhoff, M. & Manthey, B.https://doi.org/10.1016/j.dam.2011.03.004Characterizing graphs of small carving-width (2013)Discrete applied mathematics, 161(13-14), 1888-1893. Belmonte, R., van 't Hof, P., Kaminski, M., Paulusma, D. & Thilikos, D. M.https://doi.org/10.1016/j.dam.2013.02.036Clustering clinical departments for wards to achieve a prespecified blocking probability (2013)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. van Essen, J. T., van Houdenhoven, M. & Hurink, J. L.Corrected phase-type approximations for the workload of the MAP/G/1 queue with heavy-tailed service times (2013)[Contribution to conference › Poster] 7th International Conference on Lévy Processes 2013. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.Corrected phase-type approximations for the workload of the MAP/G/1 queue with heavy-tailed service times (2013)[Contribution to conference › Paper] Workshop for Young European Queueing Theorists 2013. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.Corrected phase-type approximations for the workload of the MAP/G/1 queue with heavy-tailed service times (2013)SIGMETRICS performance evaluation review, 41(2). Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, B.https://doi.org/10.1145/2518025.2518036Corrected phase-type approximations of heavy-tailed risk models using perturbation analysis (2013)Insurance: mathematics & economics, 53(2), 366-378. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, B.https://doi.org/10.1016/j.insmatheco.2013.07.002Corrected phase-type approximations of heavy-tailed risk models using perturbation analysis (2013)[Book/Report › Report]. EURANDOM. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, B.Cyclic-type polling models with preparation times (2013)In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES (pp. 14-23). INSTICC PRESS. Perel, N., Dorsman, J. L. & Vlasiou, M.https://www.scitepress.org/Link.aspx?doi=10.5220/0004206500140023Cyclic-type polling models with preparation times (2013)[Book/Report › Report]. EURANDOM. Perel, N., Dorsman, J. L. & Vlasiou, M.Decentralized throughput scheduling (2013)In Algorithms and Complexity: 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (pp. 134-145) (Lecture Notes in Computer Science; Vol. 7878). Springer. de Jong, J., Uetz, M. J. & Wombacher, A.https://doi.org/10.1007/978-3-642-38233-8_12Exact algorithms for finding longest cycles in claw-free graphs (2013)Algorithmica, 65(1), 129-145. Broersma, H. J., Fomin, F. V., van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/s00453-011-9576-4Forbidden subgraph pairs for traceability of block-chains (2013)Electronic journal of graph theory and applications, 1(1), 1-10. Li, B., Broersma, H. & Zhang, S.https://doi.org/10.5614/ejgta.2013.1.1.1Fully decomposable split graphs (2013)European journal of combinatorics, 34(3), 567-575. Broersma, H. J., Kratsch, D. & Woeginger, G.https://doi.org/10.1016/j.ejc.2011.09.044Heavy-traffic asymptotics for networks of parallel queues with Markov-modulated service speeds (2013)[Book/Report › Report]. EURANDOM. Dorsman, J. L., Vlasiou, M. & Zwart, B.Induced subtrees in interval graphs (2013)In Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers (pp. 230-243) (Lecture Notes in Computer Science; Vol. 8288). Springer. Heggernes, P., van 't Hof, P. & Milanic, M.https://doi.org/10.1007/978-3-642-45278-9_20Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs (2013)In Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers (pp. 127-138) (Lecture Notes in Computer Science; Vol. 8165). Springer. Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D. & Proskurowski, A.https://doi.org/10.1007/978-3-642-45043-3_12Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (2013)In Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings (pp. 121-132) (Lecture Notes in Computer Science; Vol. 8070). Springer. Chaplick, S., Fiala, J., van 't Hof, P., Paulusma, D. & Tesar, M.https://doi.org/10.1007/978-3-642-40164-0_14Marginal queue length approximations for a two-layered network with correlated queues (2013)Queueing systems, 75(1), 29-63. Dorsman, J. L., Boxma, O. J. & Vlasiou, M.https://doi.org/10.1007/s11134-012-9338-2Obtaining a bipartite graph by contracting few edges (2013)SIAM journal on discrete mathematics, 27(4), 2143-2156. Heggernes, P., van 't Hof, P., Lokshtanov, D. & Paul, C.https://doi.org/10.1137/130907392Parallel queueing networks with Markov-modulated service speeds in heavy traffic (2013)SIGMETRICS performance evaluation review, 41(2), 47-49. Dorsman, J.-P. L., Vlasiou, M. & Zwart, B.https://doi.org/10.1145/2518025.2518034Parameterized complexity of two edge contraction problems with degree constraints (2013)In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (pp. 16-27) (Lecture Notes in Computer Science; Vol. 8246). Springer. Belmonte, R., Golovach, P. A., van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/978-3-319-03898-8_3Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013) - Preface (2013)In Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTIT Workshop Proceedings; Vol. WP 13-01). Centre for Telematics and Information Technology (CTIT). Hurink, J. L. & Manthey, B.Proper Interval Vertex Deletion (2013)Algorithmica, 65(4), 845-867. van 't Hof, P. & Villanger, Y.https://doi.org/10.1007/s00453-012-9661-3Random shortest paths: non-euclidean instances for metric optimization problems (2013)In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013) (pp. 219-230) (Lecture Notes in Computer Science; Vol. 8087). Springer. Bringmann, K., Engels, C., Manthey, B. & Rao, B. V. R.https://doi.org/10.1007/978-3-642-40313-2_21Rescheduling in the OR: A decision support system keeps stakeholders and OR-manager happy (2013)Hospital (English ed.), 15(4-5), OR1-OR4. van Essen, J. T., Hurink, J. L., Hartholt, W. & van den Akker, B. J.https://healthmanagement.org/c/hospital/issuearticle/rescheduling-in-the-or-a-decision-support-system-keeps-stakeholders-and-or-manager-happyServer waiting times in infinite supply polling systems with preparation times (2013)[Book/Report › Report]. EURANDOM. Dorsman, J. L., Perel, N. & Vlasiou, M.Smoothed analysis of belief propagation for minimum-cost flow and matching (2013)In Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013) (pp. 182-193) (Lecture Notes in Computer Science; Vol. 7748). Springer. Brunsch, T., Cornelissen, K., Manthey, B. & Röglin, H.https://doi.org/10.1007/978-3-642-36065-7_18Smoothed analysis of belief propagation for minimum-cost flow and matching (2013)Journal of graph algorithms and applications, 17(6), 647-670. Brunsch, T., Cornelissen, K., Manthey, B. & Röglin, H.https://doi.org/10.7155/jgaa.00310Smoothed analysis of partitioning algorithms for Euclidean functionals (2013)Algorithmica, 66(2), 397-418. Bläser, M., Manthey, B. & Rao, B. V. R.https://doi.org/10.1007/s00453-012-9643-5Smoothed analysis of the 2-opt heuristic for the TSP: polynomial bounds for Gaussian noise (2013)In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013) (pp. 579-589) (Lecture Notes in Computer Science; Vol. 8283). Springer. Manthey, B. & Veenstra, R.https://doi.org/10.1007/978-3-642-45030-3_54Smoothed analysis of the successive shortest path algorithm (2013)[Contribution to conference › Paper] 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2013. Brunsch, T., Cornelissen, K., Hurink, J. L., Manthey, B. & Röglin, H.Smoothed analysis of the successive shortest path algorithm (2013)In Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (pp. 1180-1189) (Proceedings ACM-SIAM Symposium on Discrete Algorithms; Vol. 2013). SIAM. Brunsch, T., Cornelissen, K., Manthey, B. & Röglin, H.https://dl.acm.org/doi/10.5555/2627817.2627902Tactical resource allocation and elective patient admission planning in care processes (2013)Health care management science, 16(2), 152-166. Hulshof, P. J. H., Boucherie, R. J., Hans, E. W. & Hurink, J. L.https://doi.org/10.1007/s10729-012-9219-6Tank-ring factors in supereulerian claw-free graphs (2013)Graphs and combinatorics, 29(3), 599-608. Li, M., Yuan, L., Jiang, H., Liu, B. & Broersma, H. J.https://doi.org/10.1007/s00373-011-1117-zThree complexity results on coloring $P_k$-free graphs (2013)European journal of combinatorics, 34(3), 609-619. Broersma, H. J., Fomin, V. V., Golovach, P. A. & Paulusma, D.https://doi.org/10.1016/j.ejc.2011.12.008Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (2013)Theoretical computer science, 485, 69-84. Broersma, H. J., Golovach, P. A. & Patel, V.https://doi.org/10.1016/j.tcs.2013.03.008Toughness and vertex degrees (2013)Journal of graph theory, 72(2), 209-219. Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N. & Schmeichel, E.https://doi.org/10.1002/jgt.21639Two dimensional optimal mechanism design for a sequencing problem (2013)In Integer Programming and Combinatorial Optimization: 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings (pp. 242-253) (Lecture Notes in Computer Science; Vol. 7801). Springer. Hoeksma, R. & Uetz, M.https://doi.org/10.1007/978-3-642-36694-9_21Vector connectivity in graphs (2013)In Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings (pp. 331-342) (Lecture Notes in Computer Science; Vol. 7876). Springer. Boros, E., Heggernes, P., van 't Hof, P. & Milanic, M.https://doi.org/10.1007/978-3-642-38236-9_30Worst-case and smoothed analysis of k-means clustering with Bregman divergences (2013)Journal of computational geometry, 4(1), 94-132. Manthey, B. & Röglin, H.https://doi.org/10.20382/jocg.v4i1a5
2012
Social context in potential games (2012)In Internet and Network Economics: 8th International Workshop, WINE 2012, Proceedings (pp. 364-377) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7695 LNCS). Hoefer, M. & Skopalik, A.https://doi.org/10.1007/978-3-642-35311-6_27Two Dimensional Optimal Mechanism Design for a Sequencing Problem (2012)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Hoeksma, R. P. & Uetz, M. J.Controlling smart grid adaptivity (2012)In 2012 IEEE PES Innovative Smart Grid Technologies (ISGT) Europe (pp. -). IEEE. Toersche, H., Nykamp, S., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2012.6465748Comparing Demand Side Management approaches (2012)In Proceedings of the 3rd Innovative Smart Grid Technologies Conference (ISGT Europe) (pp. 1-8). IEEE. Molderink, A., Bakker, V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2012.6465699Integration of heat pumps in distribution grids: economic motivation for grid control (2012)[Contribution to conference › Paper] 2012 IEEE PES Innovative Smart Grid Technologies Europe, ISGT Europe 2012. Nykamp, S., Molderink, A., Bakker, V., Toersche, H., Hurink, J. L. & Smit, G. J. M.Non-Intrusive Appliance Recognition (2012)In 2012 3rd IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe 2012) (pp. 84). IEEE. Hoogsteen, G., Krist, J. O., Bakker, V. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2012.6465688Integration of Heat Pumps in Distribution Grids: Economic Motivation for Grid Control (2012)[Contribution to conference › Paper] 2012 IEEE PES Innovative Smart Grid Technologies Europe, ISGT Europe 2012. Nykamp, S., Molderink, A., Bakker, V., Toersche, H., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEurope.2012.6465605Subgraph conditions for Hamiltonian properties of graphs (2012)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Li, B.https://doi.org/10.3990/1.9789036534031Pairs of forbidden induced subgraphs for homogeneously traceable graphs (2012)Discrete mathematics, 312(18), 2800-2818. Li, B., Li, B., Broersma, H. J. & Zhang, S.https://doi.org/10.1016/j.disc.2012.05.018Statistics for PV, wind and biomass generators and their impact on distribution grid planning (2012)Energy, 45(No. 1), 924-932. Nykamp, S., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1016/j.energy.2012.06.067On the impact of fair best response dynamics (2012)In Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings (pp. 360-371) (Lecture Notes in Computer Science; Vol. 7464). Springer. Fanelli, A., Moscardelli, L. & Skopalik, A.https://doi.org/10.1007/978-3-642-32589-2_33Days off scheduling - A 2-phase approach to personnel rostering (2012)In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2012 (pp. 381-383). SINTEF. van Veldhoven, S., Post, G. F. & van der Veen, E.Improve OR-schedule to reduce number of required beds (2012)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. van Essen, J. T., Bosch, J. M., Hans, E. W., van Houdenhoven, M. & Hurink, J. L.http://beta.ieis.tue.nl/node/2039Self-rostering applied to case studies - An ILP method to construct a feasible schedule (2012)In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012) (pp. 384-387). SINTEF. Uijland, S., van der Veen, E., Hurink, J. L. & Schutten, J. M. J.http://www.patat2012.com/Proceedings_patat12.pdfThe Third International Timetabling Competition (2012)In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012) (pp. 479-484). SINTEF. Post, G. F., Di Gaspero, L., Kingston, J. H., McCollum, B. & Schaerf, A.http://www.patat2012.com/Proceedings_patat12.pdf‘Standard’ incentive regulation hinders the integration of renewable energy generation (2012)Energy policy, 47, 222-237. Nykamp, S., Andor, M. & Hurink, J. L.https://doi.org/10.1016/j.enpol.2012.04.061Planning in Smart Grids (2012)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Bosman, M. G. C.https://doi.org/10.3990/1.9789036533867Decentralized Throughput Scheduling (2012)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). de Jong, J., Uetz, M. J. & Wombacher, A.Integral multidisciplinary rehabilitation treatment planning (2012)[Book/Report › Report]. University of Twente. Braaksma, A., Kortbeek, N., Post, G. F. & Nollet, F.http://math.utwente.nl/publicationsSmoothed analysis of left-to-right maxima with applications (2012)ACM transactions on algorithms, 8(3), 30:1-30:28. Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H. H., Scheideler, C., Sohler, C. & Tantau, T.https://doi.org/10.1145/2229163.2229174Contracting graphs to paths and trees (2012)Algorithmica, 68(1), 109-132 (E-pub ahead of print/First online). Heggernes, P., van 't Hof, P., Lévêque, B., Lokshtanov, D. & Paul, C.https://doi.org/10.1007/s00453-012-9670-2Erratum: An algorithm-based topographical biomaterials library to instruct cell fate (Proceedings of the National Academy of Sciences of the United States of America (2011) 108, 40 (16565-16570) DOI: 10.1073/pnas.1109861108) (2012)Proceedings of the National Academy of Sciences of the United States of America, 109(15), 5905. Unadkat, H. V., Hulsman, M., Cornelissen, K., Papenburg, B. J., Truckenmüller, R. K., Carpenter, A. E., Wessling, M., Post, G. F., Uetz, M., Reinders, M. J. T., Stamatialis, D., Van Blitterswijk, C. A. & De Boer, J.https://doi.org/10.1073/pnas.1204360109On approximating multi-criteria TSP (2012)ACM transactions on algorithms, 8(2), 17:1-17:18. Article 17. Manthey, B.https://doi.org/10.1145/2151171.2151180Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time (2012)Theoretical computer science, 423, 1-10. Broersma, H. J., Golovach, P. A., Paulusma, D. & Song, J.https://doi.org/10.1016/j.tcs.2011.12.076Degree sequences and the existence of k-factors (2012)Graphs and combinatorics, 28(2), 149-166. Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N. & Schmeichel, E.https://doi.org/10.1007/s00373-011-1044-zPolymetrisch metselen (2012)STAtOR, 13(1), 9-12. de Jong, J., Vinduška, H., Hans, E. W. & Post, G. F.http://eprints.eemcs.utwente.nl/secure2/21675/01/STAtOR_2012-1_20-23_definitief.pdfControlling the heating mode of heat pumps with the TRIANA three step methodology (2012)In 2012 IEEE PES Innovative Smart Grid Technologies (ISGT) (pp. 1-7). IEEE. Toersche, H., Bakker, V., Molderink, A., Nykamp, S., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGT.2012.6175662Triana: a control strategy for Smart Grids: Forecasting, planning & real-time control (2012)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Bakker, V.https://doi.org/10.3990/1.9789036533140Updating the complexity status of coloring graphs without a fixed induced linear forest (2012)Theoretical computer science, 414(1), 9-19. Broersma, H. J., Golovach, P. A., Paulusma, D. & Song, J.https://doi.org/10.1016/j.tcs.2011.10.005An XML format for benchmarks in High School Timetabling (2012)Annals of operations research, 194(1), 385-397. Post, G. F., Ahmadi, S., Daskalaki, S., Kingston, J. H., Kyngas, J., Nurmi, C. & Ranson, D.https://doi.org/10.1007/s10479-010-0699-9Analysis of a two-layered network with correlated queues by means of the power-series algorithm (2012)[Book/Report › Report]. EURANDOM. Dorsman, J. L., Mei van der, R. D. & Vlasiou, M.Characterizing graphs of small carving-width (2012)In Combinatorial Optimization and Applications: 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings (pp. 360-370) (Lecture Notes in Computer Science; Vol. 7402). Springer. Belmonte, R., van 't Hof, P., Kamiński, M., Paulusma, D. & Thilikos, D. M.https://doi.org/10.1007/978-3-642-31770-5Computing minimum geodetic sets of proper interval graphs (2012)In LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (pp. 279-290) (Lecture Notes in Computer Science; Vol. 7256). Springer. Ekim, T., Erey, A., Heggernes, P., van 't Hof, P. & Meister, D.https://doi.org/10.1007/978-3-642-29344-3_24Computing role assignments of proper interval graphs in polynomial time (2012)Journal of discrete algorithms, 14, 173-188. Heggernes, P., van 't Hof, P. & Paulusma, D.https://doi.org/10.1016/j.jda.2011.12.004Computing the cutwidth of bipartite permutation graphs in linear time (2012)SIAM journal on discrete mathematics, 26(3), 1008-1021. Heggernes, P., van 't Hof, P., Lokshtanov, D. & Nederlof, J.https://doi.org/10.1137/110830514Cyclic transfers in school timetabling (2012)OR Spectrum = OR Spektrum, 34(1), 133-154. Post, G., Ahmadi, S. & Geertsema, F.https://doi.org/10.1007/s00291-010-0227-yDecision support system for the operating room rescheduling problem (2012)Health care management science, 15(4), 355-372. van Essen, J. T., Hurink, J. L., Hartholt, W. & van den Akker, B. J.https://doi.org/10.1007/s10729-012-9202-2Deterministic algorithms for multi-criteria Max-TSP (2012)Discrete applied mathematics, 160(15), 2277-2285. Manthey, B.https://doi.org/10.1016/j.dam.2012.05.007Distribution bottlenecks in classification algorithms (2012)Procedia computer science, 10, 960-967. Zwartjes, A., Havinga, P. J. M., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.1016/j.procs.2012.06.131Dynamic server assignment in an extended machine-repair model (2012)[Book/Report › Report]. EURANDOM. Dorsman, J. L., Bhulai, S. & Vlasiou, M.Edge contractions in subclasses of chordal graphs (2012)Discrete applied mathematics, 160(7-8), 999-1010. Belmonte, R., Heggernes, P. & van 't Hof, P.https://doi.org/10.1016/j.dam.2011.12.012Een planningsmethode voor reductie van de fluctuaties in de belasting van verpleegafdelingen (2012)STAtOR, 12(2), 4-8. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L., van Lent, W. A. M. & van Harten, W. H.Efficiency evaluation for pooling resources in health care (2012)OR Spectrum = OR Spektrum, 34(2), 371-390. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.https://doi.org/10.1007/s00291-010-0228-xFinding induced paths of given parity in claw-free graphs (2012)Algorithmica, 62(1-2), 537-563. van 't Hof, P., Kaminski, M. & Paulusma, D.https://doi.org/10.1007/s00453-010-9470-5How many conjectures can you stand? A survey (2012)Graphs and combinatorics, 28(1), 57-75. Broersma, H. J., Ryjáček, Z. & Vrána, P.https://doi.org/10.1007/s00373-011-1090-6How to eliminate a graph (2012)In Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers (pp. 320-331) (Lecture Notes in Computer Science; Vol. 7551). Springer. Golovach, P. A., Heggernes, P., van 't Hof, P., Manne, F., Paulusma, D. & Pilipczuk, M.https://doi.org/10.1007/978-3-642-34611-8_32Induced immersions (2012)In Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings (pp. 299-308) (Lecture Notes in Computer Science; Vol. 7676). Springer. Belmonte, R., van 't Hof, P. & Kaminski, M.https://doi.org/10.1007/978-3-642-35261-4_33Max-plus algebraic throughput analysis of synchronous dataflow graphs (2012)In 38th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA) (pp. 29-38). IEEE. de Groote, R., Kuper, J., Broersma, H. J. & Smit, G. J. M.https://doi.org/10.1109/SEAA.2012.20Maximum number of minimal feedback vertex sets in chordal graphs and cographs (2012)In Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings (pp. 133-144) (Lecture Notes in Computer Science; Vol. 7434). Springer. Couturier, J.-F., Heggernes, P., van 't Hof, P. & Villanger, Y.https://doi.org/10.1007/978-3-642-32241-9_12Minimal dominating sets in graph classes: Combinatorial bounds and enumeration (2012)In SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings (pp. 202-213) (Lecture Notes in Computer Science; Vol. 7147). Springer. Couturier, J.-F., Heggernes, P., van 't Hof, P. & Kratsch, D.https://doi.org/10.1007/978-3-642-27660-6_17Minimizing the waiting time for emergency surgery (2012)Operations research for health care, 1(2-3), 34-44. van Essen, J. T., Hans, E. W., Hurink, J. L. & Oversberg, A.https://doi.org/10.1016/j.orhc.2012.05.002Multi-criteria TSP: Min and max combined (2012)Operations research letters, 40(1), 36-38. Manthey, B.https://doi.org/10.1016/j.orl.2011.10.012Multilevel unit commitment in smart grids (2012)In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (pp. 361-370). SCITEPRESS. Bosman, M. G. C., Molderink, A., Bakker, V., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.5220/0003716903610370Nascence project: nanoscale engineering for novel computation using evolution (2012)International journal of unconventional computing, 8(4), 313-317. Broersma, H. J., Gomez, F., Miller, J., Petty, M. & Tufte, G.http://eprints.eemcs.utwente.nl/secure2/23732/01/IJUC_UC005_NASCENCE_V2.pdfObtaining planarity by contracting few edges (2012)In Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings (pp. 455-466) (Lecture Notes in Computer Science; Vol. 7464). Springer. Golovach, P. A., van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/978-3-642-32589-2_41On graph contractions and induced minors (2012)Discrete applied mathematics, 160(6), 799-809. van 't Hof, P., Kaminski, M., Paulusma, D., Szeider, S. & Thilikos, D. M.https://doi.org/10.1016/j.dam.2010.05.005On smoothed analysis of quicksort and Hoare's find (2012)Algorithmica, 62(3-4), 879-905. Fouz, M., Kufleitner, M., Manthey, B. & Zeini Jahromi, N.https://doi.org/10.1007/s00453-011-9490-9On the accuracy of phase-type approximations of heavy-tailed risk models (2012)[Book/Report › Report]. EURANDOM. Vatamidou, E., Adan, I. J. B. F., Vlasiou, M. & Zwart, A. P.On the parameterized complexity of finding separators with non-hereditary properties (2012)In Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers (pp. 332-343) (Lecture Notes in Computer Science; Vol. 7551). Springer. Heggernes, P., van 't Hof, P., Marx, D., Misra, N. & Villanger, Y.https://doi.org/10.1007/978-3-642-34611-8_33Operating room rescheduling (2012)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. van Essen, J. T., Hurink, J. L., Hartholt, W. & van den Akker, B. J.Planning the production of a fleet of domestic combined heat and power generators (2012)European journal of operational research, 216(1), 140-151. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1016/j.ejor.2011.07.033Ramsey numbers for line graphs and perfect graphs (2012)In Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings (pp. 204-215) (Lecture Notes in Computer Science; Vol. 7434). Springer. Belmonte, R., Heggernes, P., van 't Hof, P. & Saei, R.https://doi.org/10.1007/978-3-642-32241-9_18Random shortest path metrics with applications (2012)In Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012) (pp. 121-124). Universität der Bundeswehr München. Engels, C., Manthey, B. & Raghavendra Rao, B. V.http://eprints.eemcs.utwente.nl/secure2/21909/01/CTW2012.pdfSeparation of timescales in a two-layered network (2012)In 2012 24th International Teletraffic Congress (ITC 24). Vlasiou, M., Zhang, J., Zwart, B. & Mei van der, R. D.https://ieeexplore.ieee.org/document/6331834/authorsShift rostering using decomposition: assign weekend shifts first (2012)[Book/Report › Report]. University of Twente. van der Veen, E., Hans, E. W., Post, G. & Veltman, B.Smoothed complexity theory (2012)In 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012 (pp. 198-209) (Lecture Notes in Computer Science; Vol. 7464). Springer. Bläser, M. & Manthey, B.https://doi.org/10.1007/978-3-642-32589-2_20Sparsity of Lift-and-Project Cutting Planes (2012)In Operations Research Proceedings 2012: Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Leibniz University of Hannover, Germany, September 5-7, 2012 (pp. 9-14). Springer. Walter, M.https://doi.org/10.1007/978-3-319-00795-3_2The complexity of finding uniform sparsest cuts in various graph classes (2012)Journal of discrete algorithms, 14, 136-149. Bonsma, P. S., Broersma, H. J., Patel, V. & Pyatkin, A. V.https://doi.org/10.1016/j.jda.2011.12.008The price of anarchy for minsum related machine scheduling (2012)In 9th International Workshop on Approximation and Online Algorithms, WAOA 2011 (pp. 261-273) (Lecture Notes in Computer Science; Vol. 7164). Springer. Hoeksma, R. P. & Uetz, M. J.https://doi.org/10.1007/978-3-642-29116-6_22Tight complexity bounds for FPT subgraph problems parameterized by clique-width (2012)In Parameterized and Exact Computation: 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (pp. 207-218) (Lecture Notes in Computer Science; Vol. 7112). Springer. Broersma, H. J., Golovach, P. A. & Patel, V.https://doi.org/10.1007/978-3-642-28050-4_17Using Unsupervised Learning to Improve the Naive Bayes Classifier for Wireless Sensor Networks (2012)In Proceedings of the Sixth International Conference on MObile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2012 (pp. 71-76). Xpert Publishing Services. Zwartjes, G. J., Havinga, P. J. M., Smit, G. J. M. & Hurink, J. L.http://eprints.eemcs.utwente.nl/secure2/22478/01/ubicomm_2012_3_40_10182.pdf
2011
Minimizing the waiting time for emergency surgery (2011)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. van Essen, J. T., Hans, E. W., Hurink, J. L. & Oversberg, A.http://beta.ieis.tue.nl/node/1976On the Effects of Input Unreliability on Classifion Algorithms (2011)In 8th International ICST Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services, MobiQuitous 2011 (pp. 126-137) (Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (LNICST); Vol. 104). Springer. Zwartjes, G. J., Bahrepour, M., Havinga, P. J. M., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1007/978-3-642-30973-1_11Considerate equilibrium (2011)In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 234-239). Hoefer, M., Penn, M., Polukarov, M., Skopalik, A. & Vöcking, B.https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-050Driver rostering for bus transit companies (2011)Engineering letters, 19(2), 125-132. Nurmi, K., Kyngäs, J. & Post, G. F.http://www.engineeringletters.com/issues_v19/issue_2/index.htmlExponential size neighborhoods for makespan minimization scheduling (2011)Naval research logistics, 58(8), 795-803. Brueggemann, T., Hurink, J. L., Vredeveld, T. & Woeginger, G.https://doi.org/10.1002/nav.20485Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs (2011)Journal of graph theory, 68(4), 285-298. Li, M., Chen, X. & Broersma, H. J.https://doi.org/10.1002/jgt.20558Matching based very large-scale neighborhoods for parallel machine scheduling (2011)Journal of heuristics, 17(6), 637-658. Brueggemann, T. & Hurink, J. L.https://doi.org/10.1007/s10732-010-9149-8Smoothed analysis: analysis of algorithms beyond worst case (2011)IT - Information Technology, 53(6), 280-286. Manthey, B. & Röglin, H.https://doi.org/10.1524/itit.2011.0654The Shapley value as a function of the quota in weighted voting games (2011)In IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence (pp. 490-495). Zick, Y., Skopalik, A. & Elkind, E.https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-089An algorithm-based topographical biomaterials library to instruct cell fate (2011)Proceedings of the National Academy of Sciences of the United States of America, 108(40), 16565-16570. Unadkat, H. V., Hulsman, M., Cornelissen, K., Papenburg, B. J., Truckenmüller, R. K., Post, G. F., Uetz, M., Reinders, M. J. T., Stamatialis, D., van Blitterswijk, C. A. & de Boer, J.https://doi.org/10.1073/pnas.1109861108Smoothed analysis of the k-means method (2011)Journal of the Association for Computing Machinery, 58(5), 19:1-19:31. Arthur, D., Manthey, B. & Röglin, H.https://doi.org/10.1145/2027216.2027217Online Bivariate Outlier Detection in Final Test Using Kernel Density Estimation (2011)In IEEE Defect and Adaptive Test Analysis Workshop (pp. -). IEEE. Bossers, H. C. M., Hurink, J. L. & Smit, G. J. M.Mathematical Programming Approach to Multidimensional Mechanism Design for Single Machine Scheduling (2011)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Duives, J. & Uetz, M.Tactical resource allocation and elective patient admission planning in care pathways (2011)[Book/Report › Report]. University of Twente. Hulshof, P. J. H., Boucherie, R. J., Hans, E. W. & Hurink, J. L.Accounting for Inpatient Wards when developing Master Surgical Schedules (2011)Anesthesia and analgesia, 112(6), 1472-1479. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L., van Lent, W. A. M., van Harten, W. H. & van Harten, W. H.https://doi.org/10.1213/ANE.0b013e3182159c2fThe Price of Anarchy for Minsum Related Machine Scheduling (2011)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Hoeksma, R. P. & Uetz, M. J.Interacting hospital departments and uncertain patient flows: theoretical models and applications (2011)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Vanberkel, P. T.https://doi.org/10.3990/1.9789036531795Online Univariate Outlier Detection in Final Test: A Robust Rolling Horizon Approach (2011)In 16th IEEE European Test Symposium, ETS 2011 (pp. 201-201). IEEE. Bossers, H. C. M., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ETS.2011.10Controlling a group of microCHPs: planning and realization (2011)In First International Conference on Smart Grids, Green Communications and IT Energy-aware Technologies, ENERGY 2011 (pp. 179-184). International Academy, Research, and Industry Association (IARIA). Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.Complexiteit: Beperking en Uitdaging (2011)[Book/Report › Inaugural speech]. University of Twente. Hurink, J. L.On the three-step control methodology for Smart Grids (2011)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Molderink, A.https://doi.org/10.3990/1.9789036531702The complexity status of problems related to sparsest cuts (2011)In Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010 (pp. 125-135) (Lecture Notes in Computer Science; Vol. 6460). Springer. Bonsma, P. S., Broersma, H. J., Patel, V. & Pyatkin, A.https://doi.org/10.1007/978-3-642-19222-7_14Improved online algorithms for parallel job scheduling and strip packing (2011)Theoretical computer science, 412(7), 583-593. Hurink, J. L. & Paulus, J. J.https://doi.org/10.1016/j.tcs.2009.05.033Optimizing the strategic patient mix (2011)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W. & Hurink, J. L.A Lévy input fluid queue with input and workload regulation (2011)[Working paper › Preprint]. ArXiv.org. Palmowski, Z. B., Vlasiou, M. & Zwart, B.A Lévy input fluid queue with input and workload regulation (2011)[Book/Report › Report]. Palmowski, Z. B., Vlasiou, M. & Bert, A.A Lévy input model with additional state-dependent services (2011)Stochastic processes and their applications, 121(7), 1546-1564. Palmowski, Z. & Vlasiou, M.https://doi.org/10.1016/j.spa.2011.03.010An exact approach for relating recovering surgical patient workload to the master surgical schedule (2011)Journal of the Operational Research Society, 62(10), 1851-1860. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L., van Lent, W. A. M. & van Harten, W. H.https://doi.org/10.1057/jors.2010.141Analytic properties of two-carousel systems (2011)[Book/Report › Report]. EURANDOM. Bossier, R., Vlasiou, M. & Adan, I. J. B. F.Contracting chordal graphs and bipartite graphs to paths and trees (2011)Electronic notes in discrete mathematics, 37, 87-92. Heggernes, P., van 't Hof, P., Lévêque, B. & Paul, C.https://doi.org/10.1016/j.endm.2011.05.016Contracting graphs to paths and trees (2011)In Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (pp. 55-66) (Lecture Notes in Computer Science; Vol. 7112). Springer. Heggernes, P., van 't Hof, P., Lévêque, B., Lokshtanov, D. & Paul, C.https://doi.org/10.1007/978-3-642-28050-4_5Deterministic algorithms for multi-criteria TSP (2011)In Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011) (pp. 264-275) (Lecture Notes in Computer Science; Vol. 6648). Springer. Manthey, B.https://doi.org/10.1007/978-3-642-20877-5_27Edge contractions in subclasses of chordal graphs (2011)In Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings (pp. 528-539) (Lecture Notes in Computer Science; Vol. 6648). Springer. Belmonte, R., Heggernes, P. & van 't Hof, P.https://doi.org/10.1007/978-3-642-20877-5_51Efficient computation of approximate pure Nash equilibria in congestion games (2011)In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (pp. 532-541) (IEEE Annual Symposium on Foundations of Computer Science; Vol. 2011). IEEE. Caragiannis, I., Fanelli, A., Gravin, N. & Skopalik, A.https://doi.org/10.1109/FOCS.2011.50Finding contractions and induced minors in chordal graphs via disjoint paths (2011)In Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings (pp. 110-119) (Lecture Notes in Computer Science; Vol. 7074). Springer. Belmonte, R., Golovach, P. A., Heggernes, P., van 't Hof, P., Kaminski, M. & Paulusma, D.https://doi.org/10.1007/978-3-642-25591-5_13Generating price-effective intermodal routes (2011)Statistica Neerlandica, 65(4), 432-445. Gromicho, J. A. S., Oudshoorn, E. & Post, G. F.https://doi.org/10.1111/j.1467-9574.2011.00493.xLower bounds for Smith's rule in stochastic machine scheduling (2011)In 8th International Workshop on Approximation and Online Algorithms, WAOA 2010 (pp. 142-153) (Lecture Notes in Computer Science; Vol. 6534). Springer. Jagtenberg, C., Schwiegelshohn, U. & Uetz, M. J.https://doi.org/10.1007/978-3-642-18318-8Marginal queue length approximations for a two-layered network with correlated queues (2011)[Book/Report › Report]. EURANDOM. Dorsman, J. L., Vlasiou, M. & Boxma, O. J.Obtaining a bipartite graph by contracting few edges (2011)In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India (pp. 217-228) (LIPIcs; Vol. 13). Dagstuhl. Heggernes, P., van 't Hof, P., Lokshtanov, D. & Paul, C.https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217On the complexity of a bundle pricing problem (2011)4 OR, 9(3), 255-260. Grigoriev, A., van Loon, J. & Uetz, M. J.https://doi.org/10.1007/s10288-011-0154-zORchestra: an online reference database of OR/MS literature in health care (2011)Health care management science, 14(4), 383-384. Hulshof, P. J. H., Boucherie, R. J., van Essen, J. T., Hans, E. W., Hurink, J. L., Kortbeek, N., Litvak, N., Vanberkel, P. T., van der Veen, E., Veltman, B., Vliegen, I. & Zonderland, M. E.https://doi.org/10.1007/s10729-011-9169-4Parameterized complexity of vertex deletion into perfect graph classes (2011)In Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings (pp. 240-251) (Lecture Notes in Computer Science; Vol. 6914). Springer. Heggernes, P., van 't Hof, P., Jansen, B. M. P., Kratsch, S. & Villanger, Y.https://doi.org/10.1007/978-3-642-22953-4_21Planning and control of automated material handling systems: The merge module (2011)In Annual International Conference of the German Operations Research Society 2011 (pp. 281-286) (Operations Research Proceedings; Vol. 2010). Springer. Haneyah, S. W. A., Hurink, J. L., Schutten, J. M. J., Zijm, W. H. M. & Schuur, P.https://doi.org/10.1007/978-3-642-20009-0_45Privacy in non-private environments (2011)Theory of computing systems, 48(1), 211-245. Bläser, M., Jakoby, A., Liskiewicz, M. & Manthey, B.https://doi.org/10.1007/s00224-009-9243-1Progress control in iterated local search for nurse rostering (2011)Journal of the Operational Research Society, 62(2), 360-367. Burke, E. K., Curtois, T., Fijn van Draat, L., van Ommeren, J.-K. & Post, G.https://doi.org/10.1057/jors.2010.86Regenerative processes (2011)In Wiley encyclopedia of operations research and management science (pp. 1-6). Wiley. Vlasiou, M.https://doi.org/10.1002/9780470400531.eorms0713Renewal processes with costs and rewards (2011)In Wiley encyclopedia of operations research and management science. Wiley. Vlasiou, M.https://doi.org/10.1002/9780470400531.eorms0722Separation of timescales in a two-layered network (2011)[Book/Report › Report]. EURANDOM. Vlasiou, M., Zhang, J., Zwart, B. & Mei van der, R. D.Smoothed analysis of partitioning algorithms for Euclidean functionals (2011)In 12th International Symposium on Algorithms and Data Structures, WADS 2011 (pp. 110-121) (Lecture Notes in Computer Science; Vol. 6844). Springer. Bläser, M., Manthey, B. & Rao, B. V. R.https://doi.org/10.1007/978-3-642-22300-6_10Stochastic mean payoff games: smoothed analysis and approximation schemes (2011)In Automata, Languages and Programming: 38th International Colloquium on Automata, Languages and Programming, ICALP 2011 (pp. 147-158) (Lecture Notes in Computer Science; Vol. 6755). Springer. Boros, E., Elbassioni, K., Fouz, M., Gurvich, V., Makino, K. & Manthey, B.https://doi.org/10.1007/978-3-642-22006-7_13Time-constrained project scheduling with adjacent resources (2011)Computers & operations research, 38(1), 310-319. Hurink, J. L., Kok, A. L., Paulus, J. J. & Schutten, J. M. J.https://doi.org/10.1016/j.cor.2010.05.006Towards explaining the speed of k-means (2011)Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 2011, 45-54. Manthey, B., van de Pol, J. C., Raamsdonk, F. & Stoelinga, M. I. A.http://www.nvti.nl/Newsletter/Nieuwsbrief2011.pdf
2010
On the effects of MPC on a domestic energy efficiency optimization methodology (2010)In Proceedings of the 2010 IEEE International Energy Conference (EnergyCon 2010) (pp. 1569327927). IEEE. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.On Simulating the Effect on the Energy Efficiency of Smart Grid Technologies (2010)In Proceedings of the 2010 Winter Simulation Conference (pp. 393-404). Association for Computing Machinery. Bakker, V., Molderink, A., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/WSC.2010.5679146Applying Column Generation to the Discrete Fleet Planning Problem (2010)In Proceedings of the STW.ICT Conference 2010 (pp. 200-204). STW. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.Steering the Smart Grid (2010)In 2010 STW.ICT Conference (pp. 1-7). STW. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.Constructing fair round robin tournaments with a minimum number of breaks (2010)Operations research letters, 38(6), 592-596. van 't Hof, P., Post, G. & Briskorn, D.https://doi.org/10.1016/j.orl.2010.08.008Benchmarking set for domestic smart grid management (2010)In 2010 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe 2010) (pp. 1-8). IEEE. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGTEUROPE.2010.5639005Demand side load management using a three step optimization methodology (2010)In First IEEE International Conference on Smart Grid Communications (SmartGridComm 2010) (pp. 431-436). IEEE. Bakker, V., Bosman, M. G. C., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/SMARTGRID.2010.5622082High-throughput screening of cell-surface topographic interactions (2010)In 14th International Conference on Miniaturized Systems for Chemistry and Life Sciences 2010, MicroTAS 2010 (pp. 2083-2084) (International Conference on Miniaterized Systems for Chemistry and Life Sciences : [proceedings]; Vol. 2010). The Chemical and Biological Microsystems Society. Unadkat, H. V., Hulsman, M., Cornelissen, K., Papenburg, B., Truckenmüller, R. K., Post, G. F., Uetz, M., Reinders, M. J. T., Stamatialis, D., van Blitterswijk, C. & de Boer, J.Improving stability and utilization of the electricity infrastructure of a neighbourhood (2010)In Proceedings of the 2010 IEEE Conference on Innovative Technologies for an Efficient and Reliable Electricity Supply, CITRES 2010 (pp. 233-239). IEEE. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/CITRES.2010.5619805Computing role assignments of chordal graphs (2010)Theoretical computer science, 411(40-42), 3601-3613. van 't Hof, P., Paulusma, D. & Rooij, J. M. M. v.https://doi.org/10.1016/j.tcs.2010.05.041Computing sharp 2-factors in claw-free graphs (2010)Journal of discrete algorithms, 8(3), 321-329. Article 10.1016/j.jda.2009.07.001. Broersma, H. & Paulusma, D.https://doi.org/10.1016/j.jda.2009.07.001Management and Control of Domestic Smart Grid Technology (2010)IEEE transactions on smart grid, 1(2), 109-119. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/TSG.2010.2055904Roosteren op een middelbare school (2010)STAtOR, 11(3), 24-28. Post, G. F., Ruizenaar, H. W. A. & Bannink, R.https://www.vvsor.nl/stator/pages/archive/Synthesis and stochastic assessment of cost-optimal schedules (2010)International journal on software tools for technology transfer, 12(5), 305-317. Mader, A., Bohnenkamp, H., Usenko, Y. S., Jansen, D. N., Hurink, J. & Hermanns, H.https://doi.org/10.1007/s10009-009-0129-yAn XML format for benchmarks in high school timetabling II (2010)In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (pp. 347-350). Queen’s University. Post, G. F., Kingston, J. H., Ahmadi, S., Daskalaki, S., Gogos, C., Kyngas, J., Nurmi, C., Santos, H., Rorije, B. & Schaerf, A.http://www.cs.qub.ac.uk/~B.McCollum/patat10Round-Robin Tournaments with homogenous rounds (2010)In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2010 (pp. 122-135). Queen's University of Belfast. Buiteveld, B., van Holland, E., Post, G. F. & Smit, D.http://www.cs.qub.ac.uk/~B.McCollum/patat10On the complexity of a bundle pricing problem (2010)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Grigoriev, A., van Loon, J. & Uetz, M. J.Lower bounds for Smith's rule in stochastic machine scheduling (2010)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Jagtenberg, C., Schwiegelshohn, U. & Uetz, M. J.An analysis of the lifetime of OLSR networks (2010)Ad hoc networks, 8(4), 391-399. Verbree, J.-M., de Graaf, M. & Hurink, J. L.https://doi.org/10.1016/j.adhoc.2009.09.003Scheduling microCHPs in a group of houses (2010)Journal of global optimization, 1(1), 30-37. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.http://eprints.eemcs.utwente.nl/secure2/18723/01/ES-C11.pdfExploiting structure to cope with NP-hard graph problems: polynomial and exponential time exact algorithms (2010)[Thesis › PhD Thesis - Research external, graduation external]. University of Durham. van 't Hof, P.http://etheses.dur.ac.uk/285/On run-time exploitation of concurrency (2010)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Holzenspies, P. K. F.https://doi.org/10.3990/1.9789036530217Improved Heat Demand Prediction of Individual Households (2010)In IFAC Conference on Control Methodologies and Technology for Energy Efficiency (CMTEE 2010): Vilamoura, Portugal, 29-31 March 2010 (pp. 110-115). Curran Associates Inc.. Bakker, V., Bosman, M. G. C., Molderink, A., Hurink, J. L. & Smit, G. J. M.Run-time Spatial Resource Management for Real-Time Applications on Heterogeneous MPSoCs (2010)In Proceedings of the Conference on Design, Automation and Test in Europe (DATE 2010) (pp. 357-362). European Design and Automation Association. ter Braak, T. D., Holzenspies, P. K. F., Kuper, J., Hurink, J. L. & Smit, G. J. M.http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5457177Tail asymptotics for a random sign Lindley recursion (2010)Journal of applied probability, 47(1), 72-83. Vlasiou, M. & Palmowski, Z.https://doi.org/10.1239/jap/1269610817Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007 (2010)Discrete applied mathematics, 158(4), 239-239. Faigle, U. & Hurink, J. L.https://doi.org/10.1016/j.dam.2009.09.011On the microCHP scheduling problem (2010)In Proceedings of the 3rd Global Conference on Power Control and Optimization PCO, 2010 (pp. 367-374) (AIP Conference Proceedings; Vol. 1239). PCO. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1063/1.3459774Fast exact algorithms for hamiltonicity in claw-free graphs (2010)In Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers (pp. 44-53) (Lecture Notes in Computer Science; Vol. 5911). Springer. Broersma, H. J., Fomin, F. V., van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/978-3-642-11409-0_4A Three-Step Methodology to Improve Domestic Energy Efficiency (2010)In Proceedings of the 2010 IEEE Innovative Smart Grid Technologies Conference (pp. 1-8). IEEE. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISGT.2010.5434731A new characterization of P6-free graphs (2010)Discrete applied mathematics, 158(7), 731-740. van 't Hof, P. & Paulusma, D.https://doi.org/10.1016/j.dam.2008.08.025A survey of health care models that encompass multiple departments (2010)International journal of health management and information (IJHMI), 1(1), 37-69. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.A survey on performance analysis of warehouse carousel systems (2010)Statistica Neerlandica, 64(4), 401-447. Litvak, N. & Vlasiou, M.https://doi.org/10.1111/j.1467-9574.2010.00454.xApproximating independent set in semi-random graphs (2010)In Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010) (pp. 119-122). University of Cologne. Manthey, B. & Plociennik, K.http://ctw.uni-koeln.de/CTW2010.pdfBisimplicial edges in bipartite graphs (2010)In Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010) (pp. 29-32). University of Cologne. Bomhoff, M. J. & Manthey, B.http://ctw.uni-koeln.de/CTW2010.pdfComputing role assignments of proper interval graphs in polynomial time (2010)In Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers (pp. 167-180) (Lecture Notes in Computer Science; Vol. 6460). Springer. Heggernes, P., van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/978-3-642-19222-7_18Computing the cutwidth of bipartite permutation graphs in linear time (2010)In Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers (pp. 75-87) (Lecture Notes in Computer Science; Vol. 6410). Heggernes, P., van 't Hof, P., Lokshtanov, D. & Nederlof, J.https://doi.org/10.1007/978-3-642-16926-7_9Designing for Economies of Scale vs. Economies of Focus in Hospital Departments (2010)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.Mechanism design for decentralized online machine scheduling (2010)Operations research, 58(2), 445-457. Heydenreich, B., Müller, R. & Uetz, M.https://doi.org/10.1287/opre.1090.0732Multi-criteria TSP: Min and Max combined (2010)In 7th International Workshop Approximation and Online Algorithms (WAOA 2009) (pp. 205-216) (Lecture Notes in Computer Science; Vol. 5893). Springer. Manthey, B.https://doi.org/10.1007/978-3-642-12450-1_19Narrowing down the gap on the complexity of coloring Pk-free graphs (2010)In Graph-Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Revised Papers (pp. 63-74) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6410 LNCS). Broersma, H., Golovach, P. A., Paulusma, D. & Song, J.https://doi.org/10.1007/978-3-642-16926-7_8On coloring graphs without induced forests (2010)In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings (pp. 156-167) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6507 LNCS). Broersma, H., Golovach, P. A., Paulusma, D. & Song, J.https://doi.org/10.1007/978-3-642-17514-5_14On contracting graphs to fixed pattern graphs (2010)In SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings (pp. 503-514) (Lecture Notes in Computer Science; Vol. 5901). Springer. van 't Hof, P., Kaminski, M., Paulusma, D., Szeider, S. & Thilikos, D. M.https://doi.org/10.1007/978-3-642-11266-9_42On the complexity of a bundle pricing problem (2010)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Grigoriev, A., van Lohn, J. & Uetz, M. J.On the complexity of the highway pricing problem (2010)In SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science (pp. 465-476). Article 10.1007/978-3-642-11266-9_39 (Lecture Notes in Computer Science; Vol. 5901). Springer. Grigoriev, A., van Loon, J. & Uetz, M. J.https://doi.org/10.1007/978-3-642-11266-9_39Reallocating resources to focused factories: a case study in chemotherapy (2010)In Proceedings of the 34th Meeting of the European Group on Operations Research Applied to Health Services (ORAHS) (pp. 152-164). EURO Working Group on Operational Research Applied to Health Services, ORAHS. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L., Litvak, N., van Lent, W. A. M., van Harten, W. H. & van Harten, W. H.
2009
Doing good with spam is hard (2009)In Algorithmic Game Theory : Second International Symposium, SAGT 2009, Proceedings (pp. 263-274) (Lecture Notes in Computer Science; Vol. 5814). Springer. Hoefer, M., Olbrich, L. & Skopalik, A.https://doi.org/10.1007/978-3-642-04645-2_24On the complexity of nash dynamics and sink equilibria (2009)In EC'09 - Proceedings of the 2009 ACM Conference on Electronic Commerce (pp. 1-10). Mirrokni, V. S. & Skopalik, A.https://doi.org/10.1145/1566374.1566376Simulating the effect on the energy efficiency of smart grid technologies (2009)In Proceedings of the 2009 Winter Simulation Conference (pp. 1530-1541). IEEE. Molderink, A., Bosman, M. G. C., Bakker, V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/WSC.2009.5429305Stability and convergence in selfish scheduling with altruistic agents (2009)In Internet and Network Economics: 5th International Workshop, WINE 2009, Proceedings (pp. 616-622) (Lecture Notes in Computer Science; Vol. 5929). Springer. Hoefer, M. & Skopalik, A.https://doi.org/10.1007/978-3-642-10841-9_63Improved simulator to analyse the impact of distributed generation on the electricity grid (2009)In Proceedings of the Twentieth Annual Workshop on Circuits, Systems ans Signal Processing (ProRISC) (pp. 197-201). Technology Foundation. Bakker, V., Molderink, A., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.Production planning in a Virtual Power Plant (2009)In Proceedings of the 20th annual workshop on Program for Research on Integrated Systems and Circuits (pp. 6). STW. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.Run-time Spatial Mapping of Streaming Applications to Heterogeneous Multi-Processor Systems (2009)International journal of parallel programming, 38(1), 68-83. Article 10.1007/s10766-009-0120-y. Holzenspies, P. K. F., ter Braak, T. D., Kuper, J., Smit, G. J. M. & Hurink, J. L.https://doi.org/10.1007/s10766-009-0120-yPartitioning graphs into connected parts (2009)Theoretical computer science, 410(47-49), 4834-4843. van 't Hof, P., Paulusma, D. & Woeginger, G. J.https://doi.org/10.1016/j.tcs.2009.06.028Altruism in atomic congestion games (2009)In Algorithms - ESA 2009: 17th Annual European Symposium, Proceedings (pp. 179-189) (Lecture Notes in Computer Science; Vol. 5757). Springer. Hoefer, M. & Skopalik, A.https://doi.org/10.1007/978-3-642-04128-0_16An exact approach for relating recovering surgical patient workload to the master surgical schedule (2009)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L., van Lent, W. A. M., van Lent, W. A. M., van Harten, W. H. & van Harten, W. H.Cyclic transfers in school timetabling (2009)[Book/Report › Report]. University of Twente. Post, G., Ahmadi, S. & Geertsema, F.Domestic energy efficiency improving algorithms (2009)In Proceedings of the 2009 ProRISC Workshop (pp. 229-236). STW. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.Scheduling jobs with time-resource tradeoff via nonlinear programming (2009)Discrete optimization, 6(4), 414-419. Grigoriev, A. & Uetz, M. J.https://doi.org/10.1016/j.disopt.2009.05.002Domestic energy management methodology for optimizing efficiency in Smart Grids (2009)In IEEE Bucharest Power Tech Conference (pp. 1-7). IEEE. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/PTC.2009.5281849Round-robin tournaments with minimum number of breaks and two teams per club (2009)[Book/Report › Report]. Universität Kiel. van 't Hof, P., Post, G. & Briskorn, D.λ-backbone colorings along pairwise disjoint stars and matchings (2009)Discrete mathematics, 309(18), 5596-5609. Broersma, H. J., Fujisawa, J., Marchal, L., Paulusma, D., Salman, M. & Yoshimoto, K.https://doi.org/10.1016/j.disc.2008.04.007Removable Edges in 4-Connected Graphs (2009)[Thesis › PhD Thesis - Research UT, graduation UT]. Wohrmann Printing Service. Wu, J.https://doi.org/10.3990/1.9789036528924Hard- and software implementation and verification of an Islanded House prototype (2009)In Proceedings of the 2009 International Conference on Systems Engineering (pp. 327-332). Coventry University. Molderink, A., Bosman, M. G. C., Bakker, V., Hurink, J. L. & Smit, G. J. M.Efficiency evaluation for pooling resources in health care: An interpretation for managers (2009)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.A survey of health care models that encompass multiple departments (2009)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.Efficiency evaluation for pooling resources in health care (2009)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.Efficiency evaluation for pooling resources in health care (2009)[Contribution to conference › Paper] 15th Anniversary Annual CTIT Symposium 2009. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.The microCHP scheduling problem (2009)In Proceedings of the Second Global Conference on Power Control and Optimization, PCO 2009 (pp. 268-275) (AIP Conference Proceedings; Vol. 1159). Springer. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1063/1.3223940Designing for Economies of Scale vs. Economies of Focus in Hospital Departments (2009)[Contribution to conference › Paper] 3TU Research Day on Innovation in Design and Management of Health Care Facilities and Healthy Environments. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.On hamiltonicity of P3-dominated graphs (2009)Mathematical methods of operations research, 69(2), 297-306. Article 10.1007/s00186-008-0260-7. Broersma, H. J. & Vumar, E.https://doi.org/10.1007/s00186-008-0260-7Minimum-weight cycle covers and their approximability (2009)Discrete applied mathematics, 157(7), 1470-1480. Manthey, B.https://doi.org/10.1016/j.dam.2008.10.005Approximability of Minimum AND-Circuits (2009)Algorithmica, 53(3), 337-357. Arpe, J. & Manthey, B.https://doi.org/10.1007/s00453-007-9039-0Average-case approximation ratio of the 2-opt algorithm for the TSP (2009)Operations research letters, 37(2), 83-84. Article 10.1016/j.orl.2008.12.002. Engels, C. & Manthey, B.https://doi.org/10.1016/j.orl.2008.12.002Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number (2009)Discussiones mathematicae. Graph theory, 29(1), 143-162. Broersma, H. J., Marchal, B., Paulusma, D. & Salman, M.https://doi.org/10.7151/dmgt.1437Complexity of conditional colorability of graphs (2009)Applied mathematics letters, 22(3), 320-324. Li, X., Yao, X., Zhou, W. & Broersma, H.https://doi.org/10.1016/j.aml.2008.04.003Upper bounds and algorithms for parallel knock-out numbers (2009)Theoretical computer science, 410(14), 1319-1327. Article 10.1016/j.tcs.2008.03.024. Broersma, H. J., Johnson, M., Paulusma, D. & Stewart, I. A.https://doi.org/10.1016/j.tcs.2008.03.024An analysis of the lifetime of OLSR networks (2009)[Book/Report › Report]. University of Twente. Verbree, J.-M., de Graaf, M. & Hurink, J. L.Online Scheduling & Project Scheduling (2009)[Thesis › PhD Thesis - Research UT, graduation UT]. BETA. Paulus, J. J.https://doi.org/10.3990/1.9789036527538Characterization of revenue equivalence (2009)Econometrica, 77(1), 307-316. Heydenreich, B., Müller, R., Uetz, M. & Vohra, R. V.https://doi.org/10.3982/ECTA7168A Lévy input model with additional state-dependent services (2009)[Book/Report › Report]. Palmowski, Z. B. & Vlasiou, M.A Lévy input model with additional state-dependent services (2009)[Working paper › Preprint]. ArXiv.org. Palmowski, Z. B. & Vlasiou, M.A Survey of Health Care Models that Encompass Multiple Departments (2009)[Book/Report › Report]. University of Twente, Research School for Operations Management and Logistics (BETA). Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L. & Litvak, N.A survey on performance analysis of warehouse carousel systems (2009)[Book/Report › Report]. Litvak, N. & Vlasiou, M.A two-station queue with dependent preparation and service times (2009)European journal of operational research, 195(1), 104-116. Vlasiou, M., Adan, I. J. B. F. & Boxma, O. J.https://doi.org/10.1016/j.ejor.2008.01.027Approximation algorithms for multi-criteria traveling salesman problems (2009)Algorithmica, 53(1), 69-88. Manthey, B. & Shankar Ram, L.https://doi.org/10.1007/s00453-007-9011-zComputing role assignments of chordal graphs (2009)In Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings (pp. 193-204) (Lecture Notes in Computer Science; Vol. 5699). Springer. van 't Hof, P., Paulusma, D. & Rooij, J. M. M. v.https://doi.org/10.1007/978-3-642-03409-1_18Finding induced paths of given parity in claw-free graphs (2009)In Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers (pp. 341-352) (Lecture Notes in Computer Science; Vol. 5911). van 't Hof, P., Kaminski, M. & Paulusma, D.https://doi.org/10.1007/978-3-642-11409-0_30Fully decomposable split graphs (2009)In Combinatorial Algorithms - Proceedings of the 20th International Workshop IWOCA 2009 (pp. 105-112). Article 10.1007/978-3-642-10217-2_13 (Lecture Notes in Computer Science; Vol. 5874). Springer. Broersma, H. J., Kratsch, D. & Woeginger, G.https://doi.org/10.1007/978-3-642-10217-2_13Improved smoothed analysis of the k-means method (2009)In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009 (pp. 461-470). SIAM. Manthey, B. & Röglin, H.k-Means has polynomial smoothed complexity (2009)In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009) (pp. 405-414) (Annual IEEE Symposium on Foundations of Computer Science; Vol. 2009). IEEE. Arthur, D., Manthey, B. & Röglin, H.https://doi.org/10.1109/FOCS.2009.14Large deviations for a random sign Lindley recursion (2009)[Book/Report › Report]. EURANDOM. Vlasiou, M. & Palmowski, Z. B.On approximating multi-criteria TSP (2009)In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009 (pp. 637-648) (LIPIcs–Leibniz International Proceedings in Informatics). Dagstuhl. Manthey, B.https://doi.org/10.4230/LIPIcs.STACS.2009.1853On smoothed analysis of quicksort and Hoare's find (2009)In Proceedings of the 15th Annual International Computing and Combinatorics Conference, COCOON 2009 (pp. 158-167). Article 10.1007/978-3-642-02882-3_17 (Lecture Notes in Computer Science; Vol. 5609). Springer. Fouz, M., Kufleitner, M., Manthey, B. & Zeini Jahromi, N.https://doi.org/10.1007/978-3-642-02882-3_17Optimal pricing of capacitated networks (2009)Networks, 53(1), 79-87. Grigoriev, A., van Loon, J., Sitters, R. & Uetz, M. J.https://doi.org/10.1002/net.20260Partitioning graphs into connected parts (2009)In Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings (pp. 143-154) (Lecture Notes in Computer Science; Vol. 5675). Springer. van 't Hof, P., Paulusma, D. & Woeginger, G. J.https://doi.org/10.1007/978-3-642-03351-3_15Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (2009)Graphs and combinatorics, 25(4), 427-460. Article 10.1007/s00373-009-0855-7. Broersma, H. J., Paulusma, D. & Yoshimoto, K.https://doi.org/10.1007/s00373-009-0855-7Three Complexity Results on Coloring $P_k$-Free Graphs (2009)In Combinatioral Algorithms - Proceedings of the 20th International Workshop , IWOCA 2009 (pp. 95-104). Article 10.1007/978-3-642-10217-2_12 (Lecture Notes in Computer Science; Vol. 5874). Springer. Broersma, H. J., Fomin, F. V., Golovach, P. A. & Paulusma, D.https://doi.org/10.1007/978-3-642-10217-2_12Worst-case and smoothed analysis of $k$-means clustering with Bregman divergences (2009)In Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009 (pp. 1024-1033) (Lecture Notes in Computer Science; Vol. 5878). Springer. Manthey, B. & Röglin, H.https://doi.org/10.1007/978-3-642-10631-6_103
2008
Approximating multi-criteria Max-TSP (2008)In Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings (pp. 185-197) (Lecture Notes in Computer Science; Vol. 5193). Springer. Bläser, M., Manthey, B. & Putz, O.https://doi.org/10.1007/978-3-540-87744-8_16Inapproximability of pure Nash equilibria (2008)In STOC'08: Proceedings of the fortieth annual ACM symposium on Theory of computing (pp. 355-364). Skopalik, A. & Vöcking, B.https://doi.org/10.1145/1374376.1374428A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks (2008)In Proceedings of the International Symposium on Parallel and Distributed Processing with Applications (ISPA-08) (pp. 863-870). IEEE. Marin Perianu, R., Hurink, J. L. & Hartel, P. H.https://doi.org/10.1109/ISPA.2008.18Algorithms for optimal price regulations (2008)In Internet And Network Economics (WINE 2008) (pp. 362-373). Article 10.1007/978-3-540-92185-1_42 (Lecture Notes in Computer Science; Vol. 5385). Springer. Grigoriev, A., van Loon, J. & Uetz, M. J.https://doi.org/10.1007/978-3-540-92185-1_42Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks (2008)Discrete mathematics, 308(WoTUG-31/24), 6064-6077. Broersma, H. J., Fijavz, G., Kaiser, T., Kuzel, R., Ryjacek, Z. & Vrana, P.https://doi.org/10.1016/j.disc.2007.11.026Optimal mechanisms for single machine scheduling (2008)In Internet And Network Economics (WINE 2008) (pp. 414-425). Article 10.1007/978-3-540-92185-1_47 (Lecture Notes in Computer Science; Vol. 5385). Springer. Heydenreich, B., Mishra, D., Müller, R. & Uetz, M. J.https://doi.org/10.1007/978-3-540-92185-1_47Some families of integral graphs (2008)Discrete mathematics, 308(24), 6383-6391. Wang, L., Broersma, H., Hoede, C., Li, X. & Still, G.https://doi.org/10.1016/j.disc.2007.12.010Taxing subnetworks (2008)In Internet and Network Economics: 4th International Workshop, WINE 2008, Proceedings (pp. 286-294) (Lecture Notes in Computer Science; Vol. 5385). Springer. Hoefer, M., Olbrich, L. & Skopalik, A.https://doi.org/10.1007/978-3-540-92185-1_35Load control in low voltage level of the electricity grid using µCHP appliances (2008)In Proceedings of the Nineteenth Annual Workshop on Circuits, Systems ans Signal Processing (ProRISC) (pp. 25-29). Technology Foundation. Bosman, M. G. C., Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.Simulation of the effect of introducing micro-generation, energy buffers and accompanied optimization algorithms on the energy efficiency (2008)In Proceedings of the Nineteenth Annual Workshop on Circuits, Systems ans Signal Processing (ProRISC) (pp. 72-76). Technology Foundation. Molderink, A., Bakker, V., Bosman, M. G. C., Hurink, J. L. & Smit, G. J. M.http://eprints.eemcs.utwente.nl/secure2/13496/01/molderink.pdfUsing heat demand prediction to optimise Virtual Power Plant production capacity (2008)In Proceedings of the Nineteenth Annual Workshop on Circuits, Systems ans Signal Processing (ProRISC) (pp. 11-15). Technology Foundation. Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.Preface (2008)In Proceedings of the sixty-third European Study Group Mathematics with Industry: Enschede, The Netherlands, 28 January – 1 February, 2008 (pp. ii-ii) (CWI Syllabus). Centrum voor Wiskunde en Informatica. Bokhove, O., Dalenoord, D., Heres-Ticheler, D., Hurink, J., Meinsma, G., Plekenpol, M., Stolk, C. & Vellekoop, M.Smoothed analysis of binary search trees and quicksort under additive noise (2008)In Mathematical Foundations of Computer Science 2008 : 33rd International Symposium, MFCS 2008, Toru'n, Poland, August 25-29, 2008. Proceedings (pp. 467-478) (Lecture Notes in Computer Science; Vol. 5162). Springer. Manthey, B. & Tantau, T.https://doi.org/10.1007/978-3-540-85238-4_38A generalized clustering algorithm for dynamic wireless sensor networks (2008)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Marin Perianu, R., Hurink, J. L. & Hartel, P. H.On the Complexity of the Highway Pricing Problem (2008)[Book/Report › Report]. University of Twente. Grigoriev, A., van Loon, J. & Uetz, M. J.Matrix Approach to Cooperative Game Theory (2008)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Xu Genjiu, G.https://doi.org/10.3990/1.9789036527101Algorithms for balancing demand-side load and micro-generation in Islanded Operation (2008)In Proceedings of the nineteenth international conference on systems engineering (pp. 115-120). Article 10.1109/ICSEng.2008.50. IEEE. Molderink, A., Bakker, V., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ICSEng.2008.50Domestic Heat Demand Prediction using Neural Networks (2008)In Proceedings of Nineteenth International Conference on Systems Engineering (pp. 189-194). IEEE. Bakker, V., Molderink, A., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ICSEng.2008.51Computing sharp 2-factors in claw-free graphs (2008)In Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings (pp. 193-204) (Lecture Notes in Computer Science; Vol. 5162). Springer. Broersma, H. & Paulusma, D.https://doi.org/10.1007/978-3-540-85238-4_15A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (2008)European journal of operational research, 188(2), 330-341. Burke, E. K., Curtois, T., Post, G., Qu, R. & Veltman, B.https://doi.org/10.1016/j.ejor.2007.04.030Resource Management in Heterogeneous Wireless Sensor Networks (2008)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Baarsma, H. E., Bosman, M. G. C. & Hurink, J. L.Connected even factors in claw-free graphs (2008)Discrete mathematics, 308(11), 2282-2284. Li, M., Xiong, L. & Broersma, H.https://doi.org/10.1016/j.disc.2007.04.058Fewer intensive care unit refusals and a higher capacity utilization by using a cyclic surgical case schedule (2008)Journal of critical care, 23(2), 222-226. Article 10.1016/j.jcrc.2007.07.002. van Houdenhoven, M., van Oostrum, J. M., Wullink, G., Hans, E. W., Hurink, J. L., Bakker, J. & Kazemier, G.https://doi.org/10.1016/j.jcrc.2007.07.002The Ramsey numbers of large star and large star-like trees versus odd wheels (2008)Journal of combinatorial mathematics and combinatorial computing (JCMCC), 65, 153-162. Surahmat, C., Baskoro, E. T. & Broersma, H. J.A master surgical scheduling approach for cyclic scheduling in operating room departments (2008)OR Spectrum = OR Spektrum, 30(2), 355-374. van Oostrum, J. M., van Houdenhoven, M., Hurink, J. L., Hans, E. W., Wullink, G. & Kazemier, G.https://doi.org/10.1007/s00291-006-0068-xMechanism Design for Decentralized Online Machine Scheduling (2008)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Heydenreich, B., Müller, R. & Uetz, M.Scheduling Parallel Jobs with Time-Resource Tradeoff via Nonlinear Programming (2008)[Book/Report › Report]. University of Twente. Grigoriev, A. & Uetz, M. J.Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC) (2008)In Proceedings of the Eleventh Conference on Design, Automation and Test in Europe, DATE08 (pp. 212-217). European Design and Automation Association. Holzenspies, P. K. F., Hurink, J. L., Kuper, J. & Smit, G. J. M.https://doi.org/10.1109/DATE.2008.4484688The computational complexity of the parallel knock-out problem (2008)Theoretical computer science, 393(1-3), 182-195. Broersma, H., Johnson, M., Paulusma, D. & Stewart, I. A.https://doi.org/10.1016/j.tcs.2007.11.021Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines (2008)In 5th International Workshop on Approximation and Online Algorithms (pp. 41-54). Article 10.1007/978-3-540-77918-6_4 (Lecture Notes in Computer Science; Vol. 4927). Springer. Brueggemann, T., Hurink, J. L., Vredeveld, T. & Woeginger, G.https://doi.org/10.1007/978-3-540-77918-6_4A new algorithm for on-line coloring bipartite graphs (2008)SIAM journal on discrete mathematics, 22(1), 72-91. Broersma, H. J., Capponi, A. & Paulusma, D.https://doi.org/10.1137/060668675A survey on performance analysis of warehouse carousel systems (2008)[Book/Report › Report]. University of Twente. Litvak, N. & Vlasiou, M.Online algorithm for parallel job scheduling and strip packing (2008)In 5th International Workshop on Approximation and Online Algorithms, WAOA 2007 (pp. 67-74). Article 10.1007/978-3-540-77918-6_6 (Lecture Notes in Computer Science; Vol. 4927). Springer. Hurink, J. L. & Paulus, J. J.https://doi.org/10.1007/978-3-540-77918-6_6Characterization of Revenue Equivalence (2008)[Book/Report › Report]. University of Twente. Heydenreich, B., Müller, R., Uetz, M. & Vohra, R.A course on queueing models (Book review) (2008)Journal of the American Statistical Association, 103(481), 429-430. Vlasiou, M.https://doi.org/10.1198/jasa.2008.s220A new characterization of P6-free graphs (2008)In Computing and Combinatorics: 14th Annual International Conference, COCOON 2008 Dalian, China, June 27-29, 2008 Proceedings (pp. 415-424) (Lecture Notes in Computer Science; Vol. 5092). Springer. van 't Hof, P. & Paulusma, D.https://doi.org/10.1007/978-3-540-69733-6_41Adding cardinality constraints to integer programs with applications to maximum satisfiability (2008)Information processing letters, 105(5), 194-198. Bläser, M., Heynen, T. & Manthey, B.https://doi.org/10.1016/j.ipl.2007.08.024Approximating minimum independent dominating sets in wireless networks (2008)Information processing letters, 109(2), 155-160. Hurink, J. L. & Nieberg, T.https://doi.org/10.1016/j.ipl.2008.09.021Approximation schemes for wireless networks (2008)ACM transactions on algorithms, 4(4), 49. Article 10.1145/1383369.1383380. Nieberg, T., Hurink, J. L. & Kern, W.https://doi.org/10.1145/1383369.1383380Complexity of pure nash equilibria in player-specific network congestion games (2008)Internet mathematics, 5(4), 323-342. Ackermann, H. & Skopalik, A.https://doi.org/10.1080/15427951.2008.10129170Domestic Electricity Usage Regulation Using µCHP Appliances (2008)Power systems design Europe, 5(1), 41-44. Molderink, A., Bakker, V., Hurink, J. L., Smit, G. J. M. & Kokkeler, A. B. J.http://eprints.eemcs.utwente.nl/secure2/12141/01/white_goods_janfeb08.pdfFast convergence to nearly optimal solutions in potential games (2008)In Proceedings of the 9th ACM conference on Electronic commerce - EC '08 (pp. 264-273). Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V. S. & Skopalik, A.https://doi.org/10.1145/1386790.1386832Large deviations for a random sign Lindley recursion (2008)[Book/Report › Book]. ArXiv.org. Vlasiou, M. & Palmowski, Z. B.M/G/∞ polling systems with random visit times (2008)Probability in the engineering and informational sciences, 22(1), 81-105. Vlasiou, M. & Yechiali, U.https://doi.org/10.1017/S0269964808000065On approximating restricted cycle covers (2008)SIAM journal on computing, 38(1), 181-206. Manthey, B.https://doi.org/10.1137/060676003Online scheduling of parallel jobs on two machines is 2-competitive (2008)Operations research letters, 36(1), 51-56. Article 10.1016/j.orl.2007.06.001. Hurink, J. L. & Paulus, J. J.https://doi.org/10.1016/j.orl.2007.06.001Optimal bundle pricing with monotonicity constraint (2008)Operations research letters, 36(DTR08-9/5), 609-614. Article 10.1016/j.orl.2008.04.008. Grigoriev, A., van Loon, J., Sviridenko, M., Uetz, M. J. & Vredeveld, T.https://doi.org/10.1016/j.orl.2008.04.008Reallocating resources to focused factories: a case study in chemotherapy (2008)[Book/Report › Report]. University of Twente. Vanberkel, P. T., Boucherie, R. J., Hans, E. W., Hurink, J. L., Litvak, N., van Lent, W. A. M. & van Harten, W. H.Shunting passenger trains: getting ready for departure (2008)In Proceedings of the 63rd European Study Group Mathematics with Industry: Enschede, The Netherlands, 28 January – 1 February, 2008 (pp. 1-19) (CWI Syllabi). Centrum voor Wiskunde en Informatica. van den Akker, M., Baarsma, H., Hurink, J., Modelski, M., Paulus, J. J., Reijnen, I., Roozemond, D. & Schreuder, J.Tight bounds for break minimization in tournament scheduling (2008)Journal of combinatorial theory. Series A, 115(Supplement/6), 1065-1068. Brouwer, A. E., Post, G. F. & Woeginger, G.https://doi.org/10.1016/j.jcta.2007.10.002Time-constrained project scheduling (2008)Journal of scheduling, 2008(11), 137-148. Article 10.1007/s10951-008-0059-7. Guldemond, T. A., Hurink, J. L., Paulus, J. J. & Schutten, J. M. J.https://doi.org/10.1007/s10951-008-0059-7Time-constrained project scheduling with adjacent resources (2008)[Book/Report › Report]. Operational Methods for Production & Logistics (OMPL). Hurink, J. L., Kok, A. L., Paulus, J. J. & Schutten, J. M. J.
2007
Approximation algorithms for multi-criteria traveling salesman problems (2007)In Approximation and Online Algorithms: 4th International Workshop, WAOA 2006, Revised Papers (pp. 302-315) (Lecture Notes in Computer Science; Vol. 4368). Springer. Manthey, B. & Ram, L. S.https://doi.org/10.1007/11970125_24Minimum-weight cycle covers and their approximability (2007)In Graph-Theoretic Concepts in Computer Science: 33rd International Workshop, WG 2007, Revised Papers (pp. 178-189) (Lecture Notes in Computer Science; Vol. 4769). Springer. Manthey, B.https://doi.org/10.1007/978-3-540-74839-7_18On the complexity of pure Nash equilibria in player-specific network congestion games (2007)In Internet and Network Economics : Third International Workshop, WINE 2007, Proceedings (pp. 419-430) (Lecture Notes in Computer Science; Vol. 4858). Springer. Ackermann, H. & Skopalik, A.https://doi.org/10.1007/978-3-540-77105-0_47Islanded house operation using a micro CHP (2007)In 18th Annual Workshop on Circuits (pp. 324-330) (Proceedings of the STW programs 2007). PATO. Molderink, A., Bakker, V., Hurink, J. L. & Smit, G. J. M.http://www.stw.nl/Programmas/Prorisc/Proceedings.htmSpecial cases of online parallel job scheduling (2007)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. Hurink, J. L. & Paulus, J. J.http://fp.tm.tue.nl/beta/Demonstration of Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSoC) (2007)In Dagstuhl Seminar Proceedings 07101 (pp. 212-217) (Dagstuhl Seminar Proceedings; Vol. 07101). Internationales Begegnungs- und Forschungszentrum für Informatik. Holzenspies, P. K. F., Kuper, J., Smit, G. J. M. & Hurink, J. L.http://drops.dagstuhl.de/opus/volltexte/2007/1138On the complexity of dominating set problems related to the minimum all-ones problem (2007)Theoretical computer science, 385(1-3), 60-70. Broersma, H. & Li, X.https://doi.org/10.1016/j.tcs.2007.05.027Path-kipas Ramsey numbers (2007)Discrete applied mathematics, 155(LNCS4549/14), 1878-1884. Salman, M. & Broersma, H. J.https://doi.org/10.1016/j.dam.2006.05.013Games and mechanism design in machine scheduling - an introduction (2007)Production and operations management, 16(4), 437-454. Heydenreich, B., Müller, R. & Uetz, M. J.http://eprints.eemcs.utwente.nl/secure2/11571/01/gam.pdfOn components of 2-factors in claw-free graphs (2007)In EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications (pp. 289-293). Article 10.1016/j.endm.2007.07.050 (Electronic Notes in Discrete Mathematics; Vol. 29). Elsevier. Broersma, H. J., Paulusma, D. & Yoshimoto, K.https://doi.org/10.1016/j.endm.2007.07.050Improved upper bounds for λ-backbone colorings along matchings and stars (2007)In SOFSEM 2007: Theory and Practice of Computer Science: 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007. Proceedings (pp. 188-199). Article 10.1007/978-3-540-69507-3 (Lecture Notes in Computer Science; Vol. 4362). Springer. Broersma, H. J., Marchal, L., Paulusma, D. & Salman, M.https://doi.org/10.1007/978-3-540-69507-3_15Two very large-scale neighborhoods for single machine scheduling (2007)OR Spectrum = OR Spektrum, 29(3), 513-533. Brueggemann, T. & Hurink, J. L.https://doi.org/10.1007/s00291-006-0052-5Upper bounds and algorithms for parallel knock-out numbers (2007)In SIROCCO 2007: 14th International Colloquium on Structural Information and Communication Complexity (pp. 328-340). Article 10.1007/978-3-540-72951-8_26 (Lecture Notes in Computer Science; Vol. 4474). Springer. Broersma, H. J., Johnson, M. & Paulusma, D.https://doi.org/10.1007/978-3-540-72951-8_26De complexiteit van de Vereenvoudigde Arbeidstijdenwet (2007)STAtOR, 8(2), 20-24. Fijn van Draat, L., Poppelaars, J. & Post, G.https://www.vvsor.nl/wp-content/uploads/2018/01/STAtOR_2007-2_totaal.pdfMachine scheduling with resource dependent processing times (2007)Mathematical programming, 110(Supplement/1), 209-228. Article 10.1007/s10107-006-0059-3. Grigoriev, A., Sviridenko, M. & Uetz, M. J.https://doi.org/10.1007/s10107-006-0059-3Integral trees of diameter 6 (2007)Discrete applied mathematics, 155(4542/10), 1254-1266. Wang, L., Broersma, H. J., Hoede, C., Li, X., Li, X. & Still, G. J.https://doi.org/10.1016/j.dam.2006.10.014Tutte sets in graphs II: The complexity of finding maximum Tutte sets (2007)Discrete applied mathematics, 155(4542/10), 1336-1343. Article 10.1016/j.dam.2007.02.002. Bauer, D., Broersma, H. J., Kahl, N., Morgana, A., Schmeichel, E. & Surowiec, T.https://doi.org/10.1016/j.dam.2007.02.002Online Algorithms for Parallel Job Scheduling and Strip Packing (2007)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. Hurink, J. L. & Paulus, J. J.http://eprints.eemcs.utwente.nl/secure2/10775/01/Beta_wp215.pdfTight bounds for break minimization (2007)[Book/Report › Report]. University of Twente. Brouwer, A. E., Post, G. F. & Woeginger, G.http://www.math.utwente.nl/publicationsOn Ramsey numbers for paths versus wheels (2007)Discrete mathematics, 307(D-07-01/7-8), 975-982. Salman, M. & Broersma, H. J.https://doi.org/10.1016/j.disc.2005.11.049Toughness and hamiltonicity in k-trees (2007)Discrete mathematics, 307(7-8), 832-838. Broersma, H., Xiong, L. & Yoshimoto, K.https://doi.org/10.1016/j.disc.2005.11.051Statistical quality analysis of schedulers under soft-real-time constraints (2007)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Baarsma, H. E., Hurink, J. L. & Jansen, P. G.On queues with service and interarrival times depending on waiting times (2007)Queueing systems, 56, 121-132. Boxma, O. J. & Vlasiou, M.https://doi.org/10.1007/s11134-007-9011-3Contractible subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for snarks (2007)Electronic notes in discrete mathematics, 28(4542), 55-59. Article 10.1016/j.endm.2007.01.009. Broersma, H. J., Fijavz, G., Kaiser, T., Kuzel, R., Ryjacek, Z. & Vrana, P.https://doi.org/10.1016/j.endm.2007.01.009Tutte sets in graphs I: Maximal tutte sets and D-graphs (2007)Journal of graph theory, 55(SINTEF A13/4), 343-358. Article 10.1002/jgt.20243. Bauer, D., Broersma, H. J., Morgana, A. & Schmeichel, E.https://doi.org/10.1002/jgt.20243Approximating minimum independent dominating sets in wireless networks (2007)[Book/Report › Report]. University of Twente. Hurink, J. L. & Nieberg, T.Online scheduling of parallel jobs on two machines is 2-competitive (2007)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. Hurink, J. L. & Paulus, J. J.http://fp.tm.tue.nl/beta/Pricing bridges to cross a river (2007)Naval research logistics, 54(4), 411-420. Bouhtou, M., Grigoriev, A., van Hoesel, S., van der Kraaij, A. F., Spieksma, F. C. R. & Uetz, M.https://doi.org/10.1002/nav.20216A case study for timetabling in a Dutch secondary school (2007)In Practice and Theory of Automated Timetabling VI: 6th International Conference, PATAT 2006 Brno, Czech Republic, August 30–September 1, 2006: Revised Selected Papers (pp. 267-279) (Lecture Notes in Computer Science; Vol. 3867). Springer. de Haan, P., Landman, R., Post, G. & Ruizenaar, H.https://doi.org/10.1007/978-3-540-77345-0_17A multi-station queue with dependent interarrival and service times (2007)[Contribution to conference › Paper] 14th INFORMS Applied Probability Conference 2007. Vlasiou, M., Adan, I. J. B. F. & Boxma, O. J.A non-increasing Lindley-type equation (2007)Queueing systems, 56(1), 41-52. Vlasiou, M.https://doi.org/10.1007/s11134-007-9029-6A two-station queue with dependent preparation and service times (2007)[Book/Report › Report]. EURANDOM. Vlasiou, M., Adan, I. J. B. F. & Boxma, O. J.Backbone colorings for graphs: Tree and path backbones (2007)Journal of graph theory, 55(SINTEF A13/2), 137-152. Article 10.1002/jgt.20228. Broersma, H. J., Fomin, F. V., Golovach, P. A. & Woeginger, G.https://doi.org/10.1002/jgt.20228Bundle pricing with comparable items (2007)In Algorithms - ESA 2007, 15th Annual European Symposium (pp. 475-486). Article 10.1007/978-3-540-75520-3_43 (Lecture Notes in Computer Science; Vol. 4698). Springer. Grigoriev, A., van Loon, J., Sviridenko, M., Uetz, M. J. & Vredeveld, T.https://doi.org/10.1007/978-3-540-75520-3_43Eliminating graphs by means of parallel knock-out schemes (2007)Discrete applied mathematics, 155(1/2), 92-102. Broersma, H. J., Fomin, F. V., Královič, R. & Woeginger, G.https://doi.org/10.1016/j.dam.2006.04.034Exact solution to a Lindley-type equation on a bounded support (2007)Operations research letters, 35(1), 105-113. Vlasiou, M. & Adan, I. J. B. F.https://doi.org/10.1016/j.orl.2005.12.004M/G/∞ polling systems with random visit times (2007)[Working paper › Preprint]. ArXiv.org. Vlasiou, M. & Yechiali, U.https://arxiv.org/abs/1404.5556Smoothed analysis of binary search trees (2007)Theoretical computer science, 378(3), 292-315. Manthey, B. & Reischuk, R.https://doi.org/10.1016/j.tcs.2007.02.035Time-dependent behaviour of an alternating service queue (2007)Stochastic models, 23(2), 235-263. Vlasiou, M. & Zwart, B.https://doi.org/10.1080/15326340701300787
2006
How to sell a graph: guidelines for graph retailers (2006)In Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006 Revised Papers (pp. 125-136) (Lecture Notes in Computer Science; Vol. 4271). Springer. Grigoriev, A., van Loon, J., Sitters, R. & Uetz, M.https://doi.org/10.1007/11917496_12Efficiency of Local Search (2006)[Thesis › PhD Thesis - Research UT, graduation UT]. Wohrmann Print Service. Brueggemann, T. & Brueggemann, T.Quality of Move-optimal Schedules for Minimizing Total Weigted Completion Time (2006)Operations research letters, 34(2/5), 583-590. Article 10.1016/j.orl.2005.08.003. Brueggemann, T., Hurink, J. L. & Kern, W.https://doi.org/10.1016/j.orl.2005.08.003Models and algorithms for stochastic online scheduling (2006)Mathematics of operations research, 31(3), 513-525. Article 10.1287/moor.1060.0201. Megow, N., Uetz, M. J. & Vredeveld, T.https://doi.org/10.1287/moor.1060.0201On approximating restricted cycle covers (2006)In Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers (pp. 282-295) (Lecture Notes in Computer Science; Vol. 3879). Springer. Manthey, B.https://doi.org/10.1007/11671411_22Sparse cuts, matching-cuts and leafy trees in graphs (2006)[Thesis › PhD Thesis - Research UT, graduation UT]. Ipskamp Printing. Bonsma, P. S.https://doi.org/10.3990/1.9789036523707Subpancyclicity of line graphs and degree sums along paths (2006)Discrete applied mathematics, 154(9), 1453-1463. Xiong, L. & Broersma, H.https://doi.org/10.1016/j.dam.2005.05.039Decentralization and mechanism design for online machine scheduling (2006)[Contribution to conference › Paper] 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006. Arge, L., Heydenreich, B., Müller, R., Freivalds, R. & Uetz, M. J.https://doi.org/10.1007/11785293_15Sports tournaments, home-away assignments, and the break minimization problem (2006)Discrete optimization, 3(WP06-03/2), 165-173. Post, G. F. & Woeginger, G.https://doi.org/10.1016/j.disopt.2005.08.009Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult (2006)Algorithmica, 44(4), 343-361. Article 10.1007/s00453-005-1176-8. Broersma, H. J., Fomin, F. V., Kratochvil, J. & Woeginger, G.https://doi.org/10.1007/s00453-005-1176-8Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times (2006)In Integer Programming and Combinatorial Optimization (pp. 182-195) (Lecture Notes in Computer Science; Vol. 3509). Springer. Grigoriev, A., Sviridenko, M. & Uetz, M.https://doi.org/10.1007/11496915_14Independent and Dominating Sets in Wireless Communication Graphs (2006)[Thesis › PhD Thesis - Research UT, graduation UT]. Wöhrmann Print Service. Nieberg, T.Toughness in graphs - A survey (2006)Graphs and combinatorics, 22(10/1), 1-35. Article 10.1007/s00373-006-0649-0. Bauer, D., Broersma, H. J. & Schmeichel, E.https://doi.org/10.1007/s00373-006-0649-0Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs (2006)Combinatorica, 26(1), 17-36. Brandt, S., Broersma, H., Diestel, R. & Kriesell, M.https://doi.org/10.1007/s00493-006-0002-5Path-fan Ramsey numbers (2006)Discrete applied mathematics, 154(06EX1521/9), 1429-1436. Salman, M. & Broersma, H. J.https://doi.org/10.1016/j.dam.2005.05.040Synthesis and Stochastic Assessment of Cost-Optimal Schedules (2006)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Mader, A. H., Bohnenkamp, H. C., Usenko, Y. S., Jansen, D. N., Hurink, J. L. & Hermanns, H.http://www.ub.utwente.nl/webdocs/ctit/1/00000168.pdfJob-Shop Scheduling with Limited Capacity Buffers (2006)OR Spectrum = OR Spektrum, 28(2), 151-176. Brucker, P., Heitmann, S., Hurink, J. & Nieberg, T.https://doi.org/10.1007/s00291-005-0008-1A Four-phase Approach to a Timetabling Problem in Secondary Schools (2006)In Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT) (pp. 423-425). Masaryk University. de Haan, P., Landman, R., Post, G. & Ruizenaar, H.A new upper bound on the cyclic chromatic number (2006)Journal of graph theory, 54(suppl 2/1), 58-72. Article 10.1002/jgt.20193. Borodin, O. V., Broersma, H. J., Glebov, A. & van den Heuvel, J.https://doi.org/10.1002/jgt.20193A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs (2006)In Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers (pp. 296-306) (Lecture Notes in Computer Science; Vol. 3879). Springer. Nieberg, T. & Hurink, J.https://doi.org/10.1007/11671411_23An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (2006)Journal of discrete algorithms, 4(4), 623-632. Bläser, M., Manthey, B. & Sgall, J.https://doi.org/10.1016/j.jda.2005.07.004Approximability of minimum AND-circuits (2006)In Algorithm Theory – SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006: Proceedings (pp. 292-303) (Lecture Notes in Computer Science; Vol. 4059). Springer. Arpe, J. & Manthey, B.https://doi.org/10.1007/11785293_28Approximation algorithms for restricted cycle covers based on cycle decompositions (2006)In Graph-Theoretic Concepts in Computer Science: 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006 Revised Papers (pp. 336-347) (Lecture Notes in Computer Science; Vol. 4271). Springer. Manthey, B.https://doi.org/10.1007/11917496_30Architectures for wireless sensor networks (2006)In Embedded Systems Handbook (pp. 33:1-33:22). CRC Press (Taylor & Francis). Dulman, S., Chatterjea, S., Hofmeijer, T., Havinga, P. & Hurink, J.Decomposition method for project scheduling with spatial resources (2006)[Book/Report › Report]. University of Twente. Hurink, J. L., Kok, A. L. & Paulus, J. J.http://fp.tm.tue.nl/beta/publications/working%20papers/beta_wp181.pdfEén spoed-OK is géén spoed-OK (2006)In Benchmarking OK - Leren van elkaar (pp. 165-172). Springer. Wullink, G., van der Lans, M., van Houdenhoven, M., Hans, E., Hurink, J. & Kazemier, G.Geïntegreerde OK-IC planning zorgt voor hogere OK-benutting en minder uitgevallen IC-patiënten (2006)In Benchmarking OK - Leren van elkaar (pp. 127-136). Springer. van de Pol, M., van Houdenhoven, M., Wullink, G., Hans, E. W., Hurink, J. L. & Kazemir, G.Harmonious personnel scheduling (2006)[Book/Report › Report]. Erasmus University Rotterdam. Fijn van Draat, L., Post, G. F., Veltman, B. & Winkelhuijzen, W.http://eprints.eemcs.utwente.nl/secure2/8144/01/Fijn_van_Draat.pdfHoge OK benutting en minder afgevallen patienten door cyclisch plannen (2006)In Benchmarking OK - Leren van elkaar (pp. 113-120). Springer. Oostrum, J., van Houdenhoven, M., Wullink, G., Hans, E. W., Hurink, J. L. & Kazemier, G.Lindley-type recursions (2006)[Thesis › PhD Thesis - Research external, graduation external]. Technische Universiteit Eindhoven. Vlasiou, M.https://doi.org/10.6100/IR610563LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times (2006)In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006. Proceedings (pp. 140-151) (Lecture Notes in Computer Science; Vol. 4110). Springer. Grigoriev, A., Sviridenko, M. & Uetz, M.https://doi.org/10.1007/11830924_15On queues with service and interarrival times depending on waiting times (2006)[Working paper › Preprint]. ArXiv.org. Vlasiou, M. & Boxma, O. J.On-line coloring of H-free bipartite graphs (2006)In Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings (pp. 284-295) (Lecture Notes in Computer Science; Vol. 3998). Springer. Broersma, H. J., Capponi, A. & Paulusma, D.https://doi.org/10.1007/11758471_28Private computation: k-connected versus 1-connected networks (2006)Journal of cryptology, 19(3), 341-357. Bläser, M., Jakoby, A., Liśkiewicz, M. & Manthey, B.https://doi.org/10.1007/s00145-005-0329-xProgress Control in Variable Neighbourhood Search (2006)In Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (pp. 376-380). Masaryk University. Curtois, T., Fijn van Draat, L., Post, G. F. & van Ommeren, J. C. W.http://eprints.eemcs.utwente.nl/secure2/8348/01/ProgressControlVNS.pdfQuality of Move-Optimal Schedules for Minimizing the Vector Norm of the Workloads (2006)[Book/Report › Report]. University of Twente. Brueggemann, T. & Hurink, J. L.Scheduling parallel jobs with linear speedup (2006)In Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers (pp. 203-215). Springer. Grigoriev, A. & Uetz, M.https://doi.org/10.1007/11671411_16The Computational Complexity of the Parallel Knock-Out Problem (2006)In LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006. Proceedings (pp. 250-261) (Lecture Notes in Computer Science; Vol. 3887). Springer. Broersma, H., Johnson, M., Paulusma, D. & Stewart, I. A.https://doi.org/10.1007/11682462_26Time-Constrained Project Scheduling (2006)[Book/Report › Report]. University of Twente, Research School for Operations Management and Logistics (BETA). Guldemond, T. A., Hurink, J. L., Paulus, J. J. & Schutten, J. M. J.Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (2006)[Book/Report › Report]. University of Twente. Brueggemann, T., Hurink, J. L., Vredeveld, T. & Woeginger, G.Wachttijdverkorting voor spoedpatiënten door schuiven met de planning van electieve operaties (2006)In Benchmarking OK - Leren van elkaar (pp. 147-154). Springer. Oostrum, J., van der Lans, M., van Houdenhoven, M., Hans, E. W., Hurink, J., Wullink, G. & Kazemier, G.
2005
Run-time Mapping of Applications to a Heterogeneous SoC (2005)In 2005 International Symposium on System-on-Chip Proceedings (pp. 78-81). IEEE. Smit, L. T., Hurink, J. L. & Smit, G. J. M.https://doi.org/10.1109/ISSOC.2005.1595649Fast ejection chain algorithms for vehicle routing with time windows (2005)[Contribution to conference › Paper] Hybrid Metaheuristics, Second International Workshop, HM 2005. Sontrop, H., Blesa, M. J., Blum, C., van der Horn, P., Uetz, M. J., Roli, A. & Sampels, M.https://doi.org/10.1007/11546245_8Mapping applications to a coarse grain reconfigurable system (2005)In New Algorithms, Architectures and Applications for Reconfigurable Computing (pp. 93-104). Kluwer Academic Publishers. Guo, Y., Smit, G. J. M., Broersma, H. J., Rosien, M. A. J., Heysters, P. M. & Krol, T.https://doi.org/10.1007/1-4020-3128-9_8Enumeration of circuits and minimal forbidden sets (2005)[Contribution to conference › Paper] 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2003. Stork, F. & Uetz, M.https://doi.org/10.1016/S1571-0653(04)00449-4Stochastic machine scheduling with precedence constraints (2005)SIAM journal on computing, 34(4), 788-802. Article 10.1137/S0097539702415007. Skutella, M. & Uetz, M. J.https://doi.org/10.1137/S0097539702415007Tabu search algorithms for job-shop problems with a single transport robot (2005)European journal of operational research, 162(1), 99-111. Hurink, J. L. & Knust, S.https://doi.org/10.1016/j.ejor.2003.10.034Pricing network edges to cross a river (2005)[Contribution to conference › Paper] Approximation and Online Algorithms (WAOA 2004). Persiano, G., Grigoriev, A., Solis-Oba, R., van Hoesel, S., van der Kraaij, A., Uetz, M. J. & Bouhtou, M.https://doi.org/10.1007/b106130Stochastic online scheduling on parallel machines (2005)[Contribution to conference › Paper] Approximation and Online Algorithms (WAOA 2004). Persiano, G., Megow, N., Uetz, M. J., Solis-Oba, R. & Vredeveld, T.https://doi.org/10.1007/11389811_15A Decomposition, Construction and Post-Processing Approach for Nurse Rostering (2005)In MISTA 2005: Proceedings of the 2nd Multidisciplinary Conference on Scheduling: Theory and Applications (pp. 397-406). University of New York. Brucker, P., Qu, R., Burke, E. & Post, G.A General Framework for Coloring Problems: Old Results, New Results, and Open Problems (2005)In Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers (pp. 65-79) (Lecture Notes in Computer Science; Vol. 3330). Springer. Broersma, H.https://doi.org/10.1007/978-3-540-30540-8_7A model for generating master surgical schedules to allow cyclic scheduling in operating room departments (2005)[Book/Report › Report]. Discrete Wiskunde, Operations Res. en Statistiek. van Oostrum, J. M., van Houdenhoven, M., Hurink, J. L., Hans, E. W., Wullink, G. & Kazemier, G.A non-increasing Lindley-type equation (2005)[Working paper › Preprint]. ArXiv.org. Vlasiou, M.An alternating service problem (2005)Probability in the engineering and informational sciences, 19(4), 409-426. Vlasiou, M. & Adan, I. J. B. F.https://doi.org/10.1017/S0269964805050254An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels (2005)In Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers (pp. 181-184) (Lecture Notes in Computer Science; Vol. 3330). Springer. Surahmat, Baskoro, E. T., Uttunggadewa, S. & Broersma, H.https://doi.org/10.1007/978-3-540-30540-8_20Anticipating urgent surgery in operating room departments (2005)[Book/Report › Report]. BETA Research School for Operations Management and Logistics. van der Lans, M., Hans, E. W., Hurink, J. L., Wullink, G., van Houdenhoven, M. & Kazemier, G.Approximating maximum weight cycle covers in directed graphs with weights zero and one (2005)Algorithmica, 42(2), 121-139. Bläser, M. & Manthey, B.https://doi.org/10.1007/s00453-004-1131-0Clustersize control and cluster based routing in Wireless Sensor Networks (2005)In ICT 2005- Proceedings of the 12th International Conference on Telecommunications, Capetown, South Africa (pp. -). Havinga, P. J. M., Nieberg, T. & Hurink, J. L.Contributions to graph theory (2005)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. Salman, M.Exact solution to a Lindley-type equation on a bounded support (2005)[Book/Report › Report]. ArXiv.org. Vlasiou, M. & Adan, I. J. B. F.Handelsreizigers in wiskunde : promotionele activiteiten op de Universiteit Twente (2005)Nieuw archief voor wiskunde, Ser. 5, vol. 6(2), 153-155. Broersma, H. J. & Ruizenaar, H. W. A.http://www.nieuwarchief.nl/serie5/pdf/naw5-2005-06-2-153.pdfMatching based exponential neighborhoods for parallel machine scheduling (2005)[Book/Report › Report]. University of Twente. Brueggemann, T. & Hurink, J. L.Modeling of capacitated transportation systems for integral scheduling (2005)In Container Terminals and Automated Transport Systems: Logistics Control Issues and Quantitative Decision Support (pp. 287-306). Springer. Ebben, M., van der Heijden, M., Hurink, J. & Schutten, M.https://doi.org/10.1007/3-540-26686-0_12More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs (2005)Bulletin of the Institute of Combinatorics and its Applications, 45, 17-32. Salman, M., Broersma, H. J. & Rodger, C. A.Move-optimal schedules for parallel machines to minimize total weighted completion time (2005)[Book/Report › Report]. University of Twente. Brueggemann, T., Hurink, J. L. & Kern, W.Non-approximability of weighted multiple sequence alignment for arbitrary metrics (2005)Information processing letters, 95(3), 389-395. Manthey, B.https://doi.org/10.1016/j.ipl.2005.04.010On stability of the Hamiltonian index under contractions and closures (2005)Journal of graph theory, 49(2), 104-115. Xiong, L., Ryjácek, Z. & Broersma, H.https://doi.org/10.1002/jgt.20068On the Advantages of Clusterbased Routing in Wireless Sensor Networks (2005)In EYES Workshop, European Workshop on Wireless Sensor Networks, EWSN 2005 (pp. -). Nieberg, T., Havinga, P. J. M. & Hurink, J. L.On the generation of circuits and minimal forbidden sets (2005)Mathematical programming, 102(1), 185-203. Stork, F. & Uetz, M.https://doi.org/10.1007/s10107-004-0512-0Paths and cycles in colored graphs (2005)Australasian journal of combinatorics, 31(1), 299-311. Broersma, H., Li, X., Woeginger, G. & Zhang, S.http://ajc.maths.uq.edu.au/Sports tournaments, home-away assignments, and the break minimization problem (2005)[Book/Report › Report]. University of Twente. Post, G. F. & Woeginger, G.The intractability of computing the Hamming distance (2005)Theoretical computer science, 337(1-3), 331-346. Manthey, B. & Reischuk, R.https://doi.org/10.1016/j.tcs.2005.02.002The Ramsey number of fans versus K4 (2005)Bulletin of the Institute of Combinatorics and its Applications, 43, 96-102. Surahmat, Baskoro, E. T. & Broersma, H. J.Time-dependent behaviour of an alternating service queue (2005)[Working paper › Preprint]. ArXiv.org. Vlasiou, M. & Zwart, B.Two exponential neighborhoods for single machine scheduling (2005)[Book/Report › Report]. University of Twente. Brueggemann, T. & Hurink, J. L.
2004
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture (2004)In 2004 IEEE International Conference on Field-Programmable Technology, 2004: Proceedings (pp. 421-424). IEEE. Smit, L. T., Smit, G. J. M., Hurink, J. L., Broersma, H., Paulusma, D. & Wolkotte, P. T.https://doi.org/10.1109/FPT.2004.1393315Wireless communication graphs (2004)In ISSNIP 2004: proceedings of the 2004 Intelligent Sensors, Sensor Networks & Information Processing Conference (pp. 367-372). IEEE. Nieberg, T. & Hurink, J. L.https://doi.org/10.1109/ISSNIP.2004.1417490Run-time assignment of tasks to multiple heterogeneous processors (2004)In 5th PROGRESS Symposium on Embedded Systems (pp. 185-192). STW. Smit, L. T., Smit, G. J. M., Hurink, J. L., Broersma, H. J., Paulusma, D. & Wolkotte, P. T.BER estimation for HiperLAN/2 (2004)In Personal Wireless Communications IFIP TC6 9th International Conference, PWC 2004 (pp. 164-179) (Lecture Notes in Computer Science; Vol. 3260). Springer. Smit, L. T., Smit, G. J. M., Hurink, J. L. & Rauwerda, G. K.https://doi.org/10.1007/978-3-540-30199-8_14A hybrid heuristic ordering and Variable Neighbourhood Search for the nurse rostering problem (2004)In Proceedings of The 5th international conference on the Practice and Theory of Automated Timetabling (pp. 445-446). Burke, E., Curtois, T., De Causmaecker, P., Post, G. F. & van den Berghe, G.Local, distributed topology control for large-scale wireless ad-hoc networks (2004)In International Workshop on Wireless Ad-Hoc Networks, IWWAN 2004 (pp. 79-83). Centre for Wireless Communications. Nieberg, T. & Hurink, J. L.https://doi.org/10.1109/IWWAN.2004.1525545Run-time adaptation of a reconfigurable mobile UMTS receiver (2004)In Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA04) (pp. 13-). CSREA Press. Smit, L. T., Smit, G. J. M. & Hurink, J. L.The Computational Complexity of the Minimum Weight Processor Assignment Problem (2004)In Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers (pp. 189-200) (Lecture notes in computer science; Vol. 3353). Springer. Broersma, H. J., Paulusma, D., Smit, G. J. M., Vlaardingerbroek, F. & Woeginger, G.https://doi.org/10.1007/978-3-540-30559-0_16The Ramsey numbers of paths versus kipases (2004)[Contribution to conference › Paper] 3rd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2004. Salman, M. & Broersma, H. J.https://doi.org/10.1016/j.endm.2004.03.048Modeling of capacitated transportation systems for integral scheduling (2004)OR Spectrum = OR Spektrum, 26(2), 263-282. Ebben, M., van der Heijden, M., Hurink, J. & Schutten, M.https://doi.org/10.1007/s00291-003-0154-2A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs, (2004)Journal of combinatorial mathematics and combinatorial computing (JCMCC), 49, 177-186. Salman, M., Broersma, H. J. & Rodger, C. A.A Lindley-type equation arising from a carousel problem (2004)Journal of applied probability, 41(4), 1171-1181. Vlasiou, M., Adan, I. J. B. F. & Wessels, J.https://doi.org/10.1239/jap/1101840561A PTAS for the minimum dominating set problem in unit disk graphs (2004)[Book/Report › Report]. University of Twente. Nieberg, T. & Hurink, J. L.A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs (2004)In Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004 (pp. 214-221). Article 10.1007/b104584 (Lecture Notes in Computer Science; Vol. 3353). Springer. Nieberg, T., Hurink, J. L. & Kern, W.https://doi.org/10.1007/978-3-540-30559-0_18An alternating service problem (2004)[Working paper › Preprint]. ArXiv.org. Adan, I. J. B. F. & Vlasiou, M.Clusterschemes in Dutch secondary schools (2004)[Book/Report › Report]. University of Twente. Post, G. F. & Ruizenaar, H. W. A.Clusterschemes in Dutch secondary schools (2004)[Book/Report › Report]. University of Twente. Post, G. F. & Ruizenaar, H. W. A.Energy Efficient Wireless Communication for Mobile Multimedia Terminals (2004)Radiomatics journal of communication engineering (Bandung Institute of Technology), 1(1), 49-58. Smit, L. T., Smit, G. J. M. & Hurink, J. L.http://radiomatics.ee.itb.ac.id/issues/vol1/may2004/lodewijk.htmHarmonious Personnel Scheduling (2004)In Proceeding of The 5th international conference on the Practice and Theory of Automated Timetabling (pp. 557-559). Post, G. F. & Veltman, B.Job-Shop Scheduling with Buffers (2004)In Proceedings of the Ninth International Workshop on Project Management and Scheduling (pp. 238-241). Heitmann, S., Hurink, J. L. & Nieberg, T.Job-Shop Scheduling with Limited Capacity Buffers (2004)[Book/Report › Report]. University of Osnabrück. Brucker, P., Heitmann, S., Hurink, J. & Nieberg, T.https://doi.org/10.1007/s00291-005-0008-1New lower and upper bounds for the competitive ratio of transmission protocols (2004)Information processing letters, 89(6), 297-301. Liśkiewicz, M. & Manthey, B.https://doi.org/10.1016/j.ipl.2003.12.003On Ramsey numbers for paths versus wheels (2004)[Book/Report › Report]. University of Twente. Salman, M. & Broersma, H. J.On Ramsey numbers for paths versus wheels (2004)[Book/Report › Report]. University of Twente. Salman, M. & Broersma, H. J.Parallel knock-out schemes in networks (2004)In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (pp. 204-214). Springer. Fomin, F. V., Broersma, H. J. & Woeginger, G.Path-kipas Ramsey numbers (2004)[Book/Report › Report]. University of Twente. Salman, M. & Broersma, H. J.Radio Labeling with Preassigned Frequencies (2004)SIAM journal on optimization, 15, 1-16. Bodlaender, H. L., Broersma, H. J., Fomin, F. V. & Woeginger, G.Size-Controlled Dynamic Clustering in Mobile Wireless Sensor Networks (2004)[Contribution to conference › Paper] SCS Western Multi-Conference, Workshop on Computer Networks and Distributed Systems 2004. Nieberg, T., Havinga, P. J. M. & Hurink, J. L.The hamiltonian index of a graph and its branch-bonds (2004)Discrete mathematics, 285(1-3), 279-288. Xiong, L., Broersma, H. J., Li, X. & Li, M.https://doi.org/10.1016/j.disc.2004.01.018The Ramsey numbers of large cycles versus small wheels (2004)Integers, 4. Article A10. Surahmat, Baskoro, E. T. & Broersma, H. J.http://emis.impa.br/EMIS/journals/INTEGERS/papers/e10/e10.pdf
2003
Routing of Railway Carriages (2003)Journal of global optimization, 27(2-3), 313-332. Brucker, P., Hurink, J. L. & Rolfes, T.https://doi.org/10.1023/A:1024843208074When greediness fails: examples from stochastic scheduling (2003)Operations research letters, 31(6), 413-419. Article 10.1016/S0167-6377(03)00047-6. Uetz, M. J.https://doi.org/10.1016/S0167-6377(03)00047-6BER Estimation for wireless links using BPSK/QPSK modulation (2003)In Proceedings of the 4th PROGRESS Symposium on Embedded Systems 2003 (pp. 212-219). STW. Smit, L. T., Smit, G. J. M. & Hurink, J. L.Flow-Shop Problems with Intermediate Buffers (2003)OR Spectrum = OR Spektrum, 25(4), 549-574. Brucker, P., Heitmann, S. & Hurink, J.https://doi.org/10.1007/s00291-003-0133-7Energy-Efficient Wireless Communication for Mobile Multimedia Terminals (2003)In Proceedings of The International Conference On Advances in Mobile Multimedia (MoMM2003) (pp. 115-124). Oesterreichische Computer Gesellschaft. Smit, L. T., Smit, G. J. M. & Hurink, J. L.http://www.iiwas.org/Proceedings/MoMM2003.pdfMapping Applications to a Coarse Grain Reconfigurable System (2003)In Advances in Computer Systems Architecture: 8th Asia-Pacific Conference, ACSAC 2003, Aizu-Wakamatsu, Japan, September 23-26, 2003. Proceedings (pp. 221-235) (Lecture Notes in Computer Science; Vol. 2823). Springer. Guo, Y., Smit, G. J. M., Broersma, H., Rosien, M. A. J. & Heysters, P. M.https://doi.org/10.1007/978-3-540-39864-6_18Soft Output Bit Error Rate Estimation for WCDMA (2003)In Personal Wireless Communications: IFIP-TC6 8th International Conference, PWC 2003, Venice, Italy, September 23-25, 2003, Proceedings (pp. 448-457) (Lecture Notes in Computer Science; Vol. 2775). Springer. Smit, L. T., Smit, G. J. M., Hurink, J. L. & Kokkeler, A. B. J.https://doi.org/10.1007/978-3-540-39867-7_43A Graph Covering Algorithm for a Coarse Grain Reconfigurable System (2003)In Proceedings of LCTES 2003 (pp. 199-208). Association for Computing Machinery. Guo, Y., Smit, G. J. M., Heysters, P. M. & Broersma, H. J.https://doi.org/10.1145/780732.780760Template Generation and Selection Algorithms (2003)In Proceedings of International Workshop on System-on-Chip for Real-Time Applications 2003 (pp. 2-5). IEEE. Guo, Y., Smit, G. J. M., Broersma, H. J. & Heysters, P. M.https://doi.org/10.1109/IWSOC.2003.1212995How useful are preemptive schedules? (2003)Operations research letters, 31(2), 129-136. Brucker, P., Heitmann, S. & Hurink, J. L.https://doi.org/10.1016/S0167-6377(02)00220-1Solving project scheduling problems by minimum cut computations (2003)Management science, 49(3), 330-350. Möhring, R. H., Schulz, A. S., Stork, F. & Uetz, M.https://doi.org/10.1287/mnsc.49.3.330.12737A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs (2003)[Book/Report › Report]. University of Twente. Salman, M., Broersma, H. J. & Rodger, C. A.A general framework for coloring problems: old results, new results, and open problems (2003)[Book/Report › Report]. University of Twente. Broersma, H. J.A Lindley-type equation arising from a carousel problem (2003)[Working paper › Preprint]. ArXiv.org. Vlasiou, M., Adan, I. J. B. F. & Wessels, J.A new PTAS for maximum independent sets in unit disk graphs (2003)[Book/Report › Report]. University of Twente. Nieberg, T., Hurink, J. L. & Kern, W.Backbone colorings along perfect matchings (2003)[Book/Report › Report]. University of Twente. Broersma, H. J., Fujisawa, J. & Yoshimoto, K.Backbone colorings for networks (2003)In Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003. Elspeet, The Netherlands, June 19-21, 2003. Revised Papers (pp. 131-142). Springer. Broersma, H. J., Fomin, F. V., Golovach, P. & Woeginger, G.https://doi.org/10.1007/978-3-540-39890-5_12Backbone colorings for networks: tree and path backbones (2003)[Book/Report › Report]. University of Twente. Broersma, H. J., Fomin, F. V., Golovach, P. A. & Woeginger, G.Budget balanced mechanisms for the multicast pricing problem with rates (2003)In EC '03: Proceedings of the 4th ACM Conference on Electronic Commerce (pp. 194-195). Association for Computing Machinery. Bläser, M. & Manthey, B.https://doi.org/10.1145/779928.779955Modeling of capacitated transportation systems for integral scheduling (2003)[Book/Report › Report]. University of Twente. Ebben, M. J. R., van der Heijden, M. C., Hurink, J. L. & Schutten, J. M. J.Modeling of capacitated transportation systems for integral scheduling (2003)[Working paper › Working paper]. University of Twente, Research School for Operations Management and Logistics (BETA). Ebben, M., van der Heijden, M., Hurink, J. & Schutten, M.More on spanning 2-connected subgraphs in truncated rectangular grid graphs (2003)Bulletin of the Institute of Combinatorics and its Applications, 39, 31-38. Salman, M., Baskoro, E. T., Broersma, H. J. & Rodger, C. A.More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs (2003)[Book/Report › Report]. University of Twente. Salman, M., Broersma, H. J. & Rodger, C. A.Non-approximability of weighted multiple sequence alignment (2003)Theoretical computer science, 296(1), 179-192. Manthey, B.https://doi.org/10.1016/S0304-3975(02)00439-5Path-fan Ramsey numbers (2003)[Book/Report › Report]. University of Twente. Salman, M. & Broersma, H. J.Personnel Scheduling in Laboratories (2003)In Practice and Theory of Automated Timetabling IV: 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002. Selected Revised Papers (pp. 113-119) (Lecture Notes in Computer Science ; Vol. 2740). Franses, P. & Post, G. F.https://doi.org/10.1007/978-3-540-45157-0_7Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult (2003)[Book/Report › Report]. University of Twente. Broersma, H. J., Fomin, F. V., Kratochvil, J. & Woeginger, G.The computational power of compiling C++ (2003)Bulletin of the European Association for Theoretical Computer Science, 81, 264-270. Böhme, M. & Manthey, B.http://www.eatcs.org/images/bulletin/beatcs81.pdfThroughput analysis of two carousels (2003)[Book/Report › Report]. EURANDOM. Vlasiou, M., Adan, I. J. B. F., Boxma, O. J. & Wessels, J.
2002
Improved approximation algorithms for Max-2SAT with cardinality constraint (2002)In Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings (pp. 187-198) (Lecture Notes in Computer Science; Vol. 2518). Springer. Bläser, M. & Manthey, B.https://doi.org/10.1007/3-540-36136-7_17Cycles in weighted graphs and related topics (2002)[Thesis › PhD Thesis - Research UT, graduation UT]. Twente University Press (TUP). Zhang, S.Run-Time Control For Software Defined Radio (2002)In 3rd PROGRESS workshop on Embedded Systems (pp. 218-223). STW. Smit, L. T., Smit, G. J. M., Havinga, P. J. M., Hurink, J. L. & Broersma, H.Leader Election Protocol for Energy Efficient Mobile Sensor Networks (EYES) (2002)[Book/Report › Report]. Centre for Telematics and Information Technology (CTIT). Dulman, S., Havinga, P. & Hurink, J.More Progress on Tough Graphs - The Y2K Report (2002)Electronic notes in discrete mathematics, 11, 63-80. Bauer, D., Broersma, H. & Schmeichel, E.https://doi.org/10.1016/S1571-0653(04)00055-1A tabu search algorithm for scheduling a single robot in a job-shop environment (2002)Discrete applied mathematics, 119(1-2), 181-203. Hurink, J. L. & Knust, S.https://doi.org/10.1016/S0166-218X(01)00273-6Influences of RAKE Receiver/Turbo Decoder Parameters on Energy Consumption and Quality (2002)In 2002 International Conference On Third Generation Wireless and Beyond (pp. 175-180). Delson Group. Smit, L. T., Smit, G. J. M., Havinga, P. J. M., Hurink, J. L. & Broersma, H. J.http://www.delson.org/wwc02/A fan type condition for heavy cycles in weighted graphs (2002)Graphs and combinatorics, 18(1), 193-200. Zhang, S., Broersma, H. J., Li, X. & Wang, L.https://doi.org/10.1007/s003730200012A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (2002)Algorithmica, 32(4), 594-610. Broersma, H. J., Kloks, T., Kratsch, D. & Müller, H.https://doi.org/10.1007/s00453-001-0091-xA note on minimum degree conditions for supereulerian graphs (2002)Discrete applied mathematics, 120(1-3), 35-43. Broersma, H. J. & Xiong, L.https://doi.org/10.1016/S0166-218X(01)00278-5A polynomial algorithm for $P | p_j = 1, r_j, outtree | \Sigma C_j$ (2002)Mathematical methods of operations research, 56(3), 407-412. Brucker, P., Hurink, J. L. & Knust, S.https://doi.org/10.1007/s001860200228Degree sums and subpancyclicity in line graphs (2002)Discrete mathematics, 242(1-3), 255-267. Xiong, L., Broersma, H. J., Hoede, C. & Li, X.https://doi.org/10.1016/S0012-365X(00)00468-4Flow-shop problems with intermediate buffers (2002)[Book/Report › Report]. University of Twente. Brucker, P., Heitmann, S. & Hurink, J. L.Forbidden subgraphs that imply hamiltonian-connectedness (2002)Journal of graph theory, 40(2), 104-119. Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J.https://doi.org/10.1002/jgt.10034Foreword to the Special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization (2002)Discrete applied mathematics, 120(1-3), 1. Faigle, U., Broersma, H. J. & Hurink, J. L.https://doi.org/10.1016/S0166-218X(01)00274-8Global connectivity and expansion: long cycles and factors in f-connected graphs (2002)[Book/Report › Report]. University of Twente. Brandt, S., Broersma, H., Diestel, R. & Kriesell, M.https://preprint.math.uni-hamburg.de/public/papers/hbm/hbm2002152.pdfGrafen in de praktijk (2002)[Book/Report › Book]. Epsilon. Broersma, H. J.Heavy cycles in weighted graphs (2002)Discussiones mathematicae. Graph theory, 22(1), 7-15. Bondy, J. A., Broersma, H. J., van den Heuvel, J. & Veldman, H. J.https://doi.org/10.7151/dmgt.1154Influences of Rake receiver/TURBO decoder parameters on energy consumption and Quality (2002)In Proceedings World Wireless Congress (pp. 175-181). Delson group Inc. Smit, L. T., Smit, G. J. M., Hurink, J. L. & Broersma, H. J.Isomorphisms and traversability of directed path graphs (2002)Discussiones mathematicae. Graph theory, 22(2), 215-228. Broersma, H. & Li, X.https://doi.org/10.7151/dmgt.1170More about subcolorings (2002)[Book/Report › Report]. University of Twente. Broersma, H. J., Fomin, F. V., Nešetřil, J. & Woeginger, G.More about subcolorings (2002)Computing, 69(3), 187-203. Broersma, H. J., Fomin, F. V., Nesetril, J. & Woeginger, G.https://doi.org/10.1007/s00607-002-1461-1More on spanning 2-connected subgraphs in truncated rectangular grid graphs (2002)[Book/Report › Report]. University of Twente. Salman, M., Baskoro, E. T. & Broersma, H. J.On some intriguing problems in hamiltonian graph theory - a survey (2002)Discrete mathematics, 251(1-3), 47-69. Broersma, H. J.https://doi.org/10.1016/S0012-365X(01)00325-9On stability of the Hamiltonian index under contractions and closures (2002)[Book/Report › Report]. University of Twente. Xiong, L., Ryjáček, Z. & Broersma, H. J.On the structure of graded transitive Lie algebras (2002)Journal of lie theory, 12, 265-288. Post, G. F.https://www.emis.de/journals/JLT/vol.12_no.1/14.htmlPersonnel scheduling in laboratories using IPS (2002)[Contribution to conference › Paper] 4th International Conference on Practice and Theory of Automated Timetabling, PATAT 2002. Franses, P. & Post, G. F.Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous (2002)In Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (pp. 160-169) (Lecture notes in computer science; Vol. 2368). Springer. Broersma, H. J., Fomin, F. V., Kratochvíl, J. & Woeginger, G.https://doi.org/10.1007/3-540-45471-3_17Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (2002)Discrete applied mathematics, 120(1-3), 13-23. Bauer, D., Broersma, H. J., Morgana, A. & Schmeichel, E.https://doi.org/10.1016/S0166-218X(01)00276-1Radio labeling with pre-assigned frequencies (2002)[Book/Report › Report]. University of Twente. Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. V. & Woeginger, G. J.Radio Labeling with Pre-assigned Frequencies (2002)In Algorithms — ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings (pp. 211-222) (Lecture Notes in Computer Science; Vol. 2461). Springer. Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. & Woeginger, G.https://doi.org/10.1007/3-540-45749-6_22Run-Time adaptivity for Software Defined Radio (2002)In Proceedings 3rd workshop on Embedded Systems (pp. 218-224). Smit, L. T., Smit, G. J. M., Hurink, J. L. & Broersma, H. J.Some approaches to a conjecture on short cycles in digraphs (2002)Discrete applied mathematics, 120(1-3), 45-93. Broersma, H. J. & Li, X.https://doi.org/10.1016/S0166-218X(01)00279-7Spanning 2-connected subgraphs in truncated rectangular grid graphs (2002)[Book/Report › Report]. University of Twente. Salman, A. N. M., Baskoro, E. T. & Broersma, H. J.Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs (2002)[Book/Report › Report]. University of Twente. Salman, M., Baskoro, E. T. & Broersma, H. J.Stars and bunches in planar graphs. Part I: Triangulations (2002)[Book/Report › Report]. University of Twente. Borodin, O. V., Broersma, H. J., Glebov, A. & van den Heuvel, J.Stars and bunches in planar graphs. Part II: General planar graphs and colourings (2002)[Book/Report › Report]. University of Twente. Borodin, O. V., Broersma, H. J., Glebov, A. & van den Heuvel, J.Symmetries of the WDVV equations (2002)Acta applicandae mathematicae, 72(1-2), 67-75. Geurts, M. L., Martini, R. & Post, G. F.https://doi.org/10.1023/A:1015270407947The Ramsey numbers of large cycles versus small wheels (2002)[Book/Report › Report]. University of Twente. Surahmat, Baskoro, E. T. & Broersma, H. J.The Ramsey numbers of large star-like trees versus large odd wheels (2002)[Book/Report › Report]. University of Twente. Surahmat, Baskoro, E. T. & Broersma, H. J.Two approximation algorithms for 3-cycle covers (2002)In Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002 Rome, Italy, September 17–21, 2002 Proceedings (pp. 40-50) (Lecture Notes in Computer Science; Vol. 2462). Springer. Bläser, M. & Manthey, B.https://doi.org/10.1007/3-540-45753-4_6Wave Leader Election Protocol for Wireless Sensor Networks (2002)In 3rd International Symposium on Mobile Multimedia Systems & Applications (pp. 43-51). Dulman, S. O. & Hurink, J. L.
2001
List scheduling in a parallel machine environment with precedence constraints and setup times (2001)Operations research letters, 29(5), 231-239. Hurink, J. L. & Knust, S.https://doi.org/10.1016/S0167-6377(01)00104-3Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (2001)Discrete applied mathematics, 112(1-3), 179-197. Hurink, J. L. & Keuchel, J.https://doi.org/10.1016/S0166-218X(00)00315-2Makespan minimization for flow-shop problems with transportation times and a single robot (2001)Discrete applied mathematics, 112(1-3), 199-216. Hurink, J. L. & Knust, S.https://doi.org/10.1016/S0166-218X(00)00316-4Circuits in graphs and the Hamiltonian index (2001)[Thesis › PhD Thesis - Research UT, graduation UT]. Twente University Press (TUP). Xiong, L.On project scheduling with irregular starting time costs (2001)Operations research letters, 28(4), 149-154. Möhring, R. H., Schulz, A. S., Stork, F. & Uetz, M.https://doi.org/10.1016/S0167-6377(01)00064-5A 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$ (2001)[Book/Report › Report]. University of Twente. Brucker, P., Hurink, J. L. & Knust, S.A structural theorem on planar triangulations in terms of bunches and stars (2001)Discrete analysis and operations research, 8(2), 15-39. Borodin, O. V., Broersma, H. J., Glebov, A. S. & van den Heuvel, J.http://www.math.nsc.ru/publishing/DAOR/engl/arch.htmlA σ3 type condition for heavy cycles in weighted graphs (2001)Discussiones mathematicae. Graph theory, 21(2), 159-166. Zhang, S., Li, X. & Broersma, H.https://doi.org/10.7151/dmgt.1140Distant-2-colouring in planar graphs (2001)Discrete analysis and operations research, 8(4), 9-33. Borodin, O. V., Broersma, H. J., Glebov, A. S. & van den Heuvel, J.http://www.math.nsc.ru/publishing/DAOR/engl/arch.htmlHow useful are preemptive schedules? (2001)[Book/Report › Report]. University of Twente. Brucker, P., Heitmann, S. & Hurink, J. L.On factors of 4-connected claw-free graphs (2001)Journal of graph theory, 37(2), 125-136. Broersma, H. J., Kriesell, M., Kriesell, M. & Ryjacek, Z.https://doi.org/10.1002/jgt.1008On the structure of transitively differential algebras (2001)Journal of lie theory, 11, 111-128. Post, G. F.Paths and cycles in colored graphs (2001)In 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization: 31 December 200105-31 December 200107 • Cologne, Germany (pp. 128-132) (Electronic Notes in Discrete Mathematics; Vol. 8). Elsevier. Li, X., Zhang, S. & Broersma, H.https://doi.org/10.1016/S1571-0653(05)80098-8Preface. Volume 8 (2001)Electronic notes in discrete mathematics, 8. Broersma, H., Faigle, U., Hurink, J. & Pickl, S.https://doi.org/10.1016/S1571-0653(05)80063-0Problem 10899 (2001)American mathematical monthly, 108(8), 771-771. Martini, R. & Post, G. F.http://www.jstor.org/stable/2695631Sample testing with vitalab flexor (2001)In Proceedings of the thirty-ninth european study group with industry (pp. 21-33). Shaker Publishing. Baas, S. & Hurink, J. L.Strengthening the closure concept in claw-free graphs (2001)Discrete mathematics, 233(1-3), 55-63. Broersma, H. J. & Ryjacek, Z.https://doi.org/10.1016/S0012-365X(00)00226-0Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path (2001)[Book/Report › Report]. University of Twente. Xiong, L., Broersma, H. J. & Hoede, C.Tabu search algorithms for job-shop problems with a single transport robot (2001)[Book/Report › Report]. University of Twente. Hurink, J. L. & Knust, S.The Hamiltonian index of a graph and its branch-bonds (2001)[Book/Report › Report]. University of Twente. Xiong, L., Broersma, H. J. & Li, X.The norm of an averaging operator (2001)[Book/Report › Report]. Meetkundig en toegepast-algebraisch onderzoek. Martini, R. & Post, G. F.Toughness and hamiltonicity in $k$-trees (2001)[Book/Report › Report]. University of Twente. Broersma, H. J., Xiong, L. & Yoshimoto, K.Versal deformation of the Lie algebra L_2 (2001)Journal of algebra, 236(1), 93-109. Post, G. F. & Fialowski, A.https://doi.org/10.1006/jabr.2000.8502
2000
Cache as ca$h can (2000)In Proceedings of the 36th European Study Group with Industry (ESGI36): Eindhoven, The Netherlands, 15-19 November 1999 (pp. 41-53) (EUT-Report). Eindhoven University of Technology. Grootjans, W. J., Hochstenbach, M., Hurink, J., Kern, W., Luczak, M., Puite, Q., Resing, J. A. C. & Spieksma, F. C. R.A $\sigma_3$ type condition for heavy cycles in weighted graphs (2000)[Book/Report › Report]. University of Twente. Broersma, H. J., Zhang, S., Li, X. & Li, X.A fan type condition for heavy cycles in weighted graphs (2000)[Book/Report › Report]. University of Twente. Broersma, H., Zhang, S., Li, X. & Wang, L.A linear time algorithm for minimum fill-in and treewidth for distance heredity graphs (2000)Discrete applied mathematics, 99(1-3), 367-400. Broersma, H. J., Dahlhaus, E., Kloks, A. J. J. & Kloks, T.https://doi.org/10.1016/S0166-218X(99)00146-8Cache as ca$h can (2000)[Book/Report › Report]. University of Twente. Grootjans, W. J., Hochstenbach, M., Hurink, J. L., Kern, W., Luczak, M., Puite, Q., Resing, J. & Spieksma, F.Closure Concepts: A Survey (2000)Graphs and combinatorics, 16, 17-48. Broersma, H., Ryjácek, Z. & Schiermeyer, I.https://doi.org/10.1007/s003730050002Degree-preserving trees (2000)Networks, 35(1), 26-39. Broersma, H. J., Kloks, A. J. J., Koppius, O., Tuinstra, H., Huck, A., Kloks, T., Kratsch, D. & Müller, H.https://doi.org/10.1002/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-MDirected paths with few or many colors in colored directed graphs (2000)[Book/Report › Report]. University of Twente. Li, X., Zhang, S. & Broersma, H. J.Heavy paths and cycles in weighted graphs (2000)Discrete mathematics, 223(1-3), 327-336. Zhang, S., Li, X. & Broersma, H.https://doi.org/10.1016/S0012-365X(99)00413-6List scheduling in a parallel machine environment with precedence constraints and setup times (2000)[Book/Report › Report]. University of Twente. Hurink, J. L. & Knust, S.List scheduling in a parallel machine environment with precedence constraints and setup times (2000)[Book/Report › Report]. University of Twente. Hurink, J. L. & Knust, S.More progress on tough graphs -- The Y2K report (2000)[Book/Report › Report]. University of Twente. Bauer, D., Broersma, H. J. & Schmeichel, E.Not every 2-tough graph is hamiltonian (2000)Discrete applied mathematics, 2000(99), 317-321. Broersma, H. J., Bauer, D. & Veldman, H. J.https://doi.org/10.1016/S0166-218X(99)00141-9On the structure of graded transitive Lie algebras (2000)[Book/Report › Report]. University of Twente. Post, G. F.On the structure of graded transitive Lie algebras (2000)[Book/Report › Report]. University of Twente. Post, G. F.Scheduling split-jobs on parallel machines (2000)[Book/Report › Report]. University of Twente. Hurink, J. L., Kern, W. & Nawijn, W. M.Scheduling split-jobs on parallel machines (2000)[Book/Report › Report]. University of Twente. Hurink, J. L., Kern, W. & Nawijn, W. M.Solving a chemical batch scheduling problem by local search (2000)Annals of operations research, 96(1-4), 17-38. Article 10.1023/A:1018959704264. Brucker, P. & Hurink, J. L.https://doi.org/10.1023/A:1018959704264Solving a chemical batch scheduling problem by local search (2000)Annals of operations research, 2000(96), 17-38. Hurink, J. L. & Brucker, P.Strengthening the closure concept in claw-free graphs (2000)[Book/Report › Report]. University of Twente. Broersma, H. J. & Ryjacek, Z.
1999
Approximation in stochastic scheduling: the power of LP-based priority policies (1999)Journal of the Association for Computing Machinery, 46(6), 924-942. Möhring, R. H., Schulz, A. S. & Uetz, M.https://doi.org/10.1145/331524.331530An exponential neighbourhood for a one-machine batching problem (1999)OR Spectrum = OR Spektrum, 21(4), 461-476. Hurink, J.https://doi.org/10.1007/s002910050098Scheduling identical jobs with chain precedence constraints on two uniform machines (1999)Mathematical methods of operations research, 49(2), 211-219. Article 10.1007/s001860050021. Brucker, P., Hurink, J. L. & Kubiak, W.https://doi.org/10.1007/s0018600500216th Twente Workshop on Graphs and Combinatorial Optimization (1999)[Book/Report › Book] 6th Twente Workshop on Graphs and Combinatorial Optimization 1998. Elsevier. Broersma, H. J., Faigle, U., Hoede, C. & Hurink, J. L.https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/3/suppl/CA branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (1999)Discrete applied mathematics(94), 77-99. Brucker, P., Hilbig, T. & Hurink, J. L.https://doi.org/10.1016/S0166-218X(99)00015-3A note on a conjecture concerning tree-partitioning 3-regular graphs (1999)Tatra mountains mathematical publications(18), 15-21. Bohme, T., Broersma, H. J. & Tuinstra, H.A tabu search algorithm for scheduling a single robot in a job-shop environment (1999)[Book/Report › Report]. University of Twente. Hurink, J. L. & Knust, S.Another equivalent of the graceful tree conjecture (1999)Ars combinatoria(51), 183-192. Broersma, H. J. & Hoede, C.Forbidden subgraphs that imply Hamiltonian-connectedness (1999)[Book/Report › Report]. University of Twente. Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J.Forbidden subgraphs that imply Hamiltonian-connectedness (1999)[Book/Report › Report]. University of Twente. Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J.Independent sets in asteroidal triple-free graphs (1999)SIAM journal on discrete mathematics, 12(2), 276-287. Broersma, H., Kloks, T., Kratsch, D. & Müller, H.https://doi.org/10.1137/S0895480197326346On factors of 4-connected claw-free graphs (1999)[Book/Report › Report]. University of Twente. Broersma, H. J., Kriesell, M., Kriesell, M. & Ryjacek, Z.On minimum degree conditions for supereulerian graphs (1999)[Book/Report › Report]. University of Twente. Broersma, H. J. & Xiong, L.On some intriguing problems in Hamiltonian graph theory -- A survey (1999)[Book/Report › Report]. University of Twente. Broersma, H. J.On some intriguing problems in Hamiltonian graph theory -- A survey (1999)[Book/Report › Report]. University of Twente. Broersma, H. J.On the structure of transitively differential algebras (1999)[Book/Report › Report]. University of Twente. Post, G. F.On the structure of transitively differential algebras (1999)[Book/Report › Report]. University of Twente. Post, G. F.Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (1999)[Book/Report › Report]. University of Twente. Bauer, D., Broersma, H. J., Morgana, A. & Schmeichel, E.Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems (1999)In Algorithms - ESA’ 99: 7th Annual European Symposium Prague, Czech Republic, July 16–18, 1999 Proceedings (pp. 139-150) (Lecture Notes in Computer Science; Vol. 1643). Springer. Möhring, R. H., Schulz, A. S., Stork, F. & Uetz, M.https://doi.org/10.1007/3-540-48481-7_13Routing of railway carriages: A case study (1999)[Book/Report › Report]. University of Twente. Brucker, P., Hurink, J. L. & Rolfes, T.Scheduling Identical Jobs with Chain Precedences on Two Uniform Machines (1999)Mathematical methods of operations research(49), 211-219. Brucker, P., Hurink, J. L. & Kubiak, W.Solving a chemical batch scheduling problem by local search (1999)[Book/Report › Report]. University of Twente. Brucker, P. & Hurink, J. L.Solving a chemical batch scheduling problem by local search (1999)[Book/Report › Report]. University of Twente. Brucker, P. & Hurink, J. L.Stochastic machine scheduling: Performance guarantees for LP-based priority policies: (Extended abstract) (1999)In Randomization, Approximation, and Combinatorial Optimization: Algorithms and Techniques - 3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999, Proceedings (pp. 144-155) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1671). Springer. Möhring, R. H., Schulz, A. S. & Uetz, M.https://doi.org/10.1007/978-3-540-48413-4_16Throughput of ADSL modems (1999)[Book/Report › Report]. University of Twente. Broersma, H. J., Bruin, N., Hurink, J. L., Meester, L. E., op de Beek, S. S. & Westhuis, J. H.Throughput of ADSL modems (1999)CWI quarterly(46), 11-26. Broersma, H. J., Bruin, N., Hurink, J. L., Meester, L. E., op de Beek, S. S. & Westhuis, J. H.Throughput of ADSL modems (1999)[Book/Report › Report]. University of Twente. Broersma, H. J., Bruin, N., Hurink, J. L., Meester, L. E., op de Beek, S. S., Westhuis, J. & Westhuis, J. H.Various results on the toughness of graphs (1999)Networks, 33(33), 233-238. Broersma, H. J., Engbers, E. & Trommel, H.http://www3.interscience.wiley.com/journal/55004197/abstractVersal deformation of the Lie algebra $L_2$ (1999)[Book/Report › Report]. University of Twente. Fialowski, A. & Post, G. F.Versal deformation of the Lie algebra L_2 (1999)[Book/Report › Report]. University of Twente. Fialowski, A. & Post, G. F.
1998
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking (1998)In Graph-Theoretic Concepts in Computer Science: 24th International Workshop, WG’98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings (pp. 88-99) (Lecture notes in computer science; Vol. 1517). Springer. Broersma, H., Kloks, T., Kratsch, D. & Müller, H.https://doi.org/10.1007/10692760_8A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (1998)[Book/Report › Report]. Charles University. Broersma, H. J., Kloks, T., Kratsch, D. & Müller, H.A note on a conjecture concerning tree-partitioning 3-regular graphs (1998)[Book/Report › Report]. University of Twente. Bohme, T., Bohme, T., Broersma, H. J. & Tuinstra, H.A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (1998)Journal of scheduling, 1(3), 127-148. Hurink, J.https://doi.org/10.1002/(SICI)1099-1425(1998100)1:3<127::AID-JOS11>3.0.CO;2-9An exponential neighbourhood for a one-machine batching problem (1998)[Book/Report › Report]. University of Twente. Hurink, J. L.Closure concepts - a survey (1998)[Book/Report › Report]. Zapadoceska Univerzita. Broersma, H., Ryjácek, Z. & Schiermeyer, I.Closure concepts for claw-free graphs (1998)Discrete mathematics, 185(185), 231-238. Broersma, H. J. & Trommel, H.https://doi.org/10.1016/S0012-365X(97)00210-0Degree-preserving forests (1998)[Book/Report › Report]. Charles University. Broersma, H. J., Huck, A., Kloks, A. J. J., Koppius, O., Kratsch, D., Müller, H. C. & Tuinstra, H.Degree-preserving forests (1998)In Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98 Brno, Czech Republic, August 24–28, 1998, Proceedings (pp. 713-721) (Lecture Notes in Computer Science; Vol. 1450). Springer. Broersma, H., Huck, A., Kloks, T., Koppius, O., Kratsch, D., Müller, H. & Tuinstra, H.https://doi.org/10.1007/BFb0055822Explicit Bracketinan exceptional simple Lie Superalgebra (1998)International journal of algebra and computation, 8(4), 479-495. Shchepochkina, I. & Post, G. F.Flow-Shop Problems with Transportation Times and a Single Robot (1998)[Book/Report › Report]. Fachbereich Mathematik/Informatik. Hurink, J. L.Heavy paths and cycles in weighted graphs (1998)[Book/Report › Report]. University of Twente. Zhang, S., Li, X. & Broersma, H. J.Independence Trees and Hamilton Cycles (1998)Journal of graph theory, 29(29), 227-237. Broersma, H. J. & Tuinstra, H.https://doi.org/10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-WIsomorphisms and traversability of directed path graphs (1998)[Book/Report › Report]. University of Twente. Broersma, H. J., Li, X. & Li, X.Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (1998)[Book/Report › Report]. University of Twente. Hurink, J. L. & Keuchel, J.Routing of Railway Carriages (1998)[Book/Report › Report]. University of Osnabrück. Brucker, P., Hurink, J. L. & Rolfes, T.Some approaches to a conjecture on short cycles in digraphs (1998)[Book/Report › Report]. University of Twente. Broersma, H. J., Li, X. & Li, X.Symmetries of the WDVV equations and Chazy-type equations (1998)[Book/Report › Report]. University of Twente. Martini, R. & Post, G. F.
1997
A Branch and Bound Method for the Open Shop Problem (1997)Discrete applied mathematics, 76(1-3), 43-59. Brucker, P., Hurink, J. L., Jurisch, B. & Wöstmann, B.https://doi.org/10.1016/S0166-218X(96)00116-3Dirac's minimum degree condition restricted to claws (1997)Discrete mathematics, 167-168, 155-166. Broersma, H. J., Ryjacek, Z. & Schiermeyer, I.https://doi.org/10.1016/S0012-365X(96)00224-5Differential Calculi on Universal Enveloping Algebras (1997)In Proceedings of the Quantum Group Symposium at the XXI International Colloquium on Group Theoretical Methods in Physics, Goslar, 1996, Eds. H.D. Doebner & V.K. Dobrev (pp. 260-266). Martini, R. & Post, G. F.Improving local search heuristics for some scheduling problems. Part II (1997)Discrete applied mathematics, 72(1-2), 47-69. Brucker, P., Hurink, J. L. & Werner, F.https://doi.org/10.1016/S0166-218X(96)00036-4A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (1997)[Book/Report › Report]. University of Twente. Broersma, H., Kloks, T., Kratsch, D. & Müller, H.A note on the minimum size of a vertex pancyclic graph (1997)Discrete mathematics, 164(164), 29-32. Broersma, H. J.https://doi.org/10.1016/S0012-365X(96)00040-4Algorithms for the treewidth and minimum fill-in of HHD-free graphs (1997)In Graph-Theoretic Concepts in Computer Science (pp. 109-117) (Lecture notes in computer science; Vol. 1335). Springer. Broersma, H. J., Dahlhaus, E., Kloks, A. J. J. & Kloks, T.https://doi.org/10.1007/BFb0024492Cycles through subsets with large degree sums (1997)Discrete mathematics, 171, 43-54. Broersma, H. J., Li, H., Li, J., Tian, F. & Veldman, H. J.https://doi.org/10.1016/S0012-365X(96)00071-4Explicit bracket in the exceptional simple Lie superalgebra cvect(0/3)* (1997)[Book/Report › Report]. University of Twente. Shchepochkina, I. & Post, G. F.Independent sets in asteroidal triple-free graphs (1997)In Automata, Languages and Programming: 24th International Colloquium, ICALP '97 Bologna, Italy, July 7–11, 1997, Proceedings (pp. 760-770) (Lecture notes in computer science; Vol. 1256). Springer. Broersma, H., Kloks, T., Kratsch, D. & Müller, H.https://doi.org/10.1007/3-540-63165-8_229Not every 2-tough graph is Hamiltonian (1997)[Book/Report › Report]. University of Twente. Bauer, D., Broersma, H. J. & Veldman, H. J.Polynomial solutions to the WDVV equations in four dimensions (1997)Journal of physics A: mathematical and theoretical, 30(8), L229-L232. Martini, R. & Post, G. F.https://doi.org/10.1088/0305-4470/30/8/005Spanning trees with many or few colors in edge-colored graphs (1997)Discussiones mathematicae. Graph theory, 17(2), 259-270. Broersma, H. & Li, X.https://doi.org/10.7151/dmgt.1053Spanning trees with pairwise nonadjacent endvertices (1997)Discrete mathematics, 170(170), 219-222. Böhme, T., Bohme, T., Broersma, H. J., Gobel, F., Kostochka, A. V. & Stiebitz, M.https://doi.org/10.1016/S0012-365X(96)00306-8Various results on the toughness of graphs (1997)[Book/Report › Report]. University of Twente. Broersma, H. J., Engbers, E. A. & Trommel, H.
1996
Polygon scheduling (1996)Discrete applied mathematics, 70(1), 37-55. Hurink, J. L.https://doi.org/10.1016/0166-218X(95)00100-6The connectivity of the leaf-exchange spanning tree graph of a graph (1996)Ars combinatoria, 43, 225-231. Broersma, H. & Li, X.Improving local search heuristics for some scheduling problems -- I (1996)Discrete applied mathematics, 65(1-3), 97-122. Brucker, P., Hurink, J. L. & Werner, F.https://doi.org/10.1016/0166-218X(95)00030-UA manual for the package tools 2-1 (1996)[Book/Report › Report]. University of Twente. Post, G. F.Algorithms for the treewidth and minimum fill-in of HHD-free graphs (1996)[Book/Report › Report]. University of Twente. Broersma, H. J., Dahlhaus, E. & Kloks, A. J. J.Complex Sequencing Problems and Local Search Heuristics (1996)In Meta-Heuristics: Theory and Applications (pp. 151-166). Kluwer Academic Publishers. Brucker, P. & Hurink, J. L.Deformations of Quantum Hyperplanes (1996)Letters in mathematical physics, 36(36), 106-116. Post, G. F.https://doi.org/10.1007/BF00714374Directed path graphs (1996)[Book/Report › Report]. University of Twente. Broersma, H. & Li, X.EIDMA Workshop on Hamiltonicity of 2-tough graphs: Progress Report (1996)[Book/Report › Report]. University of Twente. Bondy, J. A., Broersma, H. J., Hoede, C. & Veldman, H. J.glλ) and differential operators preserving polynomials (1996)Acta applicandae mathematicae, 44(44), 257-268. Post, G. & van den Hijligenberg, N.https://doi.org/10.1007/BF00116524Hamiltonicity of regular 2-connected graphs (1996)Journal of graph theory, 22(2), 105-124. Broersma, H. J., van den Heuvel, J. P. M., Jackson, B. & Veldman, H. J.https://doi.org/10.1002/(SICI)1097-0118(199606)22:2<105::AID-JGT2>3.0.CO;2-RIndependence trees and Hamilton cycles (1996)[Book/Report › Report]. University of Twente. Broersma, H. J. & Tuinstra, H.Independent sets in asteroidal triple-free graphs (1996)[Book/Report › Report]. University of Twente. Broersma, H., Kloks, T., Kratsch, D. & Muller, H.On graphs satisfying a local Ore-type condition (1996)Journal of graph theory, 21(21), 1-10. Asratian, A. S., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<1::AID-JGT1>3.0.CO;2-WQuantization of differential calculi on universal enveloping algebras (1996)Journal of mathematical physics, 37, 4166-4175. van den Hijligenberg, N., Martini, R. & Post, G. F.https://doi.org/10.1063/1.531592Some notes on closure concepts for claw-free graphs (1996)[Book/Report › Report]. University of Twente. Broersma, H. J. & Trommel, H.The package BRANCH EQUATIONS for REDUCE (1996)[Book/Report › Report]. University of Twente. Post, G. F.The package LOCAL SOLVABILITY for REDUCE (1996)[Book/Report › Report]. University of Twente. Post, G. F.Toughness and Hamiltonicity in almost claw-free graphs (1996)Journal of graph theory, 21(4), 431-439. Broersma, H. J., Ryjacek, Z. & Schiermeyer, I.https://doi.org/10.1002/(SICI)1097-0118(199604)21:4<431::AID-JGT9>3.0.CO;2-QToughness and longest cycles in 2-connected planar graphs (1996)Journal of graph theory, 23(3), 257-263. Bohme, T., Broersma, H. J. & Veldman, H. J.https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-RUnifying results on Hamiltonian Claw-Free graphs (1996)Tatra mountains mathematical publications, 9, 31-39. Broersma, H. J., Ryjácek, Z. & Schiermeyer, I.
1995
A note on spanning trees with pairwise nonadjacent end-vertices (1995)[Book/Report › Report]. University of Twente. Bohme, T., Broersma, H. J., Gobel, F., Kostochka, A. V. & Stiebitz, M.Bipartite regular graphs with fixed diameter (1995)Networks, 26(26), 139-144. Broersma, H. J. & Gobel, F.https://doi.org/10.1002/net.3230260303Classification of generalized A-graded algebras with 3 generators (1995)Academie des Sciences. Comptes Rendus. Mathematique, 119(3), 267-287. Korkina, E. I., Post, G. F. & Roelofs, M.Classification of linear differential operators with an invariant subspace of monomials (1995)Russian journal of mathematical physics(3), 113-122. Post, G. F. & Turbiner, A.Computation by Computer of Lie superalgebra Homology and Cohomology (1995)Acta applicandae mathematicae(41), 123-134. van den Hijligenberg, N. W. & Post, G. F.Cycles through particular subgraphs of claw-free graphs (1995)Journal of graph theory, 20(20), 459-465. Broersma, H. J. & Lu, M.https://doi.org/10.1002/jgt.3190200409Deformations of vector fields and Hamiltonian vector fields on the plane (1995)Mathematics of computation, 64(211), 1215-1226. van den Hijligenberg, N., Kotchetkov, Y. & Post, G. F.https://doi.org/10.1090/S0025-5718-1995-1297480-5Differential calculi on universal enveloping algebras of Lie algebras (1995)[Book/Report › Report]. University of Twente. Martini, R., Post, G. F. & Kersten, P. H. M.Dirac's minimum degree condition restricted to claws (1995)[Book/Report › Report]. University of Twente. Broersma, H. J., Ryjácek, Z. & Schiermeyer, I.Heavy cycles in weighted graphs (1995)[Book/Report › Report]. University of Twente. Bondy, J. A., Broersma, H. J., van den Heuvel, J. & Veldman, H. J.Long cycles in graphs with prescribed toughness and minimum degree (1995)Discrete mathematics, 141(141), 1-10. Bauer, D., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.https://doi.org/10.1016/0012-365X(93)E0204-HOn generalizing a theorem of Jung (1995)Ars combinatoria(40), 207-218. Bauer, D., Broersma, H. J. & Veldman, H. J.Spanning trees with many or few colors in edge-colored graphs (1995)[Book/Report › Report]. University of Twente. Broersma, H. J. & Li, X.Toughness and longest cycles in 2-connected planar graphs (1995)[Book/Report › Report]. University of Twente. Bohme, T., Broersma, H. J. & Veldman, H. J.
1994
Tabu search for the job-shop scheduling problem with multi-purpose machines (1994)OR Spectrum = OR Spektrum, 15(4), 205-215. Hurink, J., Jurisch, B. & Thole, M.https://doi.org/10.1007/BF01719451A class of graded Lie algebras of vector fields and first order differential operators (1994)Journal of mathematical physics, 35(12), 68-38-68-56. Post, G. F.A closure concept based on neighborhood unions of independent triples (1994)Discrete mathematics, 124(1-3), 37-47. Broersma, H. J. & Schiermeyer, I.https://doi.org/10.1016/0012-365X(92)00049-WA note on the minimum size of a vertex pancyclic graph (1994)[Book/Report › Report]. University of Twente. Broersma, H. J.Bipartite regular graphs with fixed diameter (1994)[Book/Report › Report]. University of Twente. Broersma, H. J. & Gobel, F.Cycles through subsets with large degree sums (1994)[Book/Report › Report]. University of Twente. Broersma, H., Li, H., Li, J., Tian, F. & Veldman, H. J.Hamiltonicity of regular 2-connected graphs (1994)[Book/Report › Report]. University of Twente. Broersma, H. J., van den Heuvel, J. P. M., Jackson, B. & Veldman, H. J.On hamiltonian properties of 2-tough graphs (1994)Journal of graph theory, 18, 539-543. Bauer, D., Broersma, H. J., van den Heuvel, J. & Veldman, H. J.https://doi.org/10.1002/jgt.3190180602Operator identities, representations of algebras and the problem of normal ordering (1994)Journal of physics A: mathematical and theoretical(27), 9-13. Turbiner, A. & Post, G. F.Subgraphs, Closures and Hamiltonicity (1994)Discrete applied mathematics, 51(1-2), 39-46. Broersma, H. J. & Schiermeyer, I.https://doi.org/10.1016/0166-218X(94)90092-2The geometry of differential difference equations (1994)Indagationes mathematicae, 5(4), 411-438. Helminck, G. F. & Post, G. F.https://doi.org/10.1016/0019-3577(94)90016-7Unifying results on Hamiltonian claw-free graphs (1994)[Book/Report › Report]. University of Twente. Broersma, H. J., Ryjácek, Z. & Schiermeyer, I.
1993
Backlund transformations in bilinear form for soliton hierarchies (1993)In Proceedings of the XIX International Colloquium on Group Theoretical Methods in Physics, CIEMAT (pp. 274-276). Post, G. F. & Helminck, G. F.A generalization of Ore's Theorem involving neighborhood unions (1993)Discrete mathematics, 122(122), 37-49. Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.https://doi.org/10.1016/0012-365X(93)90285-2A note on K4-closures in Hamiltonian graph theory (1993)Discrete mathematics, 121(121), 19-23. Broersma, H. J.https://doi.org/10.1016/0012-365X(93)90533-YClassification of graded, finite-dimensional Lie algebras of vector fields (1993)[Book/Report › Report]. University of Twente. Post, G. F.Classification of linear differential operators with an invariant subspace in monomials (1993)[Book/Report › Report]. University of Twente. Post, G. F. & Turbiner, A.Coloring a graph optimally with two colors (1993)Discrete mathematics, 118(1-3), 23-31. Broersma, H. J. & Gobel, F.https://doi.org/10.1016/0012-365X(93)90050-4Cycles containing all vertices of maximum degree (1993)Journal of graph theory, 17(3), 373-385. Broersma, H. J., van den Heuvel, J., Jung, H. A. & Veldman, H. J.https://doi.org/10.1002/jgt.3190170311Decomposition of bipartite graphs under degree constraints (1993)Networks, 23(23), 159-164. Broersma, H. J., Faudree, R. J., van den Heuvel, J. P. M. & Veldman, H. J.https://doi.org/10.1002/net.3230230303Deformations of S(o,n) and H(o,n) (1993)International journal of algebra and computation, 3, 57-77. van den Hijligenberg, N. W., Kotchetkov, Y. & Post, G. F.Generating all 3-connected 4-regular planar graphs from the octahedron graph (1993)Journal of graph theory, 17(5), 613-620. Broersma, H. J., Duijvestijn, A. J. W., Duijvestijn, A. J. W. & Gobel, F.https://doi.org/10.1002/jgt.3190170508Long cycles in graphs with prescribed toughness and minimum degree (1993)[Book/Report › Report]. University of Twente. Broersma, H. J., Bauer, D., van den Heuvel, J. P. M. & Veldman, H. J.Long cycles, degree sums and neighborhoods unions (1993)Discrete mathematics, 121(121), 25-35. Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.https://doi.org/10.1016/0012-365X(93)90534-ZLong paths and cycles in tough graphs (1993)Graphs and combinatorics(9), 3-17. Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J.On "The matching polynomial of a polygraph" (1993)Discrete applied mathematics, 46(1), 79-86. Broersma, H. J. & Li, X.https://doi.org/10.1016/0166-218X(93)90159-LOn graphs satisfying a local Ore-type condition (1993)[Book/Report › Report]. University of Twente. Broersma, H. J., Asratian, A. S., van den Heuvel, J. P. M. & Veldman, H. J.Toughness and hamiltonicity in almost claw-free graphs (1993)[Book/Report › Report]. University of Twente. Broersma, H. J., Ryjácek, Z. & Schiermeyer, I.Trees are graceful if and only if trees with a perfect matching are strongly graceful (1993)[Book/Report › Report]. University of Twente. Broersma, H. J. & Hoede, C.
1992
Algebres graduees de type A (1992)Academie des Sciences. Comptes Rendus. Mathematique, 0(314), 653-655. Korkina, E. I., Post, G. F. & Roelofs, M.Contributions to the Twente Workshop on Hamiltonian Graph Theory (1992)[Book/Report › Report]. University of Twente. Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.Cycles containing all vertices of maximum degree (1992)[Book/Report › Report]. University of Twente. Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J.Cycles through particular subgraphs of claw-free graphs (1992)[Book/Report › Report]. University of Twente. Broersma, H. J. & Lu, M.Deformations of L2-nilpotent subalgebra of the Witt algebra (in Russian) (1992)Functional analysis and its applications, 26(4), -. Kotchetkov, Y. & Post, G. F.Deformations of the Lie algebras L1(H(2)) and L1(W(2)) (1992)[Book/Report › Report]. University of Twente. van den Hijligenberg, N. W., Kotchetkov, Y. & Post, G. F.Explicit results on gl-lambda and sl-lambda (1992)[Book/Report › Report]. University of Twente. Post, G. F. & van den Hijligenberg, N. W.On hamiltonian properties of 2-tough graphs (1992)[Book/Report › Report]. University of Twente. Bauer, D., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.The connectivity of the basis graph of a branching greedoid (1992)Journal of graph theory, 16(3), 233-237. Broersma, H. J. & Li, X.https://doi.org/10.1002/jgt.3190160306Updated contributions to the Twente Workshop on Hamiltonian Graph Theory (1992)[Book/Report › Report]. University of Twente. Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.
1991
A closure concept based on neighborhood unions of indipendent triples (1991)[Book/Report › Report]. University of Twente. Broersma, H. J. & Schiermeyer, I.A convergent framework for the multicomponent KP-hierarchy (1991)Transactions of the American Mathematical Society, 324(1), 271-292. Helminck, G. F. & Post, G. F.https://doi.org/10.1090/S0002-9947-1991-0986025-5Backlund transformations in bilinear form for soliton hierarchies (1991)[Book/Report › Report]. University of Twente. Post, G. F. & Helminck, G. F.Decomposition of bipartite graphs under degree constraints (1991)[Book/Report › Report]. University of Twente. Broersma, H. J., Faudree, R. J., van den Heuvel, J. P. M. & Veldman, H. J.Defining relations for Lie algebras of vector fields (1991)Indagationes mathematicae, 0(2), 207-218. van den Hijligenberg, N. W. & Post, G. F.https://doi.org/10.1016/0019-3577(91)90007-TDefining relations for Lie algebras of vector fields (1991)[Book/Report › Report]. University of Twente. van den Hijligenberg, N. W. & Post, G. F.Deformations of S(i,n) and H(O,n) (1991)[Book/Report › Report]. University of Twente. van den Hijligenberg, N. W., Kotchetkov, Y. & Post, G. F.Long dominating cycles and paths in graphs with large neighborhood unions (1991)Journal of graph theory, 0(15), 29-40. Broersma, H. J. & Veldman, H. J.https://doi.org/10.1002/jgt.3190150106Long paths and cycles in tough graphs (1991)[Book/Report › Report]. University of Twente. Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J.On the structure of special vectors of the Virasoro algebra (1991)[Book/Report › Report]. University of Twente. Kotchetkov, Y., Post, G. F. & Roelofs, M.Optimal copying strategies (1991)[Book/Report › Report]. University of Twente. Broersma, H. J. & Gobel, F.Subgraphs, closures and hamiltonicity (1991)[Book/Report › Report]. University of Twente. Broersma, H. J. & Schiermeyer, I.The connectivity of the basis graph of a branching greedoid (1991)[Book/Report › Report]. University of Twente. Broersma, H. J. & Li, X.The connectivity of the leaf-exchange spanning tree graph of a graph (1991)[Book/Report › Report]. University of Twente. Broersma, H. J. & Li, X.
1990
k-Traversable graphs (1990)Ars combinatoria, 29A, 141-153. Broersma, H. J. & Göbel, F.Cyclic schedules for r irregularly occurring event (1990)Journal of computational and applied mathematics, 30(2), 173-189. Brucker, P., Burkard, R. & Hurink, J. L.https://doi.org/10.1016/0377-0427(90)90026-VA closure concept based on degree-sums of independent triples (1990)[Book/Report › Report]. University of Twente. Broersma, H. J. & Schiermeyer, I.A note on "the matching polynomial of a polygraph" (1990)[Book/Report › Report]. University of Twente. Broersma, H. J. & Li, X.A note on K4-closures in hamiltonian graph theory (1990)[Book/Report › Report]. University of Twente. Broersma, H. J.Around three lemmas in hamiltonian graph theory (1990)In Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel (pp. 101-110). Physica-Verlag. Bauer, D., Broersma, H. J. & Veldman, H. J.https://doi.org/10.1007/978-3-642-46908-4_12Generating all 3-connected 4-regular planar graphs from the Octahedron Graph (1990)[Book/Report › Report]. University of Twente. Broersma, H. J., Duijvestijn, A. J. W. & Göbel, F.Long cycles, degree sums and neighborhood unions (1990)[Book/Report › Report]. University of Twente. Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J.On Bäcklund transformations and identities in bilinear form (1990)Journal of physics A: mathematical and theoretical, 23(23), 5661. Post, G. F.https://doi.org/10.1088/0305-4470/23/23/035On Baecklund Transformations and Identities in Bilinear form (1990)[Book/Report › Report]. University of Twente. Post, G. F.On Baecklund transformations and identities in bilinear form (1990)Journal of physics A: mathematical and theoretical, 23, 5661-5665. Post, G. F.On smallest nonhamiltonian regular tough graphs (1990)Congressus numerantium, 70, 95-98. Bauer, D., Broersma, H. J. & Veldman, H. J.Remarks on hamiltonian properties of claw-free graphs (1990)Ars combinatoria, 0, 110-121. Ainouche, A., Broersma, H. J. & Veldman, H. J.Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1,3-free graphs (1990)In Contemporary methods in graph theory: In honour of Prof. Dr. Klaus Wagner (pp. 181-194). BI Wissenschaftsverlag. Broersma, H. J. & Veldman, H. J.
1989
Path graphs (1989)Journal of graph theory, 13(4), 427-444. Broersma, H. J. & Hoede, C.https://doi.org/10.1002/jgt.3190130406A generalization of a result of Häggkvist and Nicoghossian (1989)Journal of combinatorial theory. Series B, 47(2), 237-243. Bauer, D., Broersma, H. J., Veldman, H. J. & Rao, L.https://doi.org/10.1016/0095-8956(89)90023-3
1988
Existence of Δλ-cycles and Δλ-paths (1988)Journal of graph theory, 12(4), 499-507. Broersma, H. J.https://doi.org/10.1002/jgt.3190120405Geometrical interpretation of the bilinear equations for the KP hierarchy (1988)Letters in mathematical physics, 16(4), 359-364. Helminck, G. F. & Post, G. F.https://doi.org/10.1007/BF00402044
1987
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian (1987)Journal of graph theory, 11(3), 399-407. Broersma, H. J. & Veldman, H. J.https://doi.org/10.1002/jgt.3190110314Note on 'N-pseudoreductions' of the KP hierarchy (1987)Journal of physics A: mathematical and theoretical, 20(18), 6591. Post, G. F.https://doi.org/10.1088/0305-4470/20/18/054
1986
A railway scheduling problem (1986)Zeitschrift für Operations Research, 30(5), 223-227. Brucker, P. & Hurink, J. L.Lie algebraic approach to τ-functions and its equations (1986)Letters in mathematical physics, 11(3), 253-257. Post, G. F.https://doi.org/10.1007/BF00400223