default search action
Roman N. Karasev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j30]Sergey Avvakumov, Roman N. Karasev, Arkadiy Skopenkov:
Stronger Counterexamples to the Topological Tverberg Conjecture. Comb. 43(4): 717-727 (2023) - [j29]Roman N. Karasev, Arkadiy Skopenkov:
Some 'Converses' to Intrinsic Linking Theorems. Discret. Comput. Geom. 70(3): 921-930 (2023) - [j28]Hamid Reza Daneshpajouh, Roman N. Karasev, Alexey Volovikov:
Hedetniemi's conjecture from the topological viewpoint. J. Comb. Theory A 195: 105721 (2023) - [j27]Sergey Avvakumov
, Roman N. Karasev
Equipartition of a Segment. Math. Oper. Res. 48(1): 194-202 (2023) - 2022
- [j26]Karim A. Adiprasito
A Subexponential Size Triangulation of ℝPn. Comb. 42(1): 1-8 (2022) - [j25]Pavle V. M. Blagojevic
More Bisections by Hyperplane Arrangements. Discret. Comput. Geom. 67(1): 33-64 (2022) - 2021
- [j24]Vuong Bui
On the Carathéodory Number for Strong Convexity. Discret. Comput. Geom. 65(3): 680-692 (2021) - 2020
- [i3]Roman N. Karasev, Arkadiy Skopenkov:
Some 'converses' to intrinsic linking theorems. CoRR abs/2008.02523 (2020)
2010 – 2019
- 2019
- [j23]Roman N. Karasev:
Residues and the Combinatorial Nullstellensatz. Period. Math. Hung. 78(2): 157-165 (2019) - [i2]Sergey Avvakumov, Roman N. Karasev, Arkadiy Skopenkov:
Stronger counterexamples to the topological Tverberg conjecture. CoRR abs/1908.08731 (2019) - 2018
- [j22]Pavle V. M. Blagojevic, Roman N. Karasev, Alexander Magazinov
A Center Transversal Theorem for an Improved Rado Depth. Discret. Comput. Geom. 60(2): 406-419 (2018) - 2017
- [i1]Alexey Balitskiy, Roman N. Karasev, Alexander Tsigler:
Optimality of codes with respect to error probability in Gaussian noise. CoRR abs/1701.07986 (2017) - 2015
- [j21]Imre Bárány, Andreas F. Holmsen, Roman N. Karasev:
Topology of Geometric Joins. Discret. Comput. Geom. 53(2): 402-413 (2015) - [j20]Roman N. Karasev, Jan Kyncl
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. Discret. Comput. Geom. 54(3): 610-636 (2015) - 2014
- [j19]Roman N. Karasev, Benjamin Matschke
Projective Center Point and Tverberg Theorems. Discret. Comput. Geom. 52(1): 88-101 (2014) - 2013
- [j18]Arseniy V. Akopyan, Roman N. Karasev:
Cutting the Same Fraction of Several Measures. Discret. Comput. Geom. 49(2): 402-410 (2013) - [j17]Roman N. Karasev:
An Analogue of Gromov's Waist Theorem for Coloring the Cube. Discret. Comput. Geom. 49(3): 444-453 (2013) - [j16]Arseniy V. Akopyan, Roman N. Karasev:
Inscribing a regular octahedron into polytopes. Discret. Math. 313(1): 122-128 (2013) - 2012
- [j15]Roman N. Karasev:
Analogues of the central point theorem for families with d-intersection property in ℝ d. Comb. 32(6): 689-702 (2012) - [j14]Roman N. Karasev:
A Simpler Proof of the Boros-Füredi-Bárány-Pach-Gromov Theorem. Discret. Comput. Geom. 47(3): 492-495 (2012) - [j13]Arseniy V. Akopyan, Roman N. Karasev:
Kadets-Type Theorems for Partitions of a Convex Body. Discret. Comput. Geom. 48(3): 766-776 (2012) - [j12]Imre Bárány, Roman N. Karasev:
Notes About the Carathéodory Number. Discret. Comput. Geom. 48(3): 783-792 (2012) - 2011
- [j11]Roman N. Karasev:
Tverberg-Type Theorems for Intersecting by Rays. Discret. Comput. Geom. 45(2): 340-347 (2011) - [j10]Luis Montejano, Roman N. Karasev:
Topological transversals to a family of convex sets. Discret. Comput. Geom. 46(2): 283-300 (2011) - [j9]Pavle V. M. Blagojevic, Boris Bukh, Roman N. Karasev:
Turán numbers for Ks, t-free graphs: topological obstructions and algebraic constructions. Electron. Notes Discret. Math. 38: 141-145 (2011) - 2010
- [j8]Roman N. Karasev:
Equipartition of a Measure by (Zp)k-Invariant Fans. Discret. Comput. Geom. 43(2): 477-481 (2010) - [j7]Roman N. Karasev:
Knaster's Problem for (Z2)k-Symmetric Subsets of the Sphere S2k-1. Discret. Comput. Geom. 44(2): 429-438 (2010) - [j6]Roman N. Karasev:
A Measure of Non-convexity in the Plane and the Minkowski Sum. Discret. Comput. Geom. 44(3): 608-621 (2010)
2000 – 2009
- 2008
- [j5]Roman N. Karasev:
Piercing Families of Convex Sets with the d -Intersection Property in R d . Discret. Comput. Geom. 39(4): 766-777 (2008) - 2007
- [j4]Roman N. Karasev:
Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals. Discret. Comput. Geom. 38(3): 513-525 (2007) - 2005
- [j3]Roman N. Karasev:
Partitions of a Polytope and Mappings of a Point Set to Facets. Discret. Comput. Geom. 34(1): 25-45 (2005) - 2002
- [j2]Roman N. Karasev:
On a Conjecture of A. Bezdek. Discret. Comput. Geom. 27(3): 419-439 (2002) - 2000
- [j1]Roman N. Karasev:
Transversals for Families of Translates of a Two-Dimensional Convex Compact Set. Discret. Comput. Geom. 24(2-3): 345-354 (2000)
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 21:21 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: