Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Widmayer, Peter
206  Ergebnisse:
Personensuche X
?
1

Programmierung mit PASCAL 

Eine Einführung für Programmieranfänger  SpringerLink, Bücher
Ottmann, Thomas ; Widmayer, Peter - 9. Aufl. 2018 . , 2018
Link: https://doi.org/10.1007/..
 
?
2

Algorithmen und Datenstrukturen 

SpringerLink, Bücher
Ottmann, Thomas ; Widmayer, Peter - 6. Aufl. 2017 . , 2017
Link: https://doi.org/10.1007/..
 
?
3

Programmierung mit Pascal 

Springer eBook Collection, Computer Science and Engineering
Ottmann, Thomas ; Widmayer, Peter - 7., durchgesehene Auflage . , 2003
Link: http://dx.doi.org/10.100..
 
?
4

Sequence Hypergraphs: Paths, Flows, and Cuts:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,
Böhmová, Kateřina ; Chalopin, Jérémie ; Mihalák, Matúš.. - p. 191-215 , 2018
Link: https://doi.org/10.1007/..
 
?
5

A better scoring model for de novo peptide sequencing: the ..:

Tschager, Thomas ; Rösch, Simon ; Gillet, Ludovic.
Algorithms for Molecular Biology.  12 (2017)  1 - p. , 2017
Link: https://doi.org/10.1186/..
 
?
6

Algorithms and Complexity 

9th International Conference, CIAC 2015, Paris, France, May...  Lecture Notes in Computer Science ; 9079;SpringerLink, Bücher
Paschos, Vangelis Th ; Widmayer, Peter , 2015
Link: https://doi.org/10.1007/..
 
?
7

Mapping Simple Polygons: The Power of Telling Convex from R..:

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann..
ACM Transactions on Algorithms.  11 (2015)  4 - p. 1-16 , 2015
Link: https://doi.org/10.1145/..
 
?
8

Selecting vertex disjoint paths in plane graphs:

Flier, Holger ; Mihalák, Matúš ; Widmayer, Peter...
Networks.  66 (2015)  2 - p. 136-144 , 2015
Link: https://doi.org/10.1002/..
 
?
9

Mapping Simple Polygons : The Power of Telling Convex fr..:

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann..
ACM Transactions on Algorithms (TALG).  11 (2015)  4 - p. 1-16 , 2015
Link: https://dl.acm.org/doi/1..
 
?
10

FUN with algorithms:

Widmayer, Peter
Theoretical Computer Science.  586 (2015)  - p. 1 , 2015
Link: https://doi.org/10.1016/..
 
?
11

Fun with Algorithms 

7th International Conference, FUN 2014, Lipari Island, Sici...  Lecture Notes in Computer Science ; 8496;SpringerLink, Bücher
Ferro, Alfredo ; Luccio, Fabrizio ; Widmayer, Peter , 2014
Link: https://doi.org/10.1007/..
 
?
12

Highlights from ACM SIGSPATIAL GIS 2013: the 21st ACM SIGSP..:

Kröger, Peer ; Krumm, John ; Widmayer, Peter
SIGSPATIAL Special.  6 (2014)  1 - p. 2-4 , 2014
Link: https://dl.acm.org/doi/1..
 
?
13

Improved bounds for the conflict-free chromatic art gallery..:

, In: Proceedings of the thirtieth annual symposium on Computational geometry,
Bärtschi, Andreas ; Ghosh, Subir Kumar ; Mihalák, Matúš.. - p. 144-153 , 2014
Link: https://dl.acm.org/doi/1..
 
?
14

Highlights from ACM SIGSPATIAL GIS 2013: the 21st ACM SIGSP..:

Kröger, Peer ; Krumm, John ; Widmayer, Peter
SIGSPATIAL Special.  6 (2014)  1 - p. 2-4 , 2014
Link: https://doi.org/10.1145/..
 
?
15

Approximately Counting Approximately-Shortest Paths in Dire..:

Mihalák, Matúš ; Šrámek, Rastislav ; Widmayer, Peter
Theory of Computing Systems.  58 (2014)  1 - p. 45-59 , 2014
Link: https://doi.org/10.1007/..
 
1-15