The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for polytopes with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1970-1976 (16) 1977-1981 (19) 1982-1986 (24) 1987-1988 (16) 1989-1990 (30) 1991-1992 (25) 1993 (23) 1994 (22) 1995 (28) 1996 (27) 1997 (21) 1998 (23) 1999 (33) 2000 (38) 2001 (33) 2002 (32) 2003 (42) 2004 (65) 2005 (33) 2006 (41) 2007 (54) 2008 (74) 2009 (58) 2010 (43) 2011 (48) 2012 (48) 2013 (57) 2014 (59) 2015 (65) 2016 (77) 2017 (61) 2018 (72) 2019 (53) 2020 (79) 2021 (72) 2022 (57) 2023 (62) 2024 (15)
Publication types (Num. hits)
article(1285) book(2) incollection(10) inproceedings(337) phdthesis(11)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 290 occurrences of 211 keywords

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