Search results for "Goran Konjevod"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Goran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou	Randomized compact routing in decomposable metrics.	PODC	2011	DBLP DOI BibTeX RDF
1	José Antonio Cárdenas-Haro, Goran Konjevod	Detecting Sybil Nodes in Static and Dynamic Networks.	OTM Conferences	2010	DBLP DOI BibTeX RDF
1	Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod	Storage Capacity of Labeled Graphs.	SSS	2010	DBLP DOI BibTeX RDF
1	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh	Compacting cuts: A new linear formulation for minimum cut.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Linear programming formulation complexity, minimum cut problem
1	Hal A. Kierstead, Goran Konjevod	Coloring number and on-line Ramsey theory for graphs and hypergraphs.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Sushu Zhang, Karam S. Chatha, Goran Konjevod	Near optimal battery-aware energy management.	ISLPED	2009	DBLP DOI BibTeX RDF	low power design, dynamic power management, dynamic voltage/frequency scaling
1	Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang	Folding a Better Checkerboard.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Peyman Nayeri, Charles J. Colbourn, Goran Konjevod	Randomized Postoptimization of Covering Arrays.	IWOCA	2009	DBLP DOI BibTeX RDF
1	Karam S. Chatha, Krishnan Srinivasan, Goran Konjevod	Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures.	IEEE Trans. on CAD of Integrated Circuits and Systems	2008	DBLP DOI BibTeX RDF
1	Goran Konjevod	Separators in Graphs.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner	Engineering Label-Constrained Shortest-Path Algorithms.	AAIM	2008	DBLP DOI BibTeX RDF
1	Goran Konjevod, Andréa W. Richa, Donglin Xia	Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.	DISC	2008	DBLP DOI BibTeX RDF
1	Goran Konjevod, Andréa W. Richa, Donglin Xia	Dynamic routing and location services in metrics of low doubling dimension.	PODC	2008	DBLP DOI BibTeX RDF
1	Rida A. Bazzi, Goran Konjevod	On the establishment of distinct identities in overlay networks.	Distributed Computing	2007	DBLP DOI BibTeX RDF	Overlay networks, Peer-to-peer systems, Sybil attack, Identity verification, Distance geometry
1	Goran Konjevod, Andréa W. Richa, Donglin Xia	Optimal scale-free compact routing schemes in networks of low doubling dimension.	SODA	2007	DBLP DOI BibTeX RDF
1	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh	Compacting cuts: a new linear formulation for minimum cut.	SODA	2007	DBLP DOI BibTeX RDF
1	Sushu Zhang, Karam S. Chatha, Goran Konjevod	Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules.	ISLPED	2007	DBLP DOI BibTeX RDF	low power design, earliest deadline first, rate monotonic
1	Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevod	Combinational equivalence checking for threshold logic circuits.	ACM Great Lakes Symposium on VLSI	2007	DBLP DOI BibTeX RDF	nano devices, EDA, equivalence checking, threshold logic
1	Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod	Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms.	ASP-DAC	2007	DBLP DOI BibTeX RDF
1	Christopher Ostler, Karam S. Chatha, Goran Konjevod	Approximation Algorithm for Process Mapping on Network Processor Architectures.	ASP-DAC	2007	DBLP DOI BibTeX RDF	Intel IXP2400 architecture, programmable network processor architectures, symmetric multiprocessing, automated system-level design, NP-complete problem, process mapping, polynomial time approximation algorithm, block multithreading
1	Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu	Compact routing with slack in low doubling dimension.	PODC	2007	DBLP DOI BibTeX RDF	name-indpendent routing, routing with slack, compact routing, doubling dimension
1	Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod	Linear-programming-based techniques for synthesis of network-on-chip architectures.	IEEE Trans. VLSI Syst.	2006	DBLP DOI BibTeX RDF
1	Robert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips	Robust optimization of contaminant sensor placement for community water systems.	Math. Program.	2006	DBLP DOI BibTeX RDF
1	Goran Konjevod, Andréa W. Richa, Donglin Xia	On Sampling in Higher-Dimensional Peer-to-Peer Systems.	LATIN	2006	DBLP DOI BibTeX RDF
1	Goran Konjevod, Andréa W. Richa, Donglin Xia	Optimal-stretch name-independent compact routing in doubling metrics.	PODC	2006	DBLP DOI BibTeX RDF	name-independent routing, compact routing, doubling metrics
1	Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa	A Tight Lower Bound for the Steiner Point Removal Problem on Trees.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Himanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, Ke Li	Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment.	DG.O	2006	DBLP DOI BibTeX RDF	light rail, ridership, simulation, transit, urban modeling
1	Rida A. Bazzi, Goran Konjevod	On the establishment of distinct identities in overlay networks.	PODC	2005	DBLP DOI BibTeX RDF	security, fault-tolerance, overlay networks, peer-to-peer systems, sybil attack, identity verification, distance geometry
1	Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod	An automated technique for topology and route generation of application specific on-chip interconnection networks.	ICCAD	2005	DBLP BibTeX RDF
1	Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe	Budget constrained minimum cost connected medians.	J. Discrete Algorithms	2004	DBLP DOI BibTeX RDF
1	Rida A. Bazzi, Goran Konjevod	Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty.	DISC	2004	DBLP DOI BibTeX RDF	secret sharing, Byzantine failures, Secure storage
1	Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod	Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures.	ICCD	2004	DBLP DOI BibTeX RDF
1	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved Approximations for Tour and Tree Covers.	Algorithmica	2003	DBLP DOI BibTeX RDF	Approximation algorithms, Graph algorithms, Network design
1	Goran Konjevod, R. Ravi, Aravind Srinivasan	Approximation algorithms for the covering Steiner problem.	Random Struct. Algorithms	2002	DBLP DOI BibTeX RDF
1	Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe	Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.	ESA	2002	DBLP DOI BibTeX RDF
1	Goran Konjevod, Soohyun Oh, Andréa W. Richa	Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.	LATIN	2002	DBLP DOI BibTeX RDF
1	Sandeep K. S. Gupta, Goran Konjevod, Georgios Varsamopoulos	A theoretical study of optimization techniques used in registration area based location management: models and online algorithms.	DIAL-M	2002	DBLP DOI BibTeX RDF	metrical task systems, registration area, location management, on-line algorithm
1	Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh	A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.	J. Comb. Optim.	2001	DBLP DOI BibTeX RDF
1	Goran Konjevod, R. Ravi, F. Sibel Salman	On approximating planar metrics by tree metrics.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
1	Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II	On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.	IPCO	2001	DBLP DOI BibTeX RDF
1	Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala	Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
1	Naveen Garg, Goran Konjevod, R. Ravi	A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.	J. Algorithms	2000	DBLP DOI BibTeX RDF
1	Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe	Budget Constrained Minimum Cost Connected Medians.	WG	2000	DBLP DOI BibTeX RDF
1	Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh	A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.	ESA	2000	DBLP DOI BibTeX RDF
1	Goran Konjevod, R. Ravi	An approximation algorithm for the covering Steiner problem.	SODA	2000	DBLP DOI BibTeX RDF
1	Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney	Algorithms for optimizing production DNA sequencing.	SODA	2000	DBLP DOI BibTeX RDF
1	Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe	On the red-blue set cover problem.	SODA	2000	DBLP DOI BibTeX RDF
1	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved approximations for tour and tree covers.	APPROX	2000	DBLP DOI BibTeX RDF
1	Naveen Garg, Goran Konjevod, R. Ravi	A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.	SODA	1998	DBLP DOI BibTeX RDF
1	Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala	Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems.	STOC	1998	DBLP DOI BibTeX RDF

Publications of "Goran Konjevod" ( http://dblp.L3S.de/Authors/Goran_Konjevod )