From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

On Spanning Trees with Low Crossing Numbers.. Data Structures and Efficient Algorithms, том 594 из Lecture Notes in Computer Science, стр. 233-249. Springer, (1992)Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes., , и . Fundam. Informaticae, 58 (1): 23-37 (2003)Boundary NlC and partition controlled graph grammars.. Graph-Grammars and Their Application to Computer Science, том 291 из Lecture Notes in Computer Science, стр. 593-609. Springer, (1986)Lower Bounds for Searching Robots, some Faulty., и . PODC, стр. 447-453. ACM, (2018)A Subexponential Bound for Linear Programming., , и . Algorithmica, 16 (4/5): 498-516 (1996)Discrepancy and approximations for bounded VC-dimension., , и . Combinatorica, 13 (4): 455-466 (1993)epsilon-Nets and Simplex Range Queries., и . Discret. Comput. Geom., (1987)Quasi-Optimal Range Searching in Space of Finite VC-Dimension., и . Discret. Comput. Geom., (1989)The Discrete 2-Center Problem., , и . Discret. Comput. Geom., 20 (3): 287-305 (1998)Fat Triangles Determine Linearly Many Holes, , , , и . SIAM Journal on Computing, 23 (1): 154―169 (февраля 1994)