Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Daniel Teske
@article{DBLP:journals/cse/Teske15, author = {Daniel Teske}, title = {A Comprehensive Introduction to Computational Science [Book review]}, journal = {Comput. Sci. Eng.}, volume = {17}, number = {2}, pages = {7--8}, year = {2015}, url = {https://doi.org/10.1109/MCSE.2015.29}, doi = {10.1109/MCSE.2015.29}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cse/Teske15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:series/ccis/Teske14, author = {Daniel Teske}, editor = {Anna{-}Lena Lamprecht and Tiziana Margaria}, title = {Geocoder Accuracy Ranking}, booktitle = {Process Design for Natural Scientists - An Agile Model-Driven Approach}, series = {Communications in Computer and Information Science}, volume = {500}, pages = {161--174}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-45006-2\_13}, doi = {10.1007/978-3-662-45006-2\_13}, timestamp = {Sun, 02 Jun 2019 20:42:13 +0200}, biburl = {https://dblp.org/rec/series/ccis/Teske14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/AkkermanBJT04, author = {Thorsten Akkerman and Christoph Buchheim and Michael J{\"{u}}nger and Daniel Teske}, title = {On the complexity of drawing trees nicely: corrigendum}, journal = {Acta Informatica}, volume = {40}, number = {8}, pages = {603--607}, year = {2004}, url = {https://doi.org/10.1007/s00236-004-0138-y}, doi = {10.1007/S00236-004-0138-Y}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/AkkermanBJT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.