{"id":8,"date":"2013-11-01T14:03:23","date_gmt":"2013-11-01T13:03:23","guid":{"rendered":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/?page_id=8"},"modified":"2017-12-12T16:58:03","modified_gmt":"2017-12-12T15:58:03","slug":"publications","status":"publish","type":"page","link":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/?page_id=8","title":{"rendered":"3. Publications"},"content":{"rendered":"

2017<\/strong><\/p>\n

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.<\/em><\/p>\n

T. Cazenave,\u00a0 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<\/a>, Vol. 705 of Communications in Computer and Information Science<\/i>.<\/p>\n

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\u00a0Algorithmica.<\/em><\/p>\n

C.F. Sironi and M.H.M. Winands (2017). Optimizing Propositional Networks<\/a>.\u00a0In 5th Workshop on Computer Games, CGW 2016, and 5th Workshop on General Intelligence in Game-Playing Agents, GIGA 2016<\/em>, Vol. 705 of Communications in Computer and Information Science<\/a><\/i><\/em>, pp. 133-151. Springer<\/span>.<\/p>\n

M.L.M. Rooijackers and M.H.M. Winands (2017). Resource-Gathering Algorithms in the Game of StarCraft.\u00a0 In 2017 IEEE Conference on Computational Intelligence and Games (CIG 2017), <\/em>pp. 264-271. IEEE.<\/p>\n

S. Zhou, E. Smirnov, G. Schoenmakers, K. Driessens, R. Peeters (2017). Testing exchangeability for transfer decision. Pattern Recognition Letters <\/em>88, pp. 64\u201371<\/p>\n

S. Zhou, E. Smirnov, G. Schoenmakers, R. Peeters (2017). Conformity-based source subset selection for instance transfer. Neurocomputing<\/em> (available online)<\/p>\n

G. Stamoulis (2017): The multi-budgeted and weighted bounded degree metric Steiner network problem, Journal of Parallel and Distributed Computing<\/em> 104,\u00a0 pp. 36-48<\/p>\n

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<\/em><\/p>\n

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

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

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

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)\u00a0 <\/em>14 (2), pp. 472-477<\/p>\n

J. Matsieva, S. Kelk, C. Scornavacca, C. Whidden,\u00a0 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) <\/em>14(2), pp. 404-417<\/p>\n

2016<\/strong><\/p>\n

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<\/em> 45, pp. 205 \u2013 237.<\/p>\n

S.\u00a0Zhou, E. Smirnov,\u00a0G. Schoenmakers,\u00a0R. Peeters\u00a0(2016). Decision trees for instance transfer. International Symposium on\u00a0Conformal and Probabilistic Prediction with Applications<\/em> (COPA) 2016.<\/p>\n

J. Metz, K. Sta\u0148kov\u00e1 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<\/em> 72 (4), pp. 1125-1152.<\/p>\n

J.W.H.M. Uiterwijk (2016). Polymerization and Crystallization of Snowflake Molecules in Domineering. Theoretical Computer Science<\/i>, Vol. 644, pp. 143-158.<\/p>\n

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

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 28<\/i>th<\/sup><\/i><\/span> Benelux Conference on Artificial Intelligence <\/i>(eds. T. Bosse and B. Bredeweg), pp. 48-55, University of Amsterdam \/ Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.<\/p>\n

A. Bartschi, J. Chalopin, S. Das, Y. Disser, B. Geissmann, Daniel Graf, A. Labourel, and M. Mihalak (2016). Collaborative delivery with energy-constrained mobile robots.\u00a0<\/em>In Proc. 23rd International Colloquium on Structural Information and Communication Complexity\u00a0<\/em>(SIROCCO)<\/em>, pp. 258\u2013274<\/p>\n

M. Bohlin, S. Gestrelius, F. Dahms, M. Mihalak, and H. Flier (2016). Optimization methods for multistage freight train formation. Transportation Science<\/i>, 50(3). pp. 823\u2013840.<\/p>\n

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\u00a0<\/i>(WG)<\/i>, pp. 282\u2013294.<\/p>\n

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\u00a0<\/i>Optimization (ISCO)<\/i>, pp. 345\u2013356.<\/p>\n

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\u00a0<\/i>Science Symposium in Russia (CSR)<\/i>, pp. 102\u2013116.<\/p>\n

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\u00a0<\/i>on Theoretical Informatics (LATIN)<\/i>, pp. 220\u2013234.<\/p>\n

M. Mihalak, P. Penna, and P.\u00a0Widmayer. Bribeproof mechanisms for two-values domains (2016). In\u00a0Proc. 9th International Symposium on Algorithmic Game Theory (SAGT)<\/i>, pp. 289\u2013301.<\/p>\n

M. Mihalak, R. Sramek, and P. Widmayer. Approximately counting approximately shortest paths in directed acyclic graphs (2016). Theory of Computing Systems<\/i>, 58(1), pp. 45\u201359.<\/p>\n

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\u00a0<\/i>and Combinatorics (ANALCO)<\/i>, pp. 93\u2013105.<\/p>\n

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

P. Gambette, K. Huber and S. Kelk (2016): On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters.\u00a0<\/a> Journal of Mathematical Biology. <\/em>To appear (available online).<\/p>\n

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 <\/em>78 (9), pp. 1773\u20131795<\/p>\n

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),<\/em> 436-443. IEEE. Best Student Paper Award.<\/strong><\/p>\n

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), <\/em>pp. 309-316. IEEE.<\/p>\n

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)<\/em>, pp. 1-8. IEEE.<\/p>\n

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

S. Kelk, M. Fischer, V. Moulton, T. Wu (2016):\u00a0Reduction rules for the maximum parsimony distance on phylogenetic trees. Theoretical Computer Science<\/em> 646, pp. 1-15<\/p>\n

F. Thuijsman & F. Wagener eds (2016): Advances in Dynamic and Evolutionary Games: Theory, Applications, and Numerical Methods<\/a><\/span>,<\/em>\u00a0Springer, DOI 10.1007\/978-3-319-28014-1<\/p>\n

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<\/a><\/em><\/span>, <\/em>Springer, pp 267-282.<\/p>\n

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

B. Bo\u0161ansk\u00fd, V. Lis\u00fd, M. Lanctot, J. \u010cerm\u00e1k, M.H.M. Winands (2016): Algorithms for Computing Strategies in Two-Player Simultaneous Move Games<\/a>. Artificial Intelligence, <\/em>Vol. 237:<\/em>1-40.<\/p>\n

H. Baier, M.H.M. Winands (2016): Time Management for Monte Carlo Tree Search. IEEE Transactions on Computational Intelligence and AI in Games.<\/i><\/a> Vol. 8, No. 3, pp. 301-314<\/span>.<\/p>\n

T. Cazenave,\u00a0 M.H.M. Winands,\u00a0 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,\u00a0Held in Conjunction with the 24th International Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 26-27, 2015, Revised Selected Papers<\/a>, Vol. 614 of Communications in Computer and Information Science<\/i>. \u00a9 Springer International Publishing 2016. Springer International Publishing. ISBN 978-3-319-39401-5.<\/p>\n

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

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<\/em>, Vol. 614 of Communications in Computer and Information Science<\/a><\/i><\/em>, pp. 71-82. Springer.<\/p>\n

S. Kelk and M. Fischer (2016). On the complexity of computing MP distance between binary phylogenetic trees. Annals of Combinatorics.<\/em> To appear.<\/p>\n

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),<\/em> 20(2):189-215.<\/p>\n

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) <\/em>82(6), pp. 1075-1089
\n<\/em><\/p>\n

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) <\/em>609, pp. 1-21\u00a0<\/em><\/p>\n

M. Fischer, S. Kelk (2016). On the Maximum Parsimony distance between phylogenetic trees. Annals of Combinatorics<\/em> 20(1), pp. 87-113<\/p>\n

E. Bonnet, B. Escoffier, V. Th. Paschos and G. Stamoulis\u00a0(2016).\u00a0A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.\u00a0In proceedings of LATIN 2016, pp. 235\u2013248.<\/em><\/span><\/p>\n

2015<\/strong><\/p>\n

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

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

H. Flier, M. Mihalak, P. Widmayer, A. Zych, Y. Kobayashi, and A. Schobel (2015). Selecting vertex disjoint paths in plane graphs. Networks<\/i>, 66(2), pp. 136\u2013144.<\/p>\n

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\u00a0<\/i>Theory (FCT)<\/i>, pp. 227\u2013239.<\/p>\n

A. Mamageishvili and M. Mihalak. Multicast network design game on a ring (2015). In Proc. 9th\u00a0<\/i>International Conference on Combinatorial Optimization and Applications (COCOA)<\/i>, pp. 439\u2013451, 2015.<\/p>\n

A. Mamageishvili, M. Mihalak, and D. Muller. Tree nash equilibria in the network creation game (2015). Internet Mathematics<\/i>, 11(4-5), pp. 472\u2013486.<\/p>\n

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,\u00a0<\/i>Optimization, and Systems (ATMOS)<\/i>, pp. 82\u201394.<\/p>\n

