( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms.

, , , , , , и . CoRR, (2014)

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.

Balázs Nemes

Árpád Balázs

Balázs Csernai

Matthias Balázs

Balázs Pritz

 

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

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs., , и . SOFSEM, том 7147 из Lecture Notes in Computer Science, стр. 190-201. Springer, (2012)Drawing Cubic Graphs with at Most Five Slopes., , , и . GD, том 4372 из Lecture Notes in Computer Science, стр. 114-125. Springer, (2006)Line Percolation in Finite Projective Planes., , , , и . SIAM J. Discret. Math., 32 (2): 864-881 (2018)Finding a majority ball with majority answers., , , , , и . Electron. Notes Discret. Math., (2015)Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers., , , , , , и . CoRR, (2024)An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes., и . J. Comput. Geom., 10 (1): 1-26 (2019)Density-Based Group Testing., , , и . Information Theory, Combinatorics, and Search Theory, том 7777 из Lecture Notes in Computer Science, стр. 543-556. Springer, (2013)An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes., и . WG, том 9224 из Lecture Notes in Computer Science, стр. 266-280. Springer, (2015)On the Tree Search Problem with Non-uniform Costs., , , , и . WG, том 9224 из Lecture Notes in Computer Science, стр. 90-102. Springer, (2015)Online and Quasi-online Colorings of Wedges and Intervals., , и . SOFSEM, том 7741 из Lecture Notes in Computer Science, стр. 292-306. Springer, (2013)