Radoslav Fulek

	2012
21		Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth: Graphs that admit right angle crossing drawings. Comput. Geom. 45(4): 169-177 (2012)
20		Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth: Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discrete Math. 26(1): 305-320 (2012)
	2011
19		Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Adjacent Crossings Do Matter. Graph Drawing 2011: 343-354
18		Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas: On the Page Number of Upward Planar Directed Acyclic Graphs. Graph Drawing 2011: 391-402
17		Emilio Di Giacomo, Fabrizio Frati, Radoslav Fulek, Luca Grilli, Marcus Krug: Orthogeodesic Point-Set Embedding of Trees. Graph Drawing 2011: 52-63
16		Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Hanani-Tutte and Monotone Drawings. WG 2011: 283-294
15		Radoslav Fulek, Daniel Neuwirth: On Sets of Lines Not-Supporting Trees CoRR abs/1104.1307: (2011)
14		Radoslav Fulek, Noushin Saeedi, Deniz Sariöz: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs CoRR abs/1104.4656: (2011)
13		Radoslav Fulek, János Pach: A computational approach to Conway's thrackle conjecture. Comput. Geom. 44(6-7): 345-355 (2011)
12		Radoslav Fulek, Filip Moric, David Pritchard: Diameter bounds for planar graphs. Discrete Mathematics 311(5): 327-335 (2011)
11		Radoslav Fulek, Andrew Suk: On disjoint crossing families in geometric graphs. Electronic Notes in Discrete Mathematics 38: 367-375 (2011)
	2010
10		Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic: On polygons excluding point sets. CCCG 2010: 273-276
9		Radoslav Fulek: Coloring geometric hypergraph defined by an arrangement of half-planes. CCCG 2010: 71-74
8		Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth: On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. Graph Drawing 2010: 1-12
7		Radoslav Fulek, János Pach: A Computational Approach to Conway's Thrackle Conjecture. Graph Drawing 2010: 226-237
6		Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth: Graphs that Admit Right Angle Crossing Drawings. WG 2010: 135-146
5		Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth: A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electr. J. Comb. 17(1): (2010)
	2009
4		Radoslav Fulek, Andreas Holmsen, János Pach: Intersecting Convex Sets by Rays. Discrete & Computational Geometry 42(3): 343-358 (2009)
3		Radoslav Fulek: Linear bound on extremal functions of some forbidden patterns in 0-1 matrices. Discrete Mathematics 309(6): 1736-1739 (2009)
	2008
2		Radoslav Fulek, Andreas Holmsen, János Pach: Intersecting convex sets by rays. Symposium on Computational Geometry 2008: 385-391
	2005
1		Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto: Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. SOFSEM 2005: 376-379

Coauthor Index

1	Eyal Ackerman	[8] [20]
2	Karin Arikushi	[6] [21]
3	Ondrej Bílka	[5]
4	Kevin Buchin	[5]
5	Fabrizio Frati	[17] [18]
6	Emilio Di Giacomo	[17]
7	Luca Grilli	[17]
8	Hongmei He	[1]
9	Andreas Holmsen	[2] [4]
10	Balázs Keszegh	[6] [10] [21]
11	Masashi Kiyomi	[5]
12	Marcus Krug	[17]
13	Filip Moric	[6] [10] [12] [21]
14	Daniel Neuwirth	[15]
15	Yoshio Okamoto	[5]
16	János Pach	[2] [4] [7] [13]
17	Michael J. Pelsmajer	[16] [19]
18	David Pritchard	[12]
19	Andres J. Ruiz-Vargas	[18]
20	Noushin Saeedi	[14]
21	Deniz Sariöz	[14]
22	Marcus Schaefer	[16] [19]
23	Daniel Stefankovic	[16] [19]
24	Andrew Suk	[11]
25	Ondrej Sýkora	[1]
26	Shin-ichi Tanigawa	[5]
27	Csaba D. Tóth	[5] [6] [8] [20] [21]
28	Igor Uljarevic	[10]
29	Imrich Vrto (Imrich Vrt'o)	[1]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page