Hans Raj Tiwary 个人学术档案

引用次数

	总计	2019 年至今
引用	950	356
h 指数	12	8
i10 指数	12	7

120

200820092010201120122013201420152016201720182019202020212022202320244 7 7 15 37 44 76 99 108 97 89 72 66 56 59 61 42

开放获取的出版物数量

查看全部

14 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Samuel FioriniUniversité libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
Serge MassarUniversité libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
david avisMcGill University and Kyoto University在 cs.mcgill.ca 的电子邮件经过验证
Ronald de WolfCWI and University of Amsterdam在 cwi.nl 的电子邮件经过验证
Christian KnauerInstitut für Informatik, Universität Bayreuth在 uni-bayreuth.de 的电子邮件经过验证
Yuri FaenzaAssociate Professor, IEOR, Columbia University在 columbia.edu 的电子邮件经过验证
Petr KolmanCharles University in Prague在 kam.mff.cuni.cz 的电子邮件经过验证
Martin KouteckýCharles University在 iuuk.mff.cuni.cz 的电子邮件经过验证
Thomas RothvossUniversity of Washington在 math.mit.edu 的电子邮件经过验证
Endre BorosDistinguished Professor, MSIS Department, Rutgers University在 rutgers.edu 的电子邮件经过验证
Vladimir GurvichRBS and RUTCOR, Rutgers University; Higher School of Economics, Moscow, Professor在 hse.ru 的电子邮件经过验证
Jens M. SchmidtUniversität Rostock在 uni-rostock.de 的电子邮件经过验证
Saurabh RayNYU Abu Dhabi在 nyu.edu 的电子邮件经过验证
Deepak AjwaniUniversity College Dublin在 ucd.ie 的电子邮件经过验证
David BremnerUniversity of New Brunswick在 unb.ca 的电子邮件经过验证
Osamu WatanabeTokyo Institute of Technology在 c.titech.ac.jp 的电子邮件经过验证
Raimund SeidelProfessor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZI在 cs.uni-saarland.de 的电子邮件经过验证
Petr HlinenyMasaryk University, Brno, CZ在 fi.muni.cz 的电子邮件经过验证
Jakub GajarskyAssistant professor, University of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
Rico ZenklusenETH Zurich在 math.ethz.ch 的电子邮件经过验证

关注

Hans Raj Tiwary

Charles University, Prague

在 kam.mff.cuni.cz 的电子邮件经过验证 - 首页


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds S Fiorini, S Massar, S Pokutta, HR Tiwary, R De Wolf Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	272	2012
Exponential lower bounds for polytopes in combinatorial optimization S Fiorini, S Massar, S Pokutta, HR Tiwary, RD Wolf Journal of the ACM (JACM) 62 (2), 17, 2015	165	2015
On the hardness of computing intersection, union and Minkowski sum of polytopes HR Tiwary Discrete & Computational Geometry 40 (3), 469-479, 2008	120	2008
Extended formulations for polygons S Fiorini, T Rothvoß, HR Tiwary Discrete & computational geometry 48 (3), 658-668, 2012	69	2012
Extended formulations, nonnegative factorizations, and randomized communication protocols Y Faenza, S Fiorini, R Grappe, HR Tiwary Mathematical Programming 153 (1), 75-94, 2015	60	2015
On the extension complexity of combinatorial polytopes D Avis, HR Tiwary Mathematical Programming 153, 95-115, 2015	55	2015
Largest inscribed rectangles in convex polygons C Knauer, L Schlipf, JM Schmidt, HR Tiwary Journal of discrete algorithms 13, 78-85, 2012	45	2012
The negative cycles polyhedron and hardness of checking some polyhedral properties E Boros, K Elbassioni, V Gurvich, HR Tiwary Annals of Operations Research 188 (1), 63-76, 2011	23	2011
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems C Knauer, HR Tiwary, D Werner Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 649-660, 2011	20	2011
Extension complexity, MSO logic, and treewidth P Kolman, M Koutecký, HR Tiwary Discrete Mathematics & Theoretical Computer Science 22 (Discrete Algorithms), 2020	18*	2020
On computing the shadows and slices of polytopes HR Tiwary Arxiv preprint arXiv:0804.4150, 2008	17	2008
Generalized probabilistic theories and conic extensions of polytopes S Fiorini, S Massar, MK Patra, HR Tiwary Journal of Physics A: Mathematical and Theoretical 48 (2), 025302, 2014	15	2014
On the hardness of minkowski addition and related operations HR Tiwary Proceedings of the twenty-third annual symposium on Computational geometry …, 2007	9	2007
A generalization of extension complexity that captures P D Avis, HR Tiwary Information Processing Letters 115 (6-8), 588-593, 2015	8	2015
Complexity of some polyhedral enumeration problems HR Tiwary	7	2008
Parameterized extension complexity of independent set and related problems J Gajarský, P Hliněný, HR Tiwary Discrete Applied Mathematics 248, 56-67, 2018	6	2018
Complexity of approximating the vertex centroid of a polyhedron K Elbassioni, HR Tiwary Theoretical Computer Science 421, 56-61, 2012	6	2012
On computing the centroid of the vertices of an arrangement and related problems D Ajwani, S Ray, R Seidel, HR Tiwary Algorithms and Data Structures, 519-528, 2007	6	2007
On the largest convex subsets in Minkowski sums HR Tiwary Information Processing Letters 114 (8), 405-407, 2014	5	2014
On a cone covering problem K Elbassioni, HR Tiwary Computational Geometry 44 (3), 129-134, 2011	5	2011

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用