Y. Disser, A.\u00a0Feldmann, M. Klimm, and M. Mihalak. Improving the h<\/i>k<\/i>-bound on the price of stability in undirected shapley network design games (2015). Theoretical Computer Science.<\/i>, 562, pp. 557\u2013564.<\/p>\n

\u00a0J. 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<\/i>, 11(4):33.<\/p>\n

\u00a0K. 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\u00a0<\/i>Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)<\/i>, pp. 68\u201381.<\/p>\n

H. Baier, M.H.M. Winands (2015): MCTS-Minimax Hybrids. IEEE Transactions on Computational Intelligence and AI in Games<\/i><\/a>, 7(2):167-<\/span>179<\/span><\/span>.<\/p>\n

K. Berg, J. Flesch, F. Thuijsman (2015): The Golden and Silver Ratios in Bargaining. The Fibonacci Quarterly\u00a0<\/em>53, 130-134.<\/p>\n

P. Uyttendaele, F. Thuijsman (2015): Evolutionary Games and Local Dynamics. International Game Theory Review <\/em>17, <\/span>pp15400<\/span>, DOI: <\/span>10.1142\/S0219198915400162<\/a><\/span>.<\/span><\/span><\/p>\n

\u00a0V. Lis\u00fd, M. Lanctot<\/span>, M. Bowling (2015): Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games.<\/span> AAMAS 2015, <\/em>pp. 27-36.<\/p>\n

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

M.H.M. Winands (2015). Monte-Carlo Tree Search<\/a>. In Encyclopedia of Computer Graphics and Games<\/a> <\/em>(ed. <\/em>N. Lee)<\/em>, pp. 1-6. Springer International Publishing.<\/p>\n

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

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<\/em> (SIDMA) 29(1), pp. 559-585<\/p>\n

2014<\/strong><\/p>\n

M. Barton and J.W.H.M. Uiterwijk. Combining Combinatorial Game Theory with an \u03b1<\/span>–\u03b2<\/span> Solver for Domineering. BNAIC 2014: Proceedings of the 26<\/i>th<\/sup><\/i><\/span> Benelux Conference on Artificial Intelligence <\/i>(Eds. F. Grootjen, M. Otworowska, and J. Kwisthout), pp. 9-16, Radboud University, Nijmegen.<\/p>\n

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

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

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

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)<\/em>, Vol. 504 of Communications in Computer and Information Science<\/i>, pp. 45-63<\/span>. Springer.<\/p>\n

T. Cazenave,\u00a0 M.H.M. Winands, Y. Bj\u00f6rnsson (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<\/a>,<\/em> Vol. 504 of Communications in Computer and Information Science.<\/em> Springer. ISBN 978-3-319-14922-6<\/span>.<\/p>\n

T. Cazenave,\u00a0 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<\/em><\/a>. Vol. 408 of Communications in Computer and Information Science.<\/em> Springer. ISBN 978-3-319-05427-8.<\/p>\n

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<\/em> (CG 2013), Vol. 8427 of Lecture Notes in Computer Science<\/i>, pp. 125-137. Springer International Publishing Switzerland.<\/p>\n

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

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.<\/em> BMC Bioinformatics<\/em> 15:27.<\/p>\n

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<\/em> (WG 2014), LNCS 8747, pp. 299-311<\/p>\n

L. van Iersel, S. Kelk, N. Leki\u0107, L. Stougie (2014): Approximation algorithms for nonbinary agreement forests. SIAM Journal on Discrete Mathematics<\/em> (SIDMA) 28(1), pp. 49-66.<\/p>\n

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<\/em> (AAMAS 2014), pp.\u00a0 1257-1264.<\/p>\n

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, <\/em>pp. 34-41. AAAI.<\/p>\n

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)<\/em>. Vol. 408 of Communications in Computer and Information Science<\/i>, 28-43. Springer.<\/p>\n

M. Lanctot, M.H.M. Winands, T.\u00a0Pepels, and N.R.\u00a0Sturtevant (2014): Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups. In 2014 IEEE Conference on Computational Intelligence and Games (CIG 2014), <\/em> pp. 341-348. IEEE.<\/p>\n

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),\u00a0<\/em> Vol. 504 of Communications in Computer and Information Science<\/i><\/em>, pp. 1-15<\/span>. Springer.\u00a0\u00a0
\n<\/em><\/p>\n

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) <\/i>(T. Schaub, G. Friedrich and B. O’Sullivan), Vol. 263 of Frontiers in Artificial Intelligence and Applications<\/em><\/a>, pp. 705-710. IOS Press.<\/p>\n

T. Pepels, M.H.M.\u00a0Winands, M. Lanctot (2014):\u00a0Real-Time Monte Carlo Tree Search in Ms Pac-Man<\/a>. IEEE Transactions on Computational Intelligence and AI in Games<\/em>\u00a0<\/i> 6(3):245-257.<\/p>\n

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

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

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)<\/em>, pp. 232-239. IEEE.<\/p>\n

M.J.W. Tak, M.H.M. Winands, and Y. Bj\u00f6rnsson (2014). Decaying Simulation Strategies<\/a>. IEEE Transactions on Computational Intelligence and AI in Games <\/i>6(4): 395-406.<\/p>\n

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

2013<\/strong><\/p>\n

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)<\/em>, <\/i>pp. <\/i> 129-136.<\/p>\n

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\u00a0<\/em>29 (8), 439-441.<\/p>\n

M. B\u00fcgler, 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<\/em> 8(6): e64780. DOI:10.1371\/journal.pone.0064780.<\/p>\n

J. Derks, H. Peters, P. Suedholter (2013): On extensions of the core and the anticore of transferable utility games. International Journal of Game Theory.<\/em>\u00a0To appear.<\/p>\n

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

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.<\/p>\n

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<\/p>\n

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

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)<\/em>,\u00a0pp.\u00a0580-586.<\/p>\n

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)<\/em>, pp. 104-111.<\/p>\n

V. Lisy, V. Kovarik, M. Lanctot, B. Bosansky (2013):\u00a0Convergence of Monte Carlo Tree Search in Simultaneous Move Games.\u00a0Advances in Neural Information Processing Systems<\/em> 26, pp. 2112-2120.<\/p>\n

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)<\/em>.<\/p>\n

J.A.M. Nijssen (2013): Monte-Carlo Tree Search for Multi-Player Games. PhD Thesis. Maastricht University.<\/p>\n

J,A.M. Nijssen, M.H.M. Winands (2013): Search policies in multi-player games. ICGA Journal\u00a0<\/i>36(1): 3-21.<\/p>\n

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,\u00a0doi: 10.1109\/TCBB.2012.134<\/p>\n

B. Ranjbar-Sahraei, K. Sta\u0148kov\u00e1, K. Tuyls, G. Weiss (2013): Stackelberg-based coverage approach in nonconvex environments. 12th European Conference on Artificial ECAL. pp. 462-469.<\/p>\n

B. Ranjbar-Sahraei, S. Alers, K. Sta\u0148kov\u00e1, K. Tuyls, and G.\u00a0Weiss (2013): Toward Soft Heterogeneity in Robotic Swarms. Proceedings of the 25th Benelux Conference on Artifficial Intelligence (BNAIC 2013), Delft, The Netherlands, pp. 384-385.<\/p>\n

K. Sta\u0148kov\u00e1, A. Abate, and M.W. Sabelis (2013): Intra-seasonal strategies based on energy budgets in a dynamic predator\u2013prey game, Annals of the International Society of Dynamic Games, Advances in Dynamic Games (V. K\u0159ivan and G. Zaccour, Eds.), Vol. 13, pp. 205-222.<\/p>\n

K. Sta\u0148kov\u00e1, A. Abate, and M.W. Sabelis (2013):\u00a0Irreversible prey diapause as an optimal strategy of a physiologically extended Lotka-Volterra model, Journal of Mathematical Biology, 66(4-5), pp. 767-794.<\/p>\n

K. Sta\u0148kov\u00e1, A. Abate, M.W. Sabelis, J. Bu\u0161a, 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\u00a0 (Theme issue of the Royal Society Interface), 3(6), 12 pp.<\/p>\n

K. Sta\u0148kov\u00e1, B. Ranjbar-Sahraei, G. Weiss, K. Tuyls (2013): StaCo: Stackelberg-based coverage approach in robotic swarms, Proceedings of ADAPTIVE 2013, 71-76.<\/p>\n

M.J.W. Tak, M.H.M. Winands, Y. Bj\u00f6rnsson (2013): Decaying simulation strategies. In General Intelligence in Game-Playing Agents (GIGA’13)<\/em>, pp. 23-30. Beijing, China.<\/p>\n

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<\/i> (eds. T. Cazenave, M.H.M. Winands, and H. Iida), Vol. 408 of Communications in Computer and Information Science<\/i>, pp. 97-121, Springer International Publishing.<\/p>\n

Publications of earlier years can be found here<\/a>.<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"

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,\u00a0 M.H.M. Winands, S. Edelkamp, S. Schiffel, M. Thielscher and J. Togelius,(2017). … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-8","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages\/8","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=8"}],"version-history":[{"count":94,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages\/8\/revisions"}],"predecessor-version":[{"id":448,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages\/8\/revisions\/448"}],"wp:attachment":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=8"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}