3. Publications

2017

E. Bonnet, B. Escoffier, V. Th. Paschos, G. Stamoulis (2017). Purely Combinatorial Approximation Algorithms for Maximum k-Vertex Cover in Bipartite Graphs. To appear in Discrete Optimization.

T. Cazenave,  M.H.M. Winands, S. Edelkamp, S. Schiffel, M. Thielscher and J. Togelius,(2017). Computer Games: Fifth Workshop on Computer Games, CGW 2016, and the Fifth Workshop on General Intelligence in Game-Playing Agents, GIGA 2016, Held in Conjunction with the 25th International Conference on Artificial Intelligence, IJCAI 2016, New York, USA, July 9-10, 2016, Revised Selected Papers, Vol. 705 of Communications in Computer and Information Science.

L. van Iersel, S. Kelk, G. Stamoulis, L. Stougie, O. Boes (2017). On unrooted and root-uncertain variants of several well-known phylogenetic network problems. To appear in Algorithmica.

C.F. Sironi and M.H.M. Winands (2017). Optimizing Propositional Networks. In 5th Workshop on Computer Games, CGW 2016, and 5th Workshop on General Intelligence in Game-Playing Agents, GIGA 2016, Vol. 705 of Communications in Computer and Information Science, pp. 133-151. Springer.

M.L.M. Rooijackers and M.H.M. Winands (2017). Resource-Gathering Algorithms in the Game of StarCraft.  In 2017 IEEE Conference on Computational Intelligence and Games (CIG 2017).

S. Zhou, E. Smirnov, G. Schoenmakers, K. Driessens, R. Peeters (2017). Testing exchangeability for transfer decision. Pattern Recognition Letters 88, pp. 64–71

S. Zhou, E. Smirnov, G. Schoenmakers, R. Peeters (2017). Conformity-based source subset selection for instance transfer. Neurocomputing (available online)

G. Stamoulis (2017): The multi-budgeted and weighted bounded degree metric Steiner network problem, Journal of Parallel and Distributed Computing 104,  pp. 36-48

F. Braun, O. Caelen, E. Smirnov, S. Kelk and B. Lebichot (2017), Improving card fraud detection through suspicious pattern discovery, to appear in proceedings of IEA/AIE 2017

F. Thuijsman (2017): Spelen en Delen (in Dutch, 2nd edition; title translates as: To Play and To Share). Zebra-Reeks 22, Epsilon Uitgaven, Utrecht.

S. Kelk and G. Stamoulis (2017): A note on convex characters, Fibonacci numbers and exponential-time algorithms. Advances in Applied Mathematics 84, pp. 34-46

R. van Wersch and S. Kelk (2017). ToTo: An open database for computation, storage and retrieval of tree decompositions. Discrete Applied Mathematics 217, pp. 389-393

O. Boes, M. Fischer, S. Kelk (2017). A linear bound on the number of states in optimal convex characters for maximum parsimony distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)  14 (2), pp. 472-477

J. Matsieva, S. Kelk, C. Scornavacca, C. Whidden,  D. Gusfield (2017). A resolution of the static formulation question for the problem of computing the history bound. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 14(2), pp. 404-417

2016

J. Kuipers, J. Flesch, G. Schoenmakers, K. Vrieze (2016). Subgame-perfection in recursive perfect information games, where each player controls one state. International Journal of Game Theory 45, pp. 205 – 237.

S. Zhou, E. Smirnov, G. Schoenmakers, R. Peeters (2016). Decision trees for instance transfer. International Symposium on Conformal and Probabilistic Prediction with Applications (COPA) 2016.

J. Metz, K. Staňková and J. Johansson (2016), The adaptive dynamics of life histories: From fitness-returns to selection gradients and Pontryagin’s maximum principle, Journal of Mathematical Biology 72 (4), pp. 1125-1152.

J.W.H.M. Uiterwijk (2016). Polymerization and Crystallization of Snowflake Molecules in Domineering. Theoretical Computer Science, Vol. 644, pp. 143-158.

J.W.H.M. Uiterwijk (2016). 11 x 11 Domineering is Solved: The first player wins. Proceedings of the 9thInternational Conference on Computers and Games (CG2016) (Eds. A. Plaat, H.J. van den Herik, and W. Kosters), Vol. 10068 of Lecture Notes in Computer Science (LNCS), pp. 129-136, Springer Int. Publ.

J. Griebel and J.W.H.M. Uiterwijk (2016). Combining Combinatorial Game Theory with an Alpha-Beta Solver for Clobber. BNAIC 2016: Proceedings of the 28th Benelux Conference on Artificial Intelligence (eds. T. Bosse and B. Bredeweg), pp. 48-55, University of Amsterdam / Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.

A. Bartschi, J. Chalopin, S. Das, Y. Disser, B. Geissmann, Daniel Graf, A. Labourel, and M. Mihalak (2016). Collaborative delivery with energy-constrained mobile robotsIn Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 258–274

M. Bohlin, S. Gestrelius, F. Dahms, M. Mihalak, and H. Flier (2016). Optimization methods for multistage freight train formation. Transportation Science, 50(3). pp. 823–840.

K. Bohmova, J. Chalopin, M. Mihalaak, G. Proietti, and P. Widmayer (2016). Sequence hypergraphs. In Proc. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 282–294.

K. Bohmova, E. Kravina, and M. Mihalak (2016). Approximating interval selection on unrelated machines with unit-length intervals and cores. In Proc. 4th International Symposium on Combinatorial Optimization (ISCO), pp. 345–356.

K. Bohmova, M. Mihalak, T. Proger, G. Sacomoto, and M. Sagot (2016). Computing and listing st-paths in public transportation networks. In Proc. 11th International Computer Science Symposium in Russia (CSR), pp. 102–116.

K. Bohmova, Y. Disser, M. Mihalak, and R. Sramek (2016). Scheduling transfers of resources over time: Towards car-sharing with flexible drop-offs. In Proc. 12th Latin American Symposium on Theoretical Informatics (LATIN), pp. 220–234.

M. Mihalak, P. Penna, and P. Widmayer. Bribeproof mechanisms for two-values domains (2016). In Proc. 9th International Symposium on Algorithmic Game Theory (SAGT), pp. 289–301.

M. Mihalak, R. Sramek, and P. Widmayer. Approximately counting approximately shortest paths in directed acyclic graphs (2016). Theory of Computing Systems, 58(1), pp. 45–59.

M. Mihalak, P. Uznanski, and P. Yordanov. Prime factorization of the kirchhoff polynomial: Compact enumeration of arborescences (2016). In Proc. Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 93–105.

A. Khan, R. Peeters, F. Thuijsman, P. Uyttendaele (2016): Network Characteristics enabling Efficient Coordination: A Simulation Study. Dynamic Games and Applications 6, 495-519, DOI: 10.1007/s13235-015-0169-8

P. Gambette, K. Huber and S. Kelk (2016): On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters Journal of Mathematical Biology. To appear (available online).

P. Gambette, L. van Iersel, S. Kelk, F. Pardi and C. Scornavacca (2016). Do branch lengths help to locate a tree in a phylogenetic network? Bulletin of Mathematical Biology 78 (9), pp. 1773–1795

D.J.N.J. Soemers, C.F. Sironi, T. Schuster, and M.H.M.Winands (2016). Enhancements for Real-Time Monte-Carlo Tree Search in General Video Game Playing. In 2016 IEEE Conference on Computational Intelligence and Games (CIG 2016), 436-443. IEEE. Best Student Paper Award.

C.F. Sironi and M.H.M. Winands, (2016). Comparison of Rapid Action Value Estimation Variants for General Game Playing. In 2016 IEEE Conference on Computational Intelligence and Games (CIG 2016), pp. 309-316. IEEE.

D.J.N.J. Soemers and M.H.M. Winands (2016). Hierarchical Task Network Plan Reuse for Video Games. In 2016 IEEE Conference on Computational Intelligence and Games (CIG 2016), pp. 1-8. IEEE.

J. Renz, R. Miikkulainen, N.R. Sturtevant, M.H.M. and Winands, (2016). Guest Editorial: Physics-Based Simulation Games. IEEE Transactions on Computational Intelligence and AI in Games. Vol. 8, No. 2, pp. 101-103.

S. Kelk, M. Fischer, V. Moulton, T. Wu (2016): Reduction rules for the maximum parsimony distance on phylogenetic trees. Theoretical Computer Science 646, pp. 1-15

F. Thuijsman & F. Wagener eds (2016): Advances in Dynamic and Evolutionary Games: Theory, Applications, and Numerical Methods, Springer, DOI 10.1007/978-3-319-28014-1

M. Abrudan, L You, K.Stankova, F. Thuijsman (2016): A game theoretical approach to microbial coexistence. In: F. Thuijsman & F. Wagener (eds.), Advances in Dynamic and Evolutionary Games: Theory, Applications, and Numerical Methods, Springer, pp 267-282.

L. van Iersel, S. Kelk, N. Lekic, C. Whidden and N. Zeh (2016). Hybridization Number on Three Rooted Binary Trees is EPT.  SIAM Journal on Discrete Mathematics (SIDMA) 30(3), pp. 1607-1631

B. Bošanský, V. Lisý, M. Lanctot, J. Čermák, M.H.M. Winands (2016): Algorithms for Computing Strategies in Two-Player Simultaneous Move Games. Artificial Intelligence, Vol. 237:1-40.

H. Baier, M.H.M. Winands (2016): Time Management for Monte Carlo Tree Search. IEEE Transactions on Computational Intelligence and AI in Games. Vol. 8, No. 3, pp. 301-314.

T. Cazenave,  M.H.M. Winands,  S. Edelkamp, S. Schiffel, M. Thielscher, and J. Togelius (2016). Computer Games: Fourth Workshop on Computer Games, CGW 2015, and the Fourth Workshop on General Intelligence in Game-Playing Agents, GIGA 2015, Held in Conjunction with the 24th International Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 26-27, 2015, Revised Selected Papers, Vol. 614 of Communications in Computer and Information Science. © Springer International Publishing 2016. Springer International Publishing. ISBN 978-3-319-39401-5.

T. Pepels, T., Cazenave, and M.H.M. Winands (2016). Sequential Halving for Partially Observable Games. In Computer Games Fourth Workshop on Computer Games, CGW 2015, and the Fourth Workshop on General Intelligence in Game-Playing Agents, GIGA 2015, Vol. 614 of Communications in Computer and Information Science, pp. 16-29. Springer.

M.H.M. Winands (2016). The Surakarta Bot Revealed. In Computer Games Fourth Workshop on Computer Games, CGW 2015, and the Fourth Workshop on General Intelligence in Game-Playing Agents, GIGA 2015, Vol. 614 of Communications in Computer and Information Science, pp. 71-82. Springer.

S. Kelk and M. Fischer (2016). On the complexity of computing MP distance between binary phylogenetic trees. Annals of Combinatorics. To appear.

S. Kelk, L. van Iersel, C. Scornavacca, M. Weller (2016). Phylogenetic incongruence through the lens of Monadic Second Order logic. Journal of Graph Algorithms and Applications (JGAA), 20(2):189-215.

L. van Iersel, S. Kelk. C. Scornavacca (2016). Kernelizations for the hybridization number problem on multiple nonbinary trees. Journal of Computer and System Sciences (JCSS) 82(6), pp. 1075-1089

L. van Iersel, S. Kelk, N. Lekic and S. Linz (2016). Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. Theoretical Computer Science (TCS) 609, pp. 1-21 

M. Fischer, S. Kelk (2016). On the Maximum Parsimony distance between phylogenetic trees. Annals of Combinatorics 20(1), pp. 87-113

