default search action
Tudor Zamfirescu
Person information
- affiliation: TU Dortmund, Department of Mathematics, Germany
- affiliation: Institute of Mathematics of the Romanian Academy, Bucharest, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Bo Wang, Liping Yuan
, Tudor Zamfirescu:
Poidge-convexity in triangular lattices. Appl. Math. Comput. 474: 128656 (2024) - 2020
- [j34]Ayesha Shabbir
The Property of Hamiltonian Connectedness in Toeplitz Graphs. Complex. 2020: 5608720:1-5608720:6 (2020) - [j33]Augustin Fruchard, Tudor Zamfirescu:
Cages of Small Length Holding Convex Bodies. Discret. Comput. Geom. 64(3): 814-837 (2020)
2010 – 2019
- 2019
- [j32]Liping Yuan, Tudor Zamfirescu:
Tetrahedral and pentahedral cages for discs. Ars Math. Contemp. 17(1): 255-270 (2019) - [j31]Liping Yuan, Tudor Zamfirescu, Yue Zhang:
Selfishness of convex bodies and discrete point sets. Eur. J. Comb. 80: 416-431 (2019) - 2018
- [j30]Dandan Li, Liping Yuan, Tudor Zamfirescu:
Right quadruple convexity. Ars Math. Contemp. 14(1): 25-38 (2018) - [j29]Carol T. Zamfirescu
Every graph occurs as an induced subgraph of some hypohamiltonian graph. J. Graph Theory 88(4): 551-557 (2018) - [j28]Ying Chai, Liping Yuan, Tudor Zamfirescu:
Rupert Property of Archimedean Solids. Am. Math. Mon. 125(6): 497-504 (2018) - 2016
- [j27]Liping Yuan, Carol T. Zamfirescu, Tudor I. Zamfirescu:
Dissecting the square into five congruent parts. Discret. Math. 339(1): 288-298 (2016) - [j26]Ayesha Shabbir
Gallai's property for graphs in lattices on the torus and the Möbius strip. Period. Math. Hung. 72(1): 1-11 (2016) - 2015
- [j25]Luis Montejano, Tudor Zamfirescu:
When is a Disk Trapped by Four Lines? Graphs Comb. 31(2): 467-476 (2015) - 2013
- [j24]Shabnam Malik, Ahmad Mahmood Qureshi, Tudor Zamfirescu:
Hamiltonicity of Cubic 3-Connected k-Halin Graphs. Electron. J. Comb. 20(1): 66 (2013) - [j23]Imre Bárány, Tudor Zamfirescu:
Holding Circles and Fixing Frames. Discret. Comput. Geom. 50(4): 1101-1111 (2013) - [j22]Ayesha Shabbir
Highly non-concurrent longest cycles in lattice graphs. Discret. Math. 313(19): 1908-1914 (2013) - [j21]Lijie Jia, Liping Yuan, Carol T. Zamfirescu, Tudor Zamfirescu:
Balanced triangulations. Discret. Math. 313(20): 2178-2191 (2013) - [j20]Ayesha Shabbir
Intersecting longest paths and longest cycles: A survey. Electron. J. Graph Theory Appl. 1(1): 56-76 (2013) - [j19]Reinhardt Euler, Tudor Zamfirescu:
On Planar Toeplitz Graphs. Graphs Comb. 29(5): 1311-1327 (2013) - [j18]Muhammad Faisal Nadeem
Planar Lattice Graphs with Gallai's Property. Graphs Comb. 29(5): 1523-1529 (2013)
2000 – 2009
- 2008
- [j17]Tudor Zamfirescu:
Minkowski's theorem for arbitrary convex sets. Eur. J. Comb. 29(8): 1956-1958 (2008) - [j16]Tudor Zamfirescu:
Polytopes passing through circles. Period. Math. Hung. 57(2): 227-230 (2008) - 2007
- [j15]Liping Yuan, Tudor Zamfirescu:
Acute Triangulations of Flat Mobius Strips. Discret. Comput. Geom. 37(4): 671-676 (2007) - [j14]Jin-ichi Itoh, Tudor Zamfirescu:
Acute triangulations of the regular dodecahedral surface. Eur. J. Comb. 28(4): 1072-1086 (2007) - [j13]Carol T. Zamfirescu, Tudor Zamfirescu:
A planar hypohamiltonian graph with 48 vertices. J. Graph Theory 55(4): 338-342 (2007) - [j12]Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonicity of Topological Grid Graphs. J. Univers. Comput. Sci. 13(11): 1791-1800 (2007) - 2005
- [j11]Hiroshi Maehara, Tudor Zamfirescu:
On the Perimeter of a Triangle in a Minkowski Plane. Am. Math. Mon. 112(6): 521-522 (2005) - 2004
- [j10]Jin-ichi Itoh, Tudor Zamfirescu:
Acute Triangulations of the Regular Icosahedral Surface. Discret. Comput. Geom. 31(2): 197-206 (2004) - 2003
- [j9]Imre Bárány, Krystyna Trybulec Kuperberg, Tudor Zamfirescu:
Total Curvature and Spiralling Shortest Paths. Discret. Comput. Geom. 30(2): 167-176 (2003) - 2000
- [j8]John R. Reay, Tudor Zamfirescu:
Hamiltonian Cycles in T-Graphs. Discret. Comput. Geom. 24(2-3): 497-502 (2000) - [j7]Ren Ding, Doris Schattschneider, Tudor Zamfirescu:
Tiling the pentagon. Discret. Math. 221(1-3): 113-124 (2000)
1990 – 1999
- 1997
- [j6]B. Menke, Tudor Zamfirescu, Christina Zamfirescu:
Intersections of longest cycles in grid graphs. J. Graph Theory 25(1): 37-52 (1997) - 1996
- [j5]René van Dal, Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonian properties of Toeplitz graphs. Discret. Math. 159(1-3): 69-81 (1996) - 1994
- [j4]Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
Every Arrangement Extends to a Spread. Comb. 14(3): 301-306 (1994) - 1992
- [j3]Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonian Properties of Grid Graphs. SIAM J. Discret. Math. 5(4): 564-570 (1992) - [c1]Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
There is a Universal Topological Plane. SCG 1992: 171-176 - 1991
- [j2]Tudor Zamfirescu:
On Two Conjectures of Franz Hering about Convex Surfaces. Discret. Comput. Geom. 6: 171-180 (1991)
1980 – 1989
- 1980
- [j1]Tudor Zamfirescu:
Three small cubic graphs with interesting hamiltonian properties. J. Graph Theory 4(3): 287-292 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: