Goran Konjevod - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 60 from 60

2022

Novel Adversarial Defense Techniques for White-Box AttacksJason Van Tuinen, Aditya Ranganath, Goran Konjevod, Mukesh Singhal, Roummel F. Marcia. icmla 2022: 617-622 [doi]

2017

Context-aided analysis of community evolution in networksGiuliana Pallotta, Goran Konjevod, Jose Cadena, Phan Nguyen. sadm, 10(5):290-311, 2017. [doi]

Deep Multi-modal Vehicle Detection in Aerial ISR ImageryWesam A. Sakla, Goran Konjevod, T. Nathan Mundhenk. wacv 2017: 916-923 [doi]

2016

2014

Effective storage capacity of labeled graphsDana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod. iandc, 234:44-56, 2014. [doi]

2013

Randomized post-optimization of covering arraysPeyman Nayeri, Charles J. Colbourn, Goran Konjevod. ejc, 34(1):91-103, 2013. [doi]

2011

Randomized compact routing in decomposable metricsGoran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou. podc 2011: 351-352 [doi]

2010

Storage Capacity of Labeled GraphsDana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod. sss 2010: 573-587 [doi]

Detecting Sybil Nodes in Static and Dynamic NetworksJosé Antonio Cárdenas-Haro, Goran Konjevod. otm 2010: 894-917 [doi]

2009

2008

2007

On the establishment of distinct identities in overlay networksRida A. Bazzi, Goran Konjevod. dc, 19(4):267-287, 2007. [doi]

Compacting cuts: a new linear formulation for minimum cutRobert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh. soda 2007: 43-52 [doi]

Combinational equivalence checking for threshold logic circuitsTejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevod. glvlsi 2007: 102-107 [doi]

Synthesis of threshold logic circuits using tree matchingTejaswi Gowda, Samuel Leshner, Sarma B. K. Vrudhula, Goran Konjevod. ecctd 2007: 850-853 [doi]

Optimal scale-free compact routing schemes in networks of low doubling dimensionGoran Konjevod, Andréa W. Richa, Donglin Xia. soda 2007: 939-948 [doi]

Compact routing with slack in low doubling dimensionGoran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu. podc 2007: 71-80 [doi]

Approximation Algorithm for Process Mapping on Network Processor ArchitecturesChristopher Ostler, Karam S. Chatha, Goran Konjevod. aspdac 2007: 577-582 [doi]

Application Specific Network-on-Chip Design with Guaranteed Quality Approximation AlgorithmsKrishnan Srinivasan, Karam S. Chatha, Goran Konjevod. aspdac 2007: 184-190 [doi]

Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedulesSushu Zhang, Karam S. Chatha, Goran Konjevod. islped 2007: 225-230 [doi]

2006

Engineering Label-Constrained Shortest-Path AlgorithmsChristopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner. dimacs 2009: 309

Robust optimization of contaminant sensor placement for community water systemsRobert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips. mp, 107(1-2):337-356, 2006. [doi]

A Tight Lower Bound for the Steiner Point Removal Problem on TreesHubert T.-H. Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa. approx 2006: 70-81 [doi]

Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environmentHimanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, Ke Li. DG.O 2006: 135-141 [doi]

On Sampling in Higher-Dimensional Peer-to-Peer SystemsGoran Konjevod, Andréa W. Richa, Donglin Xia. latin 2006: 641-652 [doi]

Optimal-stretch name-independent compact routing in doubling metricsGoran Konjevod, Andréa W. Richa, Donglin Xia. podc 2006: 198-207 [doi]

Linear-programming-based techniques for synthesis of network-on-chip architecturesKrishnan Srinivasan, Karam S. Chatha, Goran Konjevod. tvlsi, 14(4):407-420, 2006. [doi]

2005

On the establishment of distinct identities in overlay networksRida A. Bazzi, Goran Konjevod. podc 2005: 312-320 [doi]

A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous mediaSoohyun Oh, Yo Huh, Beshan Kulapala, Goran Konjevod, Andréa W. Richa, Martin Reisslein. tbc, 51(2):200-215, 2005. [doi]

An automated technique for topology and route generation of application specific on-chip interconnection networksKrishnan Srinivasan, Karam S. Chatha, Goran Konjevod. iccad 2005: 231-237

2004

Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are FaultyRida A. Bazzi, Goran Konjevod. wdag 2004: 420-434 [doi]

Budget constrained minimum cost connected mediansGoran Konjevod, Sven Oliver Krumke, Madhav V. Marathe. jda, 2(4):453-469, 2004. [doi]

Linear Programming based Techniques for Synthesis of Network-on-Chip ArchitecturesKrishnan Srinivasan, Karam S. Chatha, Goran Konjevod. iccd 2004: 422-429 [doi]

2003

Improved Approximations for Tour and Tree CoversJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha. algorithmica, 38(3):441-449, 2003. [doi]

2002

2001

2000

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problemsAvrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. TCS, 235(1):25-42, 2000. [doi]

A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set ProblemRobert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh. esa 2000: 132-142

On the red-blue set cover problemRobert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe. soda 2000: 345-353 [doi]

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemNaveen Garg, Goran Konjevod, R. Ravi. jal, 37(1):66-84, 2000.

An approximation algorithm for the covering Steiner problemGoran Konjevod, R. Ravi. soda 2000: 338-344 [doi]

Budget Constrained Minimum Cost Connected MediansGoran Konjevod, Sven Oliver Krumke, Madhav V. Marathe. criwg 2000: 267-278 [doi]

Improved approximations for tour and tree coversJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha. approx 2000: 184-193 [doi]

Algorithms for optimizing production DNA sequencingÉva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney. soda 2000: 399-408 [doi]

1998

Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering ProblemsAvrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. stoc 1998: 100-105 [doi]

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemNaveen Garg, Goran Konjevod, R. Ravi. soda 1998: 253-259

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Goran Konjevod'

Viewing Publication 1 - 60 from 60

2022

2017

2016

2014

2013

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1998

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Goran Konjevod'

Viewing Publication 1 - 60 from 60

2022

2017

2016

2014

2013

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1998

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1