E-LIB Suche - Ergebnisse für: Kulkarni, Shubhang

1

Efficient Feedback and Partial Credit Grading for Proof Blo..:

, In: Lecture Notes in Computer Science; Artificial Intelligence in Education,

Poulsen, Seth ; Kulkarni, Shubhang ; Herman, Geoffrey. - p. 502-514 , 2023

2

Benchmarking Partial Credit Grading Algorithms for Proof Bl..:

, In: Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners' and Doctoral Consortium; Lecture Notes in Computer Science,

Poulsen, Seth ; Kulkarni, Shubhang ; Herman, Geoffrey. - p. 199-203 , 2022

Link: https://doi.org/10.1007/..

3

The Maximum Binary Tree Problem:

Chandrasekaran, Karthekeyan ; Grigorescu, Elena ; Istrate, Gabriel...
Algorithmica. 83 (2021) 8 - p. 2427-2468 , 2021

Link: https://doi.org/10.1007/..

4

Anterolateral Ligament Injury in Knee Dislocations:

Marwan, Yousef ; Kulkarni, Shubhang ; Addar, Abdullah...
Arthroscopy: The Journal of Arthroscopic & Related Surgery. 34 (2018) 6 - p. 1891-1897 , 2018

Link: https://doi.org/10.1016/..

5

Covered Stent Placement for Duodenocolic Fistula: A Novel U..:

Kulkarni, Shubhang ; Hay, Chris ; Moss, Jonathan G..
Journal of Vascular and Interventional Radiology. 22 (2011) 5 - p. 729-730 , 2011

Link: https://doi.org/10.1016/..

6

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest ..:

Chandrasekaran, Karthekeyan ; Chekuri, Chandra ; Fiorini, Samuel..
http://arxiv.org/abs/2303.12850. , 2023

Link: http://arxiv.org/abs/230..

7

Splitting-off in Hypergraphs:

Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás.
http://arxiv.org/abs/2307.08555. , 2023

Link: http://arxiv.org/abs/230..

8

Efficient Feedback and Partial Credit Grading for Proof Blo..:

Poulsen, Seth ; Kulkarni, Shubhang ; Herman, Geoffrey.
http://arxiv.org/abs/2204.04196. , 2022

Link: http://arxiv.org/abs/220..

9

Fixed-Parameter Algorithms for Longest Heapable Subsequence..:

Chandrasekaran, Karthekeyan ; Grigorescu, Elena ; Istrate, Gabriel...
http://arxiv.org/abs/2110.00495. , 2021

Link: http://arxiv.org/abs/211..

10

Fixed-Parameter Algorithms for Longest Heapable Subsequence..:

Chandrasekaran, Karthekeyan ; Grigorescu, Elena ; Istrate, Gabriel...
doi:10.4230/LIPIcs.IPEC.2020.7. , 2020

Link: https://doi.org/10.4230/..

11

The Maximum Binary Tree Problem:

Chandrasekaran, Karthekeyan ; Grigorescu, Elena ; Istrate, Gabriel...
doi:10.4230/LIPIcs.ESA.2020.30. , 2020

Link: https://doi.org/10.4230/..

12

Locally Decodable/Correctable Codes for Insertions and Dele..:

Block, Alexander R ; Blocki, Jeremiah ; Grigorescu, Elena..
doi:10.4230/LIPIcs.FSTTCS.2020.16. , 2020

Link: https://doi.org/10.4230/..

13

Locally Decodable/Correctable Codes for Insertions and Dele..:

Block, Alexander R ; Blocki, Jeremiah ; Grigorescu, Elena..
http://arxiv.org/abs/2010.11989. , 2020

Link: http://arxiv.org/abs/201..

14

On Locally Decodable Codes in Resource Bounded Channels:

Blocki, Jeremiah ; Kulkarni, Shubhang ; Zhou, Samson
doi:10.4230/LIPIcs.ITC.2020.16. , 2020

Link: https://doi.org/10.4230/..

15

The Maximum Binary Tree Problem:

Chandrasekaran, Karthekeyan ; Grigorescu, Elena ; Istrate, Gabriel...
http://arxiv.org/abs/1909.07915. , 2019

Link: http://arxiv.org/abs/190..