Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(26)
Balazs Keszegh (Balázs Keszegh)
7
Janos Pach (János Pach)
6
Geza Toth (Géza Tóth)
4
Friedrich Eisenbrand
3
Balazs Patkos (Balázs Patkós)
3
Conferences
(3)
SODA
2
GD
1
WINE
1
Journals
(8)
CORR
8
DCG
2
FFA
2
JGAA
1
COMGEO
1
Keywords
(43)
Embed
Subscribe
Academic
Authors
Domotor Palvolgyi
Edit
Domotor Palvolgyi (Dömötör Pálvölgyi)
Eotvos Lorand University (University of Budapest)
Publications: 29
|
Citations: 35
|
G-Index: 5
|
H-Index: 4
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Scientific Computing
,
Algorithms & Theory
,
Computer Vision
View FAQ about top research area and research interests
Collaborated with
26 co-authors
from 2006 to 2011
; Cited by
38 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(29)
BibTeX
|
RIS
|
RefWorks
Download
Bin Packing via Discrepancy of Permutations
(
Citations: 1
)
Friedrich Eisenbrand
,
Dömötör Pálvölgyi
,
Thomas Rothvoß
Conference:
ACM-SIAM Symposium on Discrete Algorithms - SODA
, pp. 476-481, 2011
Lower bounds on the obstacle number of graphs
Padmini Mukkamala
,
János Pach
,
Dömötör Pálvölgyi
Journal:
Computing Research Repository - CORR
, vol. abs/1103.2, 2011
Octants are Cover Decomposable
Balázs Keszegh
,
Dömötör Pálvölgyi
Journal:
Computing Research Repository - CORR
, vol. abs/1101.3, 2011
Convex Polygons are Cover-Decomposable
(
Citations: 6
)
Dömötör Pálvölgyi
,
Géza Tóth
Journal:
Discrete & Computational Geometry - DCG
, vol. 43, no. 3, pp. 483-496, 2010
Indecomposable Coverings with Concave Polygons
(
Citations: 6
)
Dömötör Pálvölgyi
Journal:
Discrete & Computational Geometry - DCG
, vol. 44, no. 3, pp. 577-588, 2010
Order by:
Citations
(35 times by 22 publications)
P01-527 - Home visit in mental health care: the “italian way”
S. Ferrari
,
L. Malavolta
,
M. R. Laghezzi Ortolani
,
S. Mimmi
,
M. Rigatelli
Journal:
European Psychiatry - EUR PSYCHIAT
, vol. 26, pp. 531-531, 2011
Minimum-Segment Convex Drawings of 3Connected Cubic Plane Graphs
Debajyoti Mondal
,
Rahnuma Islam Nishat
,
Sudip Biswas
Journal:
Journal of Combinatorial Optimization - JCO
, pp. 1-21, 2011
Optimally Decomposing Coverings with Translates of a Convex Polygon
Matt Gibson
,
Kasturi Varadarajan
Published in 2011.
Convex Polygons are Cover-Decomposable
(
Citations: 6
)
Dömötör Pálvölgyi
,
Géza Tóth
Journal:
Discrete & Computational Geometry - DCG
, vol. 43, no. 3, pp. 483-496, 2010
Indecomposable Coverings with Concave Polygons
(
Citations: 6
)
Dömötör Pálvölgyi
Journal:
Discrete & Computational Geometry - DCG
, vol. 44, no. 3, pp. 577-588, 2010
Comments