Search results for "polytopes"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
102	Thomas Lam, Alexander Postnikov	Alcoved Polytopes, I.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
85	Katta G. Murty	A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Convex polytopes and their dual polytopes, FCFs (facetal constraint functions), Enumeration of extreme points, Mukkas, Mukkadvayams, Central problem and strategy for its solution, Nearest points, Linear and convex quadratic programs, Segments, Adjacency
82	Raman Sanyal, Axel Werner, Günter M. Ziegler	On Kalai's Conjectures Concerning Centrally Symmetric Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Centrally symmetric convex polytopes, f-vector inequalities, Flag vectors, Kalai’s 3 d -conjecture, Equivariant rigidity, Hanner polytopes, Hansen polytopes, Central hypersimplices
80	Adam N. Letchford, Michael Malmros Sørensen	Binary Positive Semidefinite Matrices and Associated Integer Polytopes.	IPCO	2008	DBLP DOI BibTeX RDF	semidefinite programming, Polyhedral combinatorics
77	Hans Raj Tiwary	On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Extended convex hull, Polytope intersection, Polytopes, Turing reduction, Minkowski addition
75	Hans Raj Tiwary	On the hardness of minkowski addition and related operations.	SCG	2007	DBLP DOI BibTeX RDF	coNP-hardness, extended convex hull, polytope intersection, computational geometry, polytopes, turing reduction, minkowski addition
74	Piotr Mankiewicz, Nicole Tomczak-Jaegermann	Stability Properties of Neighbourly Random Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Symmetric random polytopes, Subgaussian vectors, m-Neighbourly polytopes
69	Rafal Latala, Piotr Mankiewicz, Krzysztof Oleszkiewicz, Nicole Tomczak-Jaegermann	Banach-Mazur Distances and Projections on Random Subgaussian Polytopes.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
67	Arnaud Pêcher, Annegret Wagler	Almost all webs are not rank-perfect.	Math. Program.	2006	DBLP DOI BibTeX RDF	Rank-perfect graph, Stable set polytope, (Non-)rank facet, Web
66	Prahladh Harsha, Adam R. Klivans, Raghu Meka	An invariance principle for polytopes.	STOC	2010	DBLP DOI BibTeX RDF	average sensitivity, invariance principles, polytopes, pseudorandom generators, contingency tables, noise sensitivity, limit theorems, agnostic learning
63	Efim D. Gluskin, Alexander E. Litvak	Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Asymmetry of polytopes, Illumination parameter, Measures of symmetry, Polytopes with few vertices, Vertex index
58	Catherine Stenson	Families of Tight Inequalities for Polytopes.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
58	Andreas Paffenholz, Günter M. Ziegler	The E t-Construction for Lattices, Spheres and Polytopes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
58	Peter McMullen	Mixed Fibre Polytopes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
58	Margaret M. Bayer, A. M. Bruening, J. D. Stewart	A Combinatorial Study of Multiplexes and Ordinary Polytopes.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
58	Christos A. Athanasiadis	Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
58	Glenn Davis	Computing separating planes for pairs of disjoint polytopes.	SCG	1985	DBLP DOI BibTeX RDF	extreme halfspace, extreme plane, separating plane, convex hull, polytope, projective transformation, hidden surface elimination
56	Naama Mayer, Efi Fogel, Dan Halperin	Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space.	Symposium on Solid and Physical Modeling	2010	DBLP DOI BibTeX RDF
56	Stefan Felsner, Sarah Kappes	Orthogonal Surfaces and Their CP-Orders.	Order	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C62, 52B05, 68R10, 06A07
56	Christian Bey, Martin Henk, Jörg M. Wills	Notes on the Roots of Ehrhart Polynomials.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
55	Antoine Deza, Tamás Terlaky, Yuriy Zinchenko	A Continuous d -Step Conjecture for Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path
55	Hans Raj Tiwary, Khaled M. Elbassioni	On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.	SCG	2008	DBLP DOI BibTeX RDF	vertex enumeration, computational geometry, graph isomorphism, polytopes, isomorphism, self-duality
55	Rachid Seghir, Vincent Loechner	Memory optimization by counting points in integer transformations of parametric polytopes.	CASES	2006	DBLP DOI BibTeX RDF	array linearization, cache access optimization, counting lattice points in polytopes, exact memory size computation, polytope model
49	Michael I. Hartley	All Polytopes Are Quotients, and Isomorphic Polytopes Are Quotients by Conjugate Subgroups.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
47	Michael I. Hartley	An exploration of locally projective polytopes.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 51M20, 52B15
47	Komei Fukuda, Christophe Weibel	f-Vectors of Minkowski Additions of Convex Polytopes.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
47	Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey	On unions and dominants of polytopes.	Math. Program.	2004	DBLP DOI BibTeX RDF
47	Peter McMullen	Regular Polytopes of Full Rank.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
47	Catherine Stenson	Relationships Among Flag f-Vector Inequalities for Polytopes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
47	Michael I. Hartley	Quotients of Some Finite Universal Locally Projective Polytopes.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
47	Asa Packer	NP - Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
47	Carl W. Lee	P.L.-Spheres, Convex Polytopes, and Stress.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
47	Peter Kleinschmidt, Shmuel Onn	Oriented Matroid Polytopes and Polyhedral Fans are Signable.	IPCO	1995	DBLP DOI BibTeX RDF
47	Wu Peng, Walter G. Rudd	Integration over polytopes (abstract only).	ACM Conference on Computer Science	1985	DBLP DOI BibTeX RDF
44	John McDonald 0004	Fractional Power Series Solutions for Systems of Equations.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
44	C. Richter	Simple Paradoxical Replications of Sets.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
44	Hugh Thomas	New Combinatorial Descriptions of the Triangulations of Cyclic Polytopes and the Second Higher Stasheff-Tamari Posets.	Order	2002	DBLP DOI BibTeX RDF	cyclic polytopes, 2-dimension, higher Stasheff-Tamari posets, triangulations
41	Fatima K. Abu Salem, Laurence Tianruo Yang	Parallel methods for absolute irreducibility testing.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Bivariate polynomials, Absolute irreducibility, Newton polytopes, Bulk synchronous model, Parallel algorithms, Multivariate polynomials
41	Shmuel Onn, Uriel G. Rothblum	The use of edge-directions and linear programming to enumerate vertices.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Edge-directions, Linear programming, Vertices, Polytopes
41	Samuel Fiorini, Peter C. Fishburn	Extendability of Cyclic Orders.	Order	2003	DBLP DOI BibTeX RDF	poset dimension, polytopes, cyclic orders
40	Federico Ardila, Thomas Bliem, Dido Salazar	Gelfand-Tsetlin polytopes and Feigin-Fourier-Littelmann-Vinberg polytopes as marked poset polytopes.	J. Comb. Theory, Ser. A	2011	DBLP DOI BibTeX RDF
38	Gil Kalai, Avi Wigderson	Neighborly Embedded Manifolds.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Neighborliness, Cyclic polytopes, Continuous hashing, Polytopes, Convex bodies
38	Jesús A. De Loera, Shmuel Onn	All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.	IPCO	2004	DBLP DOI BibTeX RDF
36	Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel	FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11, 90C30, 90C57, 90C60
36	Ross M. Richardson, Van H. Vu, Lei Wu	An Inscribing Model for Random Polytopes.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
36	Javier Marenco, Annegret Wagler	Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Bandwidth allocation, Polyhedral combinatorics
36	Joseph M. Ling	New Non-Linear Inequalities for Flag-Vectors of 4-Polytopes.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
36	Kiyohito Nagano	On Convex Minimization over Base Polytopes.	IPCO	2007	DBLP DOI BibTeX RDF	convex optimization, submodular functions
36	David L. Donoho	High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
36	Roman Vershynin	Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method.	FOCS	2006	DBLP DOI BibTeX RDF
36	Zhi Han, Bruce H. Krogh	Reachability Analysis of Large-Scale Affine Systems Using Low-Dimensional Polytopes.	HSCC	2006	DBLP DOI BibTeX RDF
36	René Brandenberg	Radii of Regular Polytopes.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
36	Shahar Mendelson, Alain Pajor, Mark Rudelson	The Geometry of Random {-1, 1}-Polytopes.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
36	Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor	Experiences with Enumeration of Integer Projections of Parametric Polytopes.	CC	2005	DBLP DOI BibTeX RDF
36	Jesús A. De Loera, Tyrrell B. McAllister	Vertices of Gelfand-Tsetlin Polytopes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
36	Jim Morey, Kamran Sedig	Adjusting degree of visual complexity: an interactive approach for exploring four-dimensional polytopes.	Vis. Comput.	2004	DBLP DOI BibTeX RDF	High-dimensional geometry, Computer-aided visual reasoning, Dynamic exploration, Interactive techniques, Mathematical visualization
36	Richard Ehrenborg, Harold Fox	Inequalities for cd-Indices of Joins and Products of Polytopes.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 06A07, 52B05
36	Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke	Enumerating Foldings and Unfoldings Between Polygons and Polytopes.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
36	Hidefumi Ohsugi	Toric Ideals and an Infinite Family of Normal (0, 1)-Polytopes without Unimodular Regular Triangulations.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
36	Nicolas Beldiceanu, Qi Guo, Sven Thiel	Non-overlapping Constraints between Convex Polytopes.	CP	2001	DBLP DOI BibTeX RDF
36	Günter M. Ziegler	Shelling Polyhedral 3-Balls and 4-Polytopes.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
36	Harald Günzel	On the Universal Partition Theorem for 4-Polytopes.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
33	Torsten Langer, Alexander G. Belyaev, Hans-Peter Seidel	Mean Value Bézier Maps.	GMP	2008	DBLP DOI BibTeX RDF	Mathematical foundations of CAGD, Bézier surfaces, Computer Graphics, Shape representation, Curves and Surfaces, Mean value coordinates
33	Jon Lee 0001	Cropped Cubes.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	totally dual integral, ideal matrix, generalized set covering, clipped cube, cropped cube, balanced matrix, linear program, integer program, polytope
33	Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo	On the Face Lattice of the Metric Polytope.	JCDCG	2002	DBLP DOI BibTeX RDF
33	David Bremner	Incremental Convex Hull Algorithms Are Not Output Sensitive.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
33	Kent Cantwell	Edge-Ramsey Theory.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
33	Jan Verschelde, Karin Gatermann, Ronald Cools	Mixed-Volume Computation by Dynamic Lifting Applied to Polynomial System Solving.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
33	Peter Kleinschmidt, Shmuel Onn	Signable Posets and Partitionable Simplicial Complexes.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
33	David Bremner	Incremental Convex Hull Algorithms Are Not Output Sensitive.	ISAAC	1996	DBLP DOI BibTeX RDF
33	David Avis, Bohdan Kaluzny	Computing monotone disjoint paths on polytopes.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy
33	Günter Rote	Pseudotriangulations, polytopes, and how to expand linkages.	SCG	2002	DBLP DOI BibTeX RDF	pseudotriangulations, motion planning, polytopes
33	Boris Aronov, Tamal K. Dey	Polytopes in Arrangements.	SCG	1999	DBLP DOI BibTeX RDF	plane arrangements, polytopes, combinatorial complexity, combinatorial geometry, hyperplane arrangements
33	Alexander I. Barvinok	Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization.	FOCS	1995	DBLP DOI BibTeX RDF	integral geometry, higher-dimensional polytopes, average case behavior, linear optimization problem, computational geometry, combinatorial optimization, travelling salesman problems, traveling salesman problem, assignment problem, linear functions
30	Christoph Fünfzig, Dominique Michelucci, Sebti Foufou	Polytope-based computation of polynomial ranges.	SAC	2010	DBLP DOI BibTeX RDF	polynomial ranges, polytopes, multivariate polynomials, Bernstein polynomials
27	Isabel Hubard, Elías Mochán	All polytopes are coset geometries: Characterizing automorphism groups of k-orbit abstract polytopes.	Eur. J. Comb.	2023	DBLP DOI BibTeX RDF
27	Ei Ando, Shuji Kijima	An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
27	Rado Rakotonarivo	Sur la combinatoire des polytopes en nombres entiers, génération aléatoire et enumération. (On the combinatorics of lattice polytopes, random sampling and enumeration).		2020	RDF
27	Ricky I. Liu, Karola Mészáros, Avery St. Dizier	Gelfand-Tsetlin Polytopes: A Story of Flow and Order Polytopes.	SIAM J. Discret. Math.	2019	DBLP DOI BibTeX RDF
27	Karola Mészáros, Alejandro H. Morales, Jessica Striker	On Flow Polytopes, Order Polytopes, and Certain Faces of the Alternating Sign Matrix Polytope.	Discret. Comput. Geom.	2019	DBLP DOI BibTeX RDF
27	Gabe Cunningham	Non-Flat Regular Polytopes and Restrictions on Chiral Polytopes.	Electron. J. Comb.	2017	DBLP DOI BibTeX RDF
27	Jin Akiyama, Sin Hitotumatu, Motonaga Ishii, Akihiro Matsuura, Ikuro Sato, Shun Toyoshima	A recursive Algorithm for the k-face Numbers of Wythoffian-n-polytopes Constructed from Regular Polytopes.	J. Inf. Process.	2017	DBLP DOI BibTeX RDF
27	Aleksandr N. Maksimenko	Affine maps between graph isomorphism polytopes and Boolean quadratic polytopes.	CoRR	2017	DBLP BibTeX RDF
27	Aleksandr N. Maksimenko	Boolean quadric polytopes are faces of linear ordering polytopes.	CoRR	2017	DBLP BibTeX RDF
27	Ei Ando, Shuji Kijima	An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes.	COCOON	2017	DBLP DOI BibTeX RDF
27	Kai Kellner, Thorsten Theobald	Sum of Squares Certificates for Containment of H-Polytopes in V-Polytopes.	SIAM J. Discret. Math.	2016	DBLP DOI BibTeX RDF
27	Akiyoshi Tsuchiya	The δ-vectors of reflexive polytopes and of the dual polytopes.	Discret. Math.	2016	DBLP DOI BibTeX RDF
27	Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge	Subgraph polytopes and independence polytopes of count matroids.	Oper. Res. Lett.	2015	DBLP DOI BibTeX RDF
27	Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge	Subgraph Polytopes and Independence Polytopes of Count Matroids.	CoRR	2015	DBLP BibTeX RDF
27	Aleksandr N. Maksimenko	A special place of Boolean quadratic polytopes among other combinatorial polytopes.	CoRR	2014	DBLP BibTeX RDF
27	Klaus Altmann, Benjamin Nill, Sabine Schwentner, Izolda Wiercinska	Flow polytopes and the graph of reflexive polytopes.	Discret. Math.	2009	DBLP DOI BibTeX RDF
27	Satoshi Murai	Algebraic shifting of cyclic polytopes and stacked polytopes.	Discret. Math.	2007	DBLP DOI BibTeX RDF
27	François Gannaz	Approximation de convexes par des polytopes et décomposition approchée de normes. (Approximation of convex bodies by polytopes and approximated norm decomposition).		2003	RDF
27	Christos A. Athanasiadis, Jesús A. De Loera, Victor Reiner, Francisco Santos	Fiber Polytopes for the Projections between Cyclic Polytopes.	Eur. J. Comb.	2000	DBLP DOI BibTeX RDF
27	Louis J. Billera, Aravamuthan Sarangarajan	All 0-1 Polytopes are Traveling Salesman Polytopes.	Comb.	1996	DBLP DOI BibTeX RDF
27	Endre Boros, Peter L. Hammer	Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions.	Math. Oper. Res.	1993	DBLP DOI BibTeX RDF
27	Takayuki Hibi	Dual polytopes of rational convex polytopes.	Comb.	1992	DBLP DOI BibTeX RDF
24	Andreas Enge	Volume Computation for Polytopes: Strategies and Performances.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Algorithms, Volume, Convex polytope
24	Cristina Vagnoni, Marino Zennaro	The Analysis and the Representation of Balanced Complex Polytopes in 2D.	Found. Comput. Math.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52B12, 52B55, 65Y99
24	Christos A. Athanasiadis	On the Graph Connectivity of Skeleta of Convex Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Balinski’s theorem, Incidence graph, Skeleton, Convex polytope, Cell complex, Vertex connectivity