|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 7 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Khaled M. Elbassioni, Hans Raj Tiwary |
Complexity of approximating the vertex centroid of a polyhedron.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary |
Largest inscribed rectangles in convex polygons. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf |
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary |
The negative cycles polyhedron and hardness of checking some polyhedral properties. |
Annals OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf |
Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary |
Extended formulations for polygons |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary |
Extended formulations, non-negative factorizations and randomized communication protocols |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Hans Raj Tiwary |
On a cone covering problem. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Hans Raj Tiwary, Daniel Werner |
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Hans Raj Tiwary |
Complexity of Approximating the Vertex Centroid of a Polyhedron. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Raj Tiwary |
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
Extended convex hull, Polytope intersection, Polytopes, Turing reduction, Minkowski addition |
| 1 | Khaled M. Elbassioni, Hans Raj Tiwary |
On Computing the Vertex Centroid of a Polyhedron |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hans Raj Tiwary |
On Computing the Shadows and Slices of Polytopes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary |
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hans Raj Tiwary, Khaled M. Elbassioni |
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
vertex enumeration, computational geometry, graph isomorphism, polytopes, isomorphism, self-duality |
| 1 | Khaled M. Elbassioni, Hans Raj Tiwary |
On a Cone Covering Problem. |
CCCG |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hans Raj Tiwary |
On the hardness of minkowski addition and related operations. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
coNP-hardness, extended convex hull, polytope intersection, computational geometry, polytopes, turing reduction, minkowski addition |
| 1 | Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary |
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")