Goran Konjevod

63 papers A* 12A 8B 6C 5Journal 19Unranked 11

Year	Rank	Type	Title / Venue / Authors
2022	C	`conf`	Novel Adversarial Defense Techniques for White-Box Attacks. ICMLA Jason Van Tuinen, Aditya Ranganath, Goran Konjevod, Mukesh Singhal, Roummel F. Marcia
2017	J	`jnl`	Context-aided analysis of community evolution in networks. Stat. Anal. Data Min. Giuliana Pallotta, Goran Konjevod, Jose Cadena, Phan Nguyen
2017	A	`conf`	Deep Multi-modal Vehicle Detection in Aerial ISR Imagery. WACV Wesam A. Sakla, Goran Konjevod, T. Nathan Mundhenk
2016	—	`conf`	A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learning. ECCV (3) T. Nathan Mundhenk, Goran Konjevod, Wesam A. Sakla, Kofi Boakye
2016	J	`jnl`	A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learning. CoRR T. Nathan Mundhenk, Goran Konjevod, Wesam A. Sakla, Kofi Boakye
2016	B	`conf`	Dude (Duality descriptor): A robust descriptor for disparate images using line segment duality. ICIP Youngwook Paul Kwon, Hyojin Kim, Goran Konjevod, Sara McMains
2016	J	`jnl`	Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension. ACM Trans. Algorithms Goran Konjevod, Andréa W. Richa, Donglin Xia
2016	—	`ch.`	Separators in Graphs. Encyclopedia of Algorithms Goran Konjevod
2014	J	`jnl`	Effective storage capacity of labeled graphs. Inf. Comput. Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2013	J	`jnl`	Randomized post-optimization of covering arrays. Eur. J. Comb. Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
2011	A*	`conf`	Randomized compact routing in decomposable metrics. PODC Goran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou
2010	—	`conf`	Detecting Sybil Nodes in Static and Dynamic Networks. OTM Conferences (2) José Antonio Cárdenas-Haro, Goran Konjevod
2010	C	`conf`	Storage Capacity of Labeled Graphs. SSS Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
2009	J	`jnl`	Coloring number and on-line Ramsey theory for graphs and hypergraphs. Comb. Hal A. Kierstead, Goran Konjevod
2009	J	`jnl`	Compacting cuts: A new linear formulation for minimum cut. ACM Trans. Algorithms Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
2009	B	`conf`	Folding a Better Checkerboard. ISAAC Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang
2009	A	`conf`	Near optimal battery-aware energy management. ISLPED Sushu Zhang, Karam S. Chatha, Goran Konjevod
2009	C	`conf`	Randomized Postoptimization of Covering Arrays. IWOCA Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
2008	J	`jnl`	Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Karam S. Chatha, Krishnan Srinivasan, Goran Konjevod
2008	A	`conf`	Dynamic Routing and Location Services in Metrics of Low Doubling Dimension. DISC Goran Konjevod, Andréa W. Richa, Donglin Xia
2008	A*	`conf`	Dynamic routing and location services in metrics of low doubling dimension. PODC Goran Konjevod, Andréa W. Richa, Donglin Xia
2008	C	`conf`	Engineering Label-Constrained Shortest-Path Algorithms. AAIM Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
2008	—	`ch.`	Separators in Graphs. Encyclopedia of Algorithms Goran Konjevod
2007	—	`conf`	Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms. ASP-DAC Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
2007	—	`conf`	Approximation Algorithm for Process Mapping on Network Processor Architectures. ASP-DAC Christopher Ostler, Karam S. Chatha, Goran Konjevod
2007	A	`conf`	Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. ISLPED Sushu Zhang, Karam S. Chatha, Goran Konjevod
2007	—	`conf`	Combinational equivalence checking for threshold logic circuits. ACM Great Lakes Symposium on VLSI Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevod
2007	A*	`conf`	Compact routing with slack in low doubling dimension. PODC Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu
2007	A*	`conf`	Compacting cuts: a new linear formulation for minimum cut. SODA Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
2007	J	`jnl`	On the establishment of distinct identities in overlay networks. Distributed Comput. Rida A. Bazzi, Goran Konjevod
2007	A*	`conf`	Optimal scale-free compact routing schemes in networks of low doubling dimension. SODA Goran Konjevod, Andréa W. Richa, Donglin Xia
2007	—	`conf`	Synthesis of threshold logic circuits using tree matching. ECCTD Tejaswi Gowda, Samuel Leshner, Sarma B. K. Vrudhula, Goran Konjevod
2006	—	`conf`	A Tight Lower Bound for the Steiner Point Removal Problem on Trees. APPROX-RANDOM T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa
2006	—	`conf`	Engineering Label-Constrained Shortest-Path Algorithms. The Shortest Path Problem Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
2006	J	`jnl`	Linear-programming-based techniques for synthesis of network-on-chip architectures. IEEE Trans. Very Large Scale Integr. Syst. Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
2006	B	`conf`	On Sampling in Higher-Dimensional Peer-to-Peer Systems. LATIN Goran Konjevod, Andréa W. Richa, Donglin Xia
2006	A*	`conf`	Optimal-stretch name-independent compact routing in doubling metrics. PODC Goran Konjevod, Andréa W. Richa, Donglin Xia
2006	J	`jnl`	Robust optimization of contaminant sensor placement for community water systems. Math. Program. Robert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips
2006	—	`conf`	Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment. DG.O Himanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, Ke Li
2005	J	`jnl`	A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media. IEEE Trans. Broadcast. Soohyun Oh, Yo Huh, Beshan Kulapala, Goran Konjevod, Andréa W. Richa, Martin Reisslein
2005	A	`conf`	An automated technique for topology and route generation of application specific on-chip interconnection networks. ICCAD Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
2005	A*	`conf`	On the establishment of distinct identities in overlay networks. PODC Rida A. Bazzi, Goran Konjevod
2004	J	`jnl`	Budget constrained minimum cost connected medians. J. Discrete Algorithms Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
2004	A	`conf`	Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty. DISC Rida A. Bazzi, Goran Konjevod
2004	J	`jnl`	Improved Approximations for Tour and Tree Covers. Algorithmica Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
2004	C	`conf`	Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures. ICCD Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
2002	—	`conf`	A theoretical study of optimization techniques used in registration area based location management: models and online algorithms. DIAL-M Sandeep K. S. Gupta, Goran Konjevod, Georgios Varsamopoulos
2002	J	`jnl`	Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms Goran Konjevod, R. Ravi, Aravind Srinivasan
2002	A	`conf`	Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. ESA Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe
2002	B	`conf`	Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. LATIN Goran Konjevod, Soohyun Oh, Andréa W. Richa
2001	J	`jnl`	A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
2001	J	`jnl`	On approximating planar metrics by tree metrics. Inf. Process. Lett. Goran Konjevod, R. Ravi, F. Sibel Salman
2001	B	`conf`	On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. IPCO Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II
2000	A	`conf`	A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
2000	J	`jnl`	A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms Naveen Garg, Goran Konjevod, R. Ravi
2000	A*	`conf`	Algorithms for optimizing production DNA sequencing. SODA Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney
2000	A*	`conf`	An approximation algorithm for the covering Steiner problem. SODA Goran Konjevod, R. Ravi
2000	B	`conf`	Budget Constrained Minimum Cost Connected Medians. WG Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
2000	—	`conf`	Improved approximations for tour and tree covers. APPROX Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
2000	A*	`conf`	On the red-blue set cover problem. SODA Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe
2000	J	`jnl`	Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci. Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala
1998	A*	`conf`	A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. SODA Naveen Garg, Goran Konjevod, R. Ravi
1998	A*	`conf`	Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. STOC Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala