| Searching for zelikovsky or zelikowsky or zelikovski. |
448 citations found. Only retrieving 250 citations (System busy - maximum reduced). Only a fraction of citations to each article may be shown. Retrieving citations... Order: citations weighted by year.
Context Doc 125.9 42 (4): G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms, pages 770--779, 2000.
Context Doc 38.3 32 (13): A. Zelikovsky. A 11/6-approximation algorithm for the network Steiner problem. Algorithmica, 9:463470, 1993.
Context Doc 31.1 4 (1): G. Calinescu, S. Kapoor, A. Olshevsky, and A. Zelikovsky. Network Lifetime and Power Assignment in ad hoc Wireless Networks. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA), pages 114--126, 2003.
Context Doc 27.2 7 (2): G. Calinescu, I. Mandoiu, P.-J. Wan, and A. Zelikovsky, "Selecting forwarding neighbors in wireless ad hoc networks," in Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications. ACM Press, 2001, pp. 34--43.
Context Doc 25.9 5 (4): G. Calinescu, I. Mandoiu, and A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (IFIP-TCS), pages 119--130, 2002.
Context Doc 24 10 (8): A. E. Caldwell, A. B. Kahng, S. Mantik, I. L. Markov and A. Zelikovsky, "On Wirelength Estimations for Row-Based Placement", IEEE Trans. on CAD,18(9), Sept. 1999, pp. 1265-1278.
Context Doc 20.9 7 (5): F.F. Dragan, A.B. Kahng, I.I. Mandoiu, S. Muddu and A. Zelikovsky, "Provably good global buffering using an available buffer block plan", Proc. ICCAD, 2000, pp. 104--109.
Context Doc 20.5 14 (6): A. Zelikovsky, Better approximation bounds for the network and Euclidean Steiner tree problems, technical report CS-96-06, University of Virginia, 1996.
Context Doc 20 15 (3): M. Karpinsky and A. Zelikovsky. New approximation algorithms for the steiner tree problem. In Technical Report, Electronic Colloquium on Computational Complexity (ECCC) TR95-030, 1995.
Context Doc 18 11 (5): C. D. Bateman and C. S. Helvig and G. Robins and A. Zelikovsky. Provably good routing tree construction with multi-port terminals. In Proceedings of ACM/SIGDA International Symposium on Physical Design, 1997.
Context Doc 18 11 (3): M. Karpinski and A. Zelikovsky. New approximation algorithms for the Steiner tree problems. J. Comb. Opti., 1:4765, 1997.
Context Doc 17.9 15 (0): A. Zelikovsky and D. Lozevanu. Minimal and bounded trees. In Tezele Cong. XVIII Acad. Romano-Americane, pages 25-26, Kishinev, 1993. 14
Context Doc 17.2 2 (0): Berman, P., Calinescu, G., Shah C. and Zelikovsky, A., "Power Efficient Monitoring Management in Sensor Networks," Proceedings of IEEE Wireless Communication and Networking Conference (WCNC'04), Atlanta, March 2004, pp. 2329-2334.
Context Doc 15.5 2 (1): E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski, and A. Zelikovsky. Power E#cient Range Assignment in Ad-Hoc Wireless Networks. In Proc. of the IEEE Wireless Communications and Networking Conference (WCNC '03), IEEE Computer Society Press, pp. 1889-1894, 2003.
Context Doc 14.7 9 (1): A. Zelikovsky, A series of approximation algorithms for the acyclic directed Steiner tree problem, Algorithmica, 18: 99-110, 1997.
Context Doc 11.4 7 (0): M. Karpinski, J. Wirtgen, and A. Zelikovsky. An approximating algorithm for the bandwidth problem on dense graphs. Technical Report TR 97-017, ECCC, 1997.
Context Doc 10.3 4 (0): A. Z. Zelikovsky, "The 11/6-approximation algorithm for the Steiner problem on networks," Algorithmica, 9, pp. 463-470. 28
Context Doc 10.3 2 (0): Gruia C alinescu, I. Mandoiu, and A. Zelikovsky, "Symmetric connectivity with minimum power consumption in radio networks," in IFIP-TCS, 2002, To appear.
Context Doc 10 9 (5): A.Z. Zelikovsky, An 11/8-approximation algorithm for the Steiner problem on networks with rectilinear distance, Coll. Math. Soc. J. Bolyai 60 (1992) 733-745.
Context Doc 7.7 1 (1): E. Althaus, G. Calinescu, I.I. Mandoiu, S. Prasad, N. Tchervenski, and A.Z. Zelikovsky. Power efficient range assignment in ad-hoc wireless networks. In Proc. IEEE Wireless Communications and Networking Conference (WCNC), pages 1889--1894, 2003.
Context Doc 7.7 1 (0): A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky. "highly scD4] le algorithms forrec ilinear and oc tilinear steiner tree". In Proc. Asia and South Pacific Design Automation Conference, pages 827--833, Jan. 2003.
Context Doc 7.7 1 (0): A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky. Highly scalable algorithms for rectilinear and octilinear steiner trees. In Proc. Asia South Pacific Design Automation Conf., pages 09b--1, 2003.
Context Doc 7.1 6 (1): A. Zelikovsky, "An 11/6 approximation algorithm for the network Steiner problem", Algorithmica, 9: 463--470 (1993).
Context Doc 5.1 1 (0): C. Albrecht, A. B. Kahng I. Mandoiu, and A. Zelikovsky,\Floorplan Evluation with Timing-Driven Global Wireplanning, Pin Assignment, and Bu er/Wire Sizing," Proc. of ASP-DAC/VLSI Design 2002.
Context Doc 5.1 1 (0): Y. Chen, A. B. Kahng, G. Robins, and A. Zelikovsky, IEEE Trans. Comput.-Aided Des., 21, 1132 #2002#.
Context Doc 4.8 2 (10): A. B. Kahng, G. Robins, A. Singh, H. Wang and A. Zelikovsky, "Filling Algorithms and Analyses for Layout Density Control", IEEE Trans. Computer-Aided Design 18(4) (1999), pp. 445-462.
Context Doc 3.8 1 (0): A. B. Kahng, S. Vaya and A. Zelikovsky, "New Graph Bipartizations for Double-Exposure, Bright Field Alternating Phase-Shift Mask Layout", Proc. Asia and South Pacific Design Automation Conf., Jan. 2001, pp. 133-138.
Context Doc 3.8 1 (0): C.S. Helvig, G. Robins, A. Zelikovsky. An Improved Approximation Scheme for the Group Steiner Problem. Networks 37 (2001) 8--20.
Context Doc 3.8 1 (4): Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Hierarchical Dummy Fill for Process Uniformity", Proc. ASP-DAC, Jan. 2001, pp.139-144.
Context Doc 3.8 1 (2): F.F. Dragan, A.B. Kahng, I.I. Mandoiu, S. Muddu and A. Zelikovsky, "Provably good global buffering by multiterminal multicommodity flow approximation", Proc. ASP-DAC, 2001, pp. 120--125.
Context Doc 3.8 2 (2): C. S. Helvig, G. Robins, and A. Zelikovsky. Moving-target TSP and related problems. In Proc. 6th Annual European Symposium on Algorithms (ESA), 1998.
Context Doc 3.5 3 (8): A. Z. Zelikovsky. A faster approximation algorithm for the Steiner tree problem in graphs. Information Processing Letters, 46(2):79--83, May 1993.
Context Doc 3.5 3 (1): U. Fomeier, M. Kaufmann and A. Zelikovsky. Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. Lect. Notes in Comp. Sc. 762, 533-542, 1993.
Context Doc 3.2 2 (0): C. D. Bateman, C. S. Helvig, G. Robins, and A. Zelikovsky, 1997. Java program, available at http ://www. cs. virginia. edu/robins/groupSt einer/.
Context Doc 3.2 2 (7): M. Karpinski, J. Wirtgen and A. Zelikovsky, An Approximation Algorithm for the Bandwidth Problem on Dense Graphs, ECCC Technical Report TR 97-017 (1997).
Context Doc 2.9 1 (0): G. Robins and A. Zelikovsky Improved Steiner Tree Approximation in Graphs. In Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 770-779, 2000.
Context Doc 2.9 1 (5): Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Practical Iterated Fill Synthesis for CMP Uniformity", Proc. ACM/IEEE Design Automation Conf., Los Angeles, June 2000, pp. 671-674.
Context Doc 2.6 2 (1): A.Z. Zelikovsky, Better approximation algorithms for the network and Euclidean Steiner tree problems, Technical Report, Kishinev, 1995. 12
Context Doc 2.5 1 (10): M. Karpinski and A. Zelikovsky, Approximating Dense Cases of Covering Problems , ECCC Technical Report TR 97-004,
Context Doc 2.5 2 (4): P. Berman, U. Fomeier, M. Karpinski, M. Kaufmann, and A. Zelikovsky. Approaching the 5/4-approximation for rectilinear Steiner trees. In Proc. 2nd Eur. Symp. Algorithms, pages 60--71. Springer-Verlag, LNCS 855, 1994.
Context Doc 2.4 1 (5): P. Berman, A. B. Kahng, D. Vidhani, H. Wang and A. Zelikovsky, "Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks", Proc. ACM Intl. Symp. on Physical Design, Apr. 1999, pp. 121-126.
Context Doc 2.4 1 (0): A.B. Kahng, P. Tucker, A. Zelikovsky: Optimization of Linear Placements for Wirelength Minimiza- tion with Free Sites. Proc. of the Asia and South Pa- cific Design Automation Conference, 1999, 241-244
Context Doc 2.4 1 (0): A. Kahng, G. Robins, A. Singh, and A. Zelikovsky, IEEE Trans. Comput.-Aided Des., 18, 445 #1999#.
Context Doc 2.4 1 (0): L.K. Fleischer, "Approximating fractional multicommodity flow independent of the number of commodities", Proc. 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 24--31. F.F. Dragan, A.B. Kahng, I.I. Mandoiu, S. Muddu, and A. Zelikovsky
Context Doc 2.4 1 (0): Y. Chen, A. B. Kahng, G. Qu, and A. Zelikovsky. The associative-skew clock routing problem. In Proc. 1999.
Context Doc 1.9 1 (2): P. Berman, M. Furer, and A. Zelikovsky, \Applications of matroid parity problem to approximating steiner trees," Tech. Rep. 980021, Computer Science, UCLA, 1998.
Context Doc 1.9 1 (2): C. S. Helvig, Gabriel Robins, and Alexander Zelikovsky. Improved approximation bounds for the group Steiner problem. In Proc. Conference on Design Automation and Test in Europe, pages 406--413, Paris, France, February 1998.
Context Doc 1.9 1 (0): Berman, P., and Zelikovsky, A.: On the powerp and bottleneck Steiner tree problem, Tech. Rep. 980020, Computer Sci. Dept., UCLA, Los Angeles, CA, 1998.
Context Doc 1.9 1 (5): A. B. Kahng, H. Wang and A. Zelikovsky, "Automated Layout and Phase Assignment Techniques for Dark Field Alternating PSM", Proc. 18th BACUS Symp. on Photomask Technology and Management, Sep. 1998, pp. 222-231.
Context Doc 1.3 1 (0): Hwan-Gue Cho and Alexander Zelikovsky. Spanning closed trail and Hamiltonian cycle in grid graphs. In Algorithms and Computations. 6th International Symposium, ISAAC 95, pages 342-- 351, 1995.
First 50 documents Next 50
The numbers before each article are the weighted number of citations (excluding self-citations), the number of citations, and the predicted number of self-citations. The weighting ranks more recent articles higher. 448 citations were found, of which 180 were predicted to be self-citations. Self-citations are not included in the graph.
Try your query at: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC