|
|
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 |
102 | Thomas Lam, Alexander Postnikov |
Alcoved Polytopes, I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(3), pp. 453-478, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
85 | Katta G. Murty |
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(2), pp. 211-237, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 183-198, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 125-139, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(3), pp. 469-479, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 306-309, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 257-272, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(1), pp. 29-50, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
67 | Arnaud Pêcher, Annegret Wagler |
Almost all webs are not rank-perfect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 311-328, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 543-552, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(4), pp. 528-536, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 34(3), pp. 507-521, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
58 | Andreas Paffenholz, Günter M. Ziegler |
The E t-Construction for Lattices, Spheres and Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(4), pp. 601-621, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
58 | Peter McMullen |
Mixed Fibre Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(4), pp. 521-532, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
58 | Margaret M. Bayer, A. M. Bruening, J. D. Stewart |
A Combinatorial Study of Multiplexes and Ordinary Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(1), pp. 49-63, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
58 | Christos A. Athanasiadis |
Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 21(1), pp. 117-130, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
58 | Glenn Davis |
Computing separating planes for pairs of disjoint polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985, pp. 8-14, 1985, ACM, 0-89791-163-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: ACM Symposium on Solid and Physical Modeling, Proceedings of the 15th ACM Symposium on Solid and Physical Modeling, SPM 2010, Haifa, Israel, September 1-3, 2010, pp. 1-10, 2010, ACM, 978-1-60558-984-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
56 | Stefan Felsner, Sarah Kappes |
Orthogonal Surfaces and Their CP-Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(1), pp. 19-47, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(1), pp. 81-98, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Antoine Deza, Tamás Terlaky, Yuriy Zinchenko |
A Continuous d -Step Conjecture for Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 318-327, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 192-198, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2006 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2006, Seoul, Korea, October 22-25, 2006, pp. 74-82, 2006, ACM, 1-59593-543-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 21(2), pp. 289-298, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
47 | Michael I. Hartley |
An exploration of locally projective polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(3), pp. 299-314, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 51M20, 52B15 |
47 | Komei Fukuda, Christophe Weibel |
f-Vectors of Minkowski Additions of Convex Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 37(4), pp. 503-516, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
47 | Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey |
On unions and dominants of polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(2), pp. 223-239, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
47 | Peter McMullen |
Regular Polytopes of Full Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(1), pp. 1-35, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
47 | Catherine Stenson |
Relationships Among Flag f-Vector Inequalities for Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 31(2), pp. 257-273, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
47 | Michael I. Hartley |
Quotients of Some Finite Universal Locally Projective Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 29(3), pp. 435-443, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
47 | Asa Packer |
NP - Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 28(3), pp. 349-377, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Carl W. Lee |
P.L.-Spheres, Convex Polytopes, and Stress. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 15(4), pp. 389-421, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
47 | Peter Kleinschmidt, Shmuel Onn |
Oriented Matroid Polytopes and Polyhedral Fans are Signable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 198-211, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
47 | Wu Peng, Walter G. Rudd |
Integration over polytopes (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 13th ACM Annual Conference on Computer Science, New Orleans, Louisiana, USA, 1985, pp. 422, 1985, ACM, 0-89791-150-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
44 | John McDonald 0004 |
Fractional Power Series Solutions for Systems of Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(4), pp. 501-529, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | C. Richter |
Simple Paradoxical Replications of Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 25(1), pp. 65-83, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Hugh Thomas |
New Combinatorial Descriptions of the Triangulations of Cyclic Polytopes and the Second Higher Stasheff-Tamari Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 19(4), pp. 327-342, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 46(3), pp. 181-212, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 153-164, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Edge-directions, Linear programming, Vertices, Polytopes |
41 | Samuel Fiorini, Peter C. Fishburn |
Extendability of Cyclic Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(2), pp. 151-171, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 118(8), pp. 2454-2462, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
38 | Gil Kalai, Avi Wigderson |
Neighborly Embedded Manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(3), pp. 319-324, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 338-351, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(2), pp. 273-290, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 469-499, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 159-175, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bandwidth allocation, Polyhedral combinatorics |
36 | Joseph M. Ling |
New Non-Linear Inequalities for Flag-Vectors of 4-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 37(3), pp. 455-469, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Kiyohito Nagano |
On Convex Minimization over Base Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 252-266, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
convex optimization, submodular functions |
36 | David L. Donoho |
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 35(4), pp. 617-652, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Roman Vershynin |
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 133-142, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Zhi Han, Bruce H. Krogh |
Reachability Analysis of Large-Scale Affine Systems Using Low-Dimensional Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 9th International Workshop, HSCC 2006, Santa Barbara, CA, USA, March 29-31, 2006, Proceedings, pp. 287-301, 2006, Springer, 3-540-33170-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | René Brandenberg |
Radii of Regular Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 33(1), pp. 43-55, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Shahar Mendelson, Alain Pajor, Mark Rudelson |
The Geometry of Random {-1, 1}-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 34(3), pp. 365-379, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor |
Experiences with Enumeration of Integer Projections of Parametric Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 14th International Conference, CC 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 91-105, 2005, Springer, 3-540-25411-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Jesús A. De Loera, Tyrrell B. McAllister |
Vertices of Gelfand-Tsetlin Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(4), pp. 459-470, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Jim Morey, Kamran Sedig |
Adjusting degree of visual complexity: an interactive approach for exploring four-dimensional polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 20(8-9), pp. 565-585, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(3), pp. 427-452, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(1), pp. 93-104, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Hidefumi Ohsugi |
Toric Ideals and an Infinite Family of Normal (0, 1)-Polytopes without Unimodular Regular Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(4), pp. 551-565, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Nicolas Beldiceanu, Qi Guo, Sven Thiel |
Non-overlapping Constraints between Convex Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 392-407, 2001, Springer, 3-540-42863-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Günter M. Ziegler |
Shelling Polyhedral 3-Balls and 4-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 19(2), pp. 159-174, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Harald Günzel |
On the Universal Partition Theorem for 4-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 19(4), pp. 521-551, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Torsten Langer, Alexander G. Belyaev, Hans-Peter Seidel |
Mean Value Bézier Maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Advances in Geometric Modeling and Processing, 5th International Conference, GMP 2008, Hangzhou, China, April 23-25, 2008. Proceedings, pp. 231-243, 2008, Springer, 978-3-540-79245-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(2), pp. 169-178, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 118-128, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | David Bremner |
Incremental Convex Hull Algorithms Are Not Output Sensitive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 21(1), pp. 57-68, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Kent Cantwell |
Edge-Ramsey Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 15(3), pp. 341-352, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
33 | Jan Verschelde, Karin Gatermann, Ronald Cools |
Mixed-Volume Computation by Dynamic Lifting Applied to Polynomial System Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 16(1), pp. 69-112, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
33 | Peter Kleinschmidt, Shmuel Onn |
Signable Posets and Partitionable Simplicial Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 15(4), pp. 443-466, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
33 | David Bremner |
Incremental Convex Hull Algorithms Are Not Output Sensitive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 26-35, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
33 | David Avis, Bohdan Kaluzny |
Computing monotone disjoint paths on polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 328-343, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 133-134, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
pseudotriangulations, motion planning, polytopes |
33 | Boris Aronov, Tamal K. Dey |
Polytopes in Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999, pp. 154-162, 1999, ACM, 1-58113-068-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 275-283, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1247-1252, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 113, pp. 103746, October 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 833, pp. 87-106, 2020. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
27 | Ricky I. Liu, Karola Mészáros, Avery St. Dizier |
Gelfand-Tsetlin Polytopes: A Story of Flow and Order Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 33(4), pp. 2394-2415, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 62(1), pp. 128-163, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
27 | Gabe Cunningham |
Non-Flat Regular Polytopes and Restrictions on Chiral Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 24(3), pp. 3, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. ![In: J. Inf. Process. 25, pp. 528-536, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
27 | Aleksandr N. Maksimenko |
Affine maps between graph isomorphism polytopes and Boolean quadratic polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.10081, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
27 | Aleksandr N. Maksimenko |
Boolean quadric polytopes are faces of linear ordering polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.06170, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, pp. 13-24, 2017, Springer, 978-3-319-62388-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
27 | Kai Kellner, Thorsten Theobald |
Sum of Squares Certificates for Containment of H-Polytopes in V-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(2), pp. 763-776, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
27 | Akiyoshi Tsuchiya |
The δ-vectors of reflexive polytopes and of the dual polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(10), pp. 2450-2456, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
27 | Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge |
Subgraph polytopes and independence polytopes of count matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 43(5), pp. 457-460, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
27 | Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge |
Subgraph Polytopes and Independence Polytopes of Count Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1502.02817, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
27 | Aleksandr N. Maksimenko |
A special place of Boolean quadratic polytopes among other combinatorial polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.0948, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
27 | Klaus Altmann, Benjamin Nill, Sabine Schwentner, Izolda Wiercinska |
Flow polytopes and the graph of reflexive polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(16), pp. 4992-4999, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Satoshi Murai |
Algebraic shifting of cyclic polytopes and stacked polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 307(14), pp. 1707-1721, 2007. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2003 |
RDF |
|
27 | Christos A. Athanasiadis, Jesús A. De Loera, Victor Reiner, Francisco Santos |
Fiber Polytopes for the Projections between Cyclic Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 21(1), pp. 19-47, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Louis J. Billera, Aravamuthan Sarangarajan |
All 0-1 Polytopes are Traveling Salesman Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 16(2), pp. 175-188, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Endre Boros, Peter L. Hammer |
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 18(1), pp. 245-253, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Takayuki Hibi |
Dual polytopes of rational convex polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 12(2), pp. 237-240, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Andreas Enge |
Volume Computation for Polytopes: Strategies and Performances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 4032-4038, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 9(3), pp. 259-294, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(2), pp. 155-165, 2009. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|