25,161
edits
Changes
Created page with "'''Home * People * Walter Kosters''' FILE:walterkosters.jpg|border|right|thumb|link=http://www.liacs.nl/~kosters/|Walter Kosters <ref>[http://www.liacs.nl..."
'''[[Main Page|Home]] * [[People]] * Walter Kosters'''
[[FILE:walterkosters.jpg|border|right|thumb|link=http://www.liacs.nl/~kosters/|Walter Kosters <ref>[http://www.liacs.nl/~kosters/ Walter Kosters]</ref> ]]
'''Walter A. Kosters''',<br/>
a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at [[Leiden University]]. His research interests include [[Neural Networks|neural networks]], [[Genetic Programming#GeneticAlgorithm|genetic algorithms]], [https://en.wikipedia.org/wiki/Analysis_of_algorithms analysis of algorithms], [https://en.wikipedia.org/wiki/Concrete_Mathematics concrete mathematics], [https://en.wikipedia.org/wiki/NP-complete NP-completeness], [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics], [https://en.wikipedia.org/wiki/Data_mining data mining] and [[Artificial Intelligence|artificial intelligence]]. Along with [[Hendrik Jan Hoogeboom]] et al., Walter Kosters works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[http://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf) slides based on [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2003'''). ''Tetris is Hard, Even to Approximate''. [http://www.informatik.uni-trier.de/~ley/db/conf/cocoon/cocoon2003.html COCOON 2003]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations]</ref>.
=Nonograms=
Along with [[Joost Batenburg]], Walter Kosters researches on [[Nonogram|Nonograms]] <ref>[http://www.liacs.nl/~kosters/nono/sjoerd/indexeng.html Nonogram — Turn your picture into a puzzle]</ref>, picture logic puzzles where a pixel grid has to be filled with black and white pixels, based on a description that indicates the lengths of the consecutive black segments for each row and column. In this puzzle type, the numbers are a form of [https://en.wikipedia.org/wiki/Discrete_tomography discrete tomography] that measures how many unbroken lines of filled-in squares there are in any given row or column. While the Nonograms that can be found in puzzle books can typically be solved by applying a series of highly local reasoning steps regarding single rows and columns, the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard].
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/k/Kosters:Walter_A=.html DBLP: Walter A. Kosters]</ref>
* [http://www.informatik.uni-trier.de/~ley/pers/hd/b/Breukelaar:Ron Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''Tetris is hard, even to approximate''. [http://www.worldscientific.com/worldscinet/ijcga International Journal of Computational Geometry & Applications], Vol. 14
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''Tetris and Decidability''. Information Processing Letters, Vol. 9
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''[http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations]''. International Journal of Intelligent Games & Simulation, Vol. 3
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2005'''). ''[http://www.ibrarian.net/navon/page.jsp?paperid=3095440&searchTerm=3+3v The Theory of Tetris]''. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
* [[Joost Batenburg]], [[Walter Kosters]] ('''2009'''). ''Solving Nonograms by combining relaxations''. [http://www.journals.elsevier.com/pattern-recognition/ Pattern Recognition], Vol. 42, No. 8
* [[Jonathan K. Vis]], [[Walter Kosters]], [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba] ('''2010'''). ''Tennis Patterns: Player, Match and Beyond''. [http://bnaic2010.uni.lu/ BNAIC 2010], [http://www.liacs.nl/~jvis/bnaic2010.pdf pdf]
* [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba], [[Walter Kosters]], [[Jonathan K. Vis]] ('''2010'''). ''Tactical Analysis Modeling through Data Mining: Pattern Discovery in Racket Sports''. [http://www.kdir.ic3k.org/KDIR2010/ KDIR 2010], [http://www.liacs.nl/~jvis/kdir2010.pdf pdf]
* [[Jonathan K. Vis]], [[Walter Kosters]], [[Joost Batenburg]] ('''2011'''). ''Discrete Tomography: A Neural Network Approach''. [http://allserv.kahosl.be/bnaic2011/ BNAIC 2011] [http://www.liacs.nl/~jvis/bnaic2011.pdf pdf]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''Nonograms''. [http://www.liacs.nl/ LIACS - Leiden Institute of Advanced Computer Science], [http://www.liacs.nl/~kosters/nvti2012.pdf pdf]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''On the Difficulty of Nonograms''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol. 37, No. 1]]
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]]
=External Links=
* [http://www.liacs.nl/~kosters/ Walter Kosters]
* [http://www.liacs.nl/~kosters/nono/sjoerd/indexeng.html Nonogram — Turn your picture into a puzzle]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=52453 The Mathematics Genealogy Project - Walter Kosters]
* [http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations] by [[Hendrik Jan Hoogeboom]] and [[Walter Kosters]]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:walterkosters.jpg|border|right|thumb|link=http://www.liacs.nl/~kosters/|Walter Kosters <ref>[http://www.liacs.nl/~kosters/ Walter Kosters]</ref> ]]
'''Walter A. Kosters''',<br/>
a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at [[Leiden University]]. His research interests include [[Neural Networks|neural networks]], [[Genetic Programming#GeneticAlgorithm|genetic algorithms]], [https://en.wikipedia.org/wiki/Analysis_of_algorithms analysis of algorithms], [https://en.wikipedia.org/wiki/Concrete_Mathematics concrete mathematics], [https://en.wikipedia.org/wiki/NP-complete NP-completeness], [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics], [https://en.wikipedia.org/wiki/Data_mining data mining] and [[Artificial Intelligence|artificial intelligence]]. Along with [[Hendrik Jan Hoogeboom]] et al., Walter Kosters works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[http://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf) slides based on [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2003'''). ''Tetris is Hard, Even to Approximate''. [http://www.informatik.uni-trier.de/~ley/db/conf/cocoon/cocoon2003.html COCOON 2003]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations]</ref>.
=Nonograms=
Along with [[Joost Batenburg]], Walter Kosters researches on [[Nonogram|Nonograms]] <ref>[http://www.liacs.nl/~kosters/nono/sjoerd/indexeng.html Nonogram — Turn your picture into a puzzle]</ref>, picture logic puzzles where a pixel grid has to be filled with black and white pixels, based on a description that indicates the lengths of the consecutive black segments for each row and column. In this puzzle type, the numbers are a form of [https://en.wikipedia.org/wiki/Discrete_tomography discrete tomography] that measures how many unbroken lines of filled-in squares there are in any given row or column. While the Nonograms that can be found in puzzle books can typically be solved by applying a series of highly local reasoning steps regarding single rows and columns, the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard].
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/k/Kosters:Walter_A=.html DBLP: Walter A. Kosters]</ref>
* [http://www.informatik.uni-trier.de/~ley/pers/hd/b/Breukelaar:Ron Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''Tetris is hard, even to approximate''. [http://www.worldscientific.com/worldscinet/ijcga International Journal of Computational Geometry & Applications], Vol. 14
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''Tetris and Decidability''. Information Processing Letters, Vol. 9
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''[http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations]''. International Journal of Intelligent Games & Simulation, Vol. 3
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2005'''). ''[http://www.ibrarian.net/navon/page.jsp?paperid=3095440&searchTerm=3+3v The Theory of Tetris]''. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
* [[Joost Batenburg]], [[Walter Kosters]] ('''2009'''). ''Solving Nonograms by combining relaxations''. [http://www.journals.elsevier.com/pattern-recognition/ Pattern Recognition], Vol. 42, No. 8
* [[Jonathan K. Vis]], [[Walter Kosters]], [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba] ('''2010'''). ''Tennis Patterns: Player, Match and Beyond''. [http://bnaic2010.uni.lu/ BNAIC 2010], [http://www.liacs.nl/~jvis/bnaic2010.pdf pdf]
* [http://dblp.uni-trier.de/pers/hd/a/Acha:Antonio_Terroba Antonio Terroba], [[Walter Kosters]], [[Jonathan K. Vis]] ('''2010'''). ''Tactical Analysis Modeling through Data Mining: Pattern Discovery in Racket Sports''. [http://www.kdir.ic3k.org/KDIR2010/ KDIR 2010], [http://www.liacs.nl/~jvis/kdir2010.pdf pdf]
* [[Jonathan K. Vis]], [[Walter Kosters]], [[Joost Batenburg]] ('''2011'''). ''Discrete Tomography: A Neural Network Approach''. [http://allserv.kahosl.be/bnaic2011/ BNAIC 2011] [http://www.liacs.nl/~jvis/bnaic2011.pdf pdf]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''Nonograms''. [http://www.liacs.nl/ LIACS - Leiden Institute of Advanced Computer Science], [http://www.liacs.nl/~kosters/nvti2012.pdf pdf]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''On the Difficulty of Nonograms''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol. 37, No. 1]]
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]]
=External Links=
* [http://www.liacs.nl/~kosters/ Walter Kosters]
* [http://www.liacs.nl/~kosters/nono/sjoerd/indexeng.html Nonogram — Turn your picture into a puzzle]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=52453 The Mathematics Genealogy Project - Walter Kosters]
* [http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations] by [[Hendrik Jan Hoogeboom]] and [[Walter Kosters]]
=References=
<references />
'''[[People|Up one level]]'''
