Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Kshitij, Jain"'
Autor:
Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no 2, Iss Discrete Algorithms (2023)
The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a minimum number
Externí odkaz:
https://doaj.org/article/f7a6fe26708146ef8231303a69b3523e
Autor:
Valarmathi, B.1 (AUTHOR), Kshitij, Jain2 (AUTHOR), Dimple, Rajpurohit3 (AUTHOR), Srinivasa Gupta, N.4 (AUTHOR), Harold Robinson, Y.5 (AUTHOR), Arulkumaran, G.6 (AUTHOR), Mulu, Tadesse7 (AUTHOR)
Publikováno v:
Journal of Electrical & Computer Engineering. 3/10/2023, p1-19. 19p.
Publikováno v:
National Academy Science Letters. 45:235-239
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96b09fc83742a77e2f817b844ece9b02
https://doi.org/10.1007/s40009-022-01109-7
https://doi.org/10.1007/s40009-022-01109-7
Autor:
Tulga Ersal, Kshitij Jain, James Dallas, Paramsothy Jayakumar, Zheng Dong, Michael P. Cole, Leonid Sapronov
Publikováno v:
Journal of Terramechanics. 91:11-22
In this work, a terrain estimation framework is developed for autonomous vehicles operating on deformable terrains. Previous work in this area usually relies on steady state tire operation, linearized classical terramechanics models, or on computatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab3ec0e00b3f77f108beddbd9d813c2d
https://doi.org/10.1016/j.jterra.2020.03.001
https://doi.org/10.1016/j.jterra.2020.03.001
Publikováno v:
Journal of The Institution of Engineers (India): Series A. 101:643-656
This paper presents a design aid which will help to integrate daylight in indoor lighting and optimize the use of artificial lighting in buildings for different climate zones in India. An index, average daylight factor is utilized for calculating the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92c1cc3a5419bc905a8236975fa5a7fa
https://doi.org/10.1007/s40030-020-00469-x
https://doi.org/10.1007/s40030-020-00469-x
Publikováno v:
Networks. 75:321-333
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the goal is to find an s-t cut by assigning "powers" at the vertices and r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71880cc3dcea401ccb28257e74700eef
https://doi.org/10.1002/net.21928
https://doi.org/10.1002/net.21928
Autor:
Ashok Kumar, Nishant Raj Kapoor, Chandan Swaroop Meena, Pardeep Singh, Kishor S. Kulkarni, Raffaello Cozzolino, Kshitij Jain
Publikováno v:
Sustainability, Vol 13, Iss 11949, p 11949 (2021)
Sustainability
Volume 13
Issue 21
Sustainability
Volume 13
Issue 21
Buildings are accountable for waste generation, utilization of natural resources, and ecological contamination. The construction sector is one of the biggest consumers of resources available naturally and is responsible for significant CO2 emissions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d11094b39addcc44fa6f706ceec5de59
https://www.mdpi.com/2071-1050/13/21/11949
https://www.mdpi.com/2071-1050/13/21/11949
Autor:
Veronika Irvine, Therese C. Biedl, Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Philipp Kindermann
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030307851
WG
WG
\(\varTheta _6\)-graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37025fe800e2c2a1a083cc19790beca6
https://doi.org/10.1007/978-3-030-30786-8_20
https://doi.org/10.1007/978-3-030-30786-8_20
Autor:
Yushi Uno, Anna Lubiw, Ryuhei Uehara, Kshitij Jain, David Eppstein, Erik D. Demaine, Adam Hesterberg
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030247652
WADS
WADS
We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We show that thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51a05c93d19ef33774a4e0499646c5c2
https://doi.org/10.1007/978-3-030-24766-9_26
https://doi.org/10.1007/978-3-030-24766-9_26
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319739144
Graph Drawing
Graph Drawing
Let T be an n-node tree of maximum degree 4, and let P be a set of n points in the plane with no two points on the same horizontal or vertical line. It is an open question whether T always has a planar drawing on P such that each edge is drawn as an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f88539ea2e54ee0e0866de216e33652
https://doi.org/10.1007/978-3-319-73915-1_24
https://doi.org/10.1007/978-3-319-73915-1_24