E. Bonnet, B. Escoffier, V. Th. Paschos and G. Stamoulis (2016). A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. In proceedings of LATIN 2016, pp. 235–248.

2015

J.W.H.M. Uiterwijk and M. Barton (2015). New results for Domineering from Combinatorial Game Theory Endgame Databases. Theoretical Computer Science, Vol. 592, pp. 72-86.

J.W.H.M. Uiterwijk (2015). Crystallization of Domineering Snowflakes. Proceedings of Advances in Computer Games 2015 Conference (ACG15) (Eds. A. Plaat, H.J. van den Herik, and W. Kosters), Vol. 9525 of Lecture Notes in Computer Science (LNCS), pp. 100-112, Springer Int. Publ.

H. Flier, M. Mihalak, P. Widmayer, A. Zych, Y. Kobayashi, and A. Schobel (2015). Selecting vertex disjoint paths in plane graphs. Networks, 66(2), pp. 136–144.

B. Geissmann, M. Mihalak, and P. Widmayer (2015). Recurring comparison faults: Sorting and finding the minimum. In Proc. of the 20th International Symposium on Fundamentals of Computation Theory (FCT), pp. 227–239.

A. Mamageishvili and M. Mihalak. Multicast network design game on a ring (2015). In Proc. 9th International Conference on Combinatorial Optimization and Applications (COCOA), pp. 439–451, 2015.

A. Mamageishvili, M. Mihalak, and D. Muller. Tree nash equilibria in the network creation game (2015). Internet Mathematics, 11(4-5), pp. 472–486.

M. Mihalak and S. Montanari. Bi-directional search for robust routes in time-dependent bicriteria road networks (2015). In Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), pp. 82–94.

Y. Disser, A. Feldmann, M. Klimm, and M. Mihalak. Improving the hk-bound on the price of stability in undirected shapley network design games (2015). Theoretical Computer Science., 562, pp. 557–564.

 J. Chalopin, S. Das, Y. Disser, M. Mihalak, and Peter Widmayer (2015). Mapping simple polygons: The power of telling convex from reflex. ACM Transactions on Algorithms, 11(4):33.

 K. Bohmova, M. Mihalak, P. Neubert, T. Proger, and P. Widmayer (2015). Robust routing in urban public transportation: Evaluating strategies that learn from the past. In Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), pp. 68–81.

H. Baier, M.H.M. Winands (2015): MCTS-Minimax Hybrids. IEEE Transactions on Computational Intelligence and AI in Games, 7(2):167-179.

K. Berg, J. Flesch, F. Thuijsman (2015): The Golden and Silver Ratios in Bargaining. The Fibonacci Quarterly 53, 130-134.

P. Uyttendaele, F. Thuijsman (2015): Evolutionary Games and Local Dynamics. International Game Theory Review 17, pp15400, DOI: 10.1142/S0219198915400162.

 V. Lisý, M. Lanctot, M. Bowling (2015): Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games. AAMAS 2015, pp. 27-36.

M.H.M. Winands (2015). Monte-Carlo Tree Search in Board Games. In Handbook of Digital Games and Entertainment Technologies, (eds. R. Nakatsu, M. Rauterberg and P. Ciancarini), pp. 1-30, Springer Singapore.

M.H.M. Winands (2015). Monte-Carlo Tree Search. In Encyclopedia of Computer Graphics and Games (ed. N. Lee), pp. 1-6. Springer International Publishing.

A. Grigoriev, S. Kelk, N. Lekic (2015): On low treewidth graphs and supertrees. Journal of Graph Algorithms and Applications (JGAA) 19(1), pp. 325-343

M. Fischer, L. van Iersel, S. Kelk, C. Scornavacca (2015): On computing the maximum parsimony score of a phylogenetic network. SIAM Journal on Discrete Mathematics (SIDMA) 29(1), pp. 559-585

2014

M. Barton and J.W.H.M. Uiterwijk. Combining Combinatorial Game Theory with an αβ Solver for Domineering. BNAIC 2014: Proceedings of the 26th Benelux Conference on Artificial Intelligence (Eds. F. Grootjen, M. Otworowska, and J. Kwisthout), pp. 9-16, Radboud University, Nijmegen.

J.W.H.M. Uiterwijk (2014). The Impact of Safe Moves on Perfectly Solving Domineering Boards – part 3: Theorems and Conjectures. ICGA Journal, Vol. 37, No. 4 (December 2014), pp. 207-213.

J.W.H.M. Uiterwijk (2014). The Impact of Safe Moves on Perfectly Solving Domineering Boards – part 2: Analysis and Experiments with Multi-Step Safe Moves. ICGA Journal, Vol. 37, No. 3 (September 2014), pp. 144-160.

J.W.H.M. Uiterwijk (2014). The Impact of Safe Moves on Perfectly Solving Domineering Boards – part 1: Analysis and Experiments with 1-Step Safe Moves. ICGA Journal, Vol. 37, No. 2 (June 2014), pp. 97-105.

H. Baier, M.H.M. Winands (2014): Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions. In Computer Games: Third Workshop on Computer Games (CGW 2014), Vol. 504 of Communications in Computer and Information Science, pp. 45-63. Springer.

T. Cazenave,  M.H.M. Winands, Y. Björnsson (2014): Computer Games: Third Workshop on Computer Games, CGW 2014, Held in Conjunction with the 21st European Conference on Artificial Intelligence, ECAI 2014, Prague, Czech Republic, August 18, 2014, Revised Selected Papers, Vol. 504 of Communications in Computer and Information Science. Springer. ISBN 978-3-319-14922-6.

T. Cazenave,  M.H.M. Winands, H. Iida (2014): Computer Games – Workshop on Computer Games, CGW 2013, Held in Conjunction with the 23rd International Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, August 3, 2013, Revised Selected Papers. Vol. 408 of Communications in Computer and Information Science. Springer. ISBN 978-3-319-05427-8.

M. Esser, M. Gras, M.H.M. Winands, M.P.D. Schadd, M. Lanctot (2014): Improving best-reply search. In Proceedings of Eighth International Conference on Computers and Games (CG 2013), Vol. 8427 of Lecture Notes in Computer Science, pp. 125-137. Springer International Publishing Switzerland.

A. Grigoriev, S. Kelk, N. Lekic (2014). On low treewidth graphs and supertrees. Proceedings of 1st International Conference on Algorithms for Computational Biology (ALCOB 2014), LNCS 8542, pp. 71-82

L. van Iersel, N. Lekic, S. Kelk, C. Scornavacca (2014). A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. BMC Bioinformatics 15:27.

L. van Iersel, S. Kelk (2014). Kernelizations for the hybridization number problem on multiple nonbinary trees. Proceedings of 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014), LNCS 8747, pp. 299-311

L. van Iersel, S. Kelk, N. Lekić, L. Stougie (2014): Approximation algorithms for nonbinary agreement forests. SIAM Journal on Discrete Mathematics (SIDMA) 28(1), pp. 49-66.

M. Lanctot (2014): Further Developments of Extensive-Form Replicator Dynamics using the Sequence-Form Representation. In Proceedings of the Thirteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2014), pp.  1257-1264.

M. Lanctot, V. Lisy, and M. Bowling (2014): Search in Imperfect Information Games using Online Monte Carlo Counterfactual Regret Minimization. In Computer Poker and Imperfect Information: Papers from the AAAI-14 Workshop, pp. 34-41. AAAI.

M. Lanctot, V. Lisy, M.H.M. Winands (2014): Monte Carlo tree search in simultaneous move games with applications to Goofspiel. In Computer Games – Workshop on Computer Games (CGW 2013). Vol. 408 of Communications in Computer and Information Science, 28-43. Springer.

M. Lanctot, M.H.M. Winands, T. Pepels, and N.R. Sturtevant (2014): Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups. In 2014 IEEE Conference on Computational Intelligence and Games (CIG 2014), pp. 341-348. IEEE.

T. Pepels, T. Cazenave, M.H.M. Winands, M. Lanctot (2014). Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search. In Computer Games: Third Workshop on Computer Games (CGW 2014),  Vol. 504 of Communications in Computer and Information Science, pp. 1-15. Springer.  

T. Pepels, M.J.W. Tak, M. Lanctot, and M.H.M. Winands (2014). Quality-based Rewards for Monte-Carlo Tree Search Simulations. In 21st European Conference on Artificial Intelligence (ECAI 2014) (T. Schaub, G. Friedrich and B. O’Sullivan), Vol. 263 of Frontiers in Artificial Intelligence and Applications, pp. 705-710. IOS Press.

T. Pepels, M.H.M. Winands, M. Lanctot (2014): Real-Time Monte Carlo Tree Search in Ms Pac-Man. IEEE Transactions on Computational Intelligence and AI in Games  6(3):245-257.

C. Scornavacca, L. van Iersel, S. Kelk, D. Bryant (2014). The agreement problem for unrooted phylogenetic trees is FPT. Journal of Graph Algorithms and Applications (JGAA) 18(3), pp. 385-392

K. Stankova and A. Boudewijn (2014). Stackelberg and Inverse Stackelberg Road Pricing Games: State of the Art and Open Problems. In Game Theoretic Analysis of Congestion, Safety and Security: Traffic and Transportation Theory  (K. Hausken and J. Zhuang, Eds.). Series in Reliability Engineering, Safety and Security, Springer. To appear.

M.J.W. Tak, M. Lanctot, and M.H.M. Winands, (2014). Monte Carlo Tree Search Variants for Simultaneous Move Games. In 2014 IEEE Conference on Computational Intelligence and Games (CIG 2014), pp. 232-239. IEEE.

M.J.W. Tak, M.H.M. Winands, and Y. Björnsson (2014). Decaying Simulation Strategies. IEEE Transactions on Computational Intelligence and AI in Games 6(4): 395-406.

J.W.H.M. Uiterwijk (2014): Perfectly solving domineering boards. In Computer Games – Workshop on Computer Games (CGW 2013). Vol. 408 of Communications in Computer and Information Science, 97-121. Springer.

2013

H. Baier, M.H.M. Winands (2013): Monte-Carlo tree search and minimax hybrids. In 2013 IEEE Conference on Computational Intelligence and Games (CIG 2013), pp. 129-136.

E. Bapteste, L. van Iersel, A. Janke, S. Kelchner, S. Kelk, J. O. McInerney, D.A. Morrison, L. Nakhleh, M. Steel, L. Stougie, J. Whitfield (2013): Networks: Expanding evolutionary thinking. Trends in Genetics 29 (8), 439-441.

M. Bügler, C. Rempoulakis, R. Shacham, T. Keasar, F. Thuijsman (2013): Sex allocation in a polyembryonic parasitoid with female soldiers: an evolutionary simulation and an experimental test. PLoS ONE 8(6): e64780. DOI:10.1371/journal.pone.0064780.

J. Derks, H. Peters, P. Suedholter (2013): On extensions of the core and the anticore of transferable utility games. International Journal of Game Theory. To appear.

J. Flesch, J. Kuipers, G. Schoenmakers, K. Vrieze (2013): Subgame-perfection in free transition games. European Journal of Operational Research 228 (1): 201-207.

J. Flesch, T. Parthasarathy, F. Thuijsman, P. Uyttendaele (2013): Evolutionary stochastic games. Dynamic Games and Applications 3: 207-219, DOI: 10.1007/s13235-012-0059-2.

F. Hagen, P.C. Ceresini, I. Polacheck, H. Ma, F. van Nieuwerburgh, et al. (2013): Ancient Dispersal of the Human Fungal Pathogen Cryptococcus gattii from the Amazon Rainforest. PLoS ONE 8(8): e71148. doi:10.1371/journal.pone.0071148

J. Kuipers, M.A. Mosquera, J.M. Zarzuelo (2013): Sharing costs in highways: a game theoretic approach. European Journal of Operational Research 228(1):158-168.

M. Lanctot, A. Saffidine, J. Veness, C. Archibald, M.H.M. Winands (2013): Monte Carlo *-minimax search. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pp. 580-586.

M. Lanctot, C. Wittlinger, M.H.M. Winands, N.G.P. Den Teuling (2013): Monte Carlo tree search for simultaneous move games: A case study in the game of Tron. In Proceedings of the Twenty-Fifth Benelux Conference on Artificial Intelligence (BNAIC), pp. 104-111.

V. Lisy, V. Kovarik, M. Lanctot, B. Bosansky (2013): Convergence of Monte Carlo Tree Search in Simultaneous Move Games. Advances in Neural Information Processing Systems 26, pp. 2112-2120.

T.W. Neller, M. Lanctot (2013): An introduction to counterfactual regret minimization. In Proceedings of The Fourth Symposium on Educational Advances in Artificial Intelligence (Model AI Assignments Session).

J.A.M. Nijssen (2013): Monte-Carlo Tree Search for Multi-Player Games. PhD Thesis. Maastricht University.

J,A.M. Nijssen, M.H.M. Winands (2013): Search policies in multi-player games. ICGA Journal 36(1): 3-21.

T. Piovesan, S.M. Kelk (2013): A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees,” Computational Biology and Bioinformatics, IEEE/ACM Transactions on , vol.10, no.1, pp.18,25, Jan.-Feb. 2013, doi: 10.1109/TCBB.2012.134

B. Ranjbar-Sahraei, K. Staňková, K. Tuyls, G. Weiss (2013): Stackelberg-based coverage approach in nonconvex environments. 12th European Conference on Artificial ECAL. pp. 462-469.

B. Ranjbar-Sahraei, S. Alers, K. Staňková, K. Tuyls, and G. Weiss (2013): Toward Soft Heterogeneity in Robotic Swarms. Proceedings of the 25th Benelux Conference on Artifficial Intelligence (BNAIC 2013), Delft, The Netherlands, pp. 384-385.

K. Staňková, A. Abate, and M.W. Sabelis (2013): Intra-seasonal strategies based on energy budgets in a dynamic predator–prey game, Annals of the International Society of Dynamic Games, Advances in Dynamic Games (V. Křivan and G. Zaccour, Eds.), Vol. 13, pp. 205-222.

K. Staňková, A. Abate, and M.W. Sabelis (2013): Irreversible prey diapause as an optimal strategy of a physiologically extended Lotka-Volterra model, Journal of Mathematical Biology, 66(4-5), pp. 767-794.

K. Staňková, A. Abate, M.W. Sabelis, J. Buša, and L. You (2013): Joining or opting out of a Lotka-Volterra game between predators and prey: Does the best strategy depend on modeling energy lost and gained?, Interface Focus  (Theme issue of the Royal Society Interface), 3(6), 12 pp.

K. Staňková, B. Ranjbar-Sahraei, G. Weiss, K. Tuyls (2013): StaCo: Stackelberg-based coverage approach in robotic swarms, Proceedings of ADAPTIVE 2013, 71-76.

M.J.W. Tak, M.H.M. Winands, Y. Björnsson (2013): Decaying simulation strategies. In General Intelligence in Game-Playing Agents (GIGA’13), pp. 23-30. Beijing, China.

J.W.H.M. Uiterwijk (2013). Perfectly Solving Domineering Games. Computer games, Workshop on Computer games, CGW at IJCAI 2013, Beijing, China, revised Selected Papers (eds. T. Cazenave, M.H.M. Winands, and H. Iida), Vol. 408 of Communications in Computer and Information Science, pp. 97-121, Springer International Publishing.

Publications of earlier years can be found here.