2008 | ||
---|---|---|
51 | EE | Gruia Calinescu, Sutep Tongngam: Relay Nodes in Wireless Sensor Networks. WASA 2008: 286-297 |
50 | EE | Gruia Calinescu: Multiway Cut. Encyclopedia of Algorithms 2008 |
49 | EE | Gruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. SIAM J. Discrete Math. 22(1): 124-138 (2008) |
2007 | ||
48 | EE | Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor: Approximation Algorithms For Multipath Setup. GLOBECOM 2007: 438-442 |
47 | EE | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196 |
46 | EE | David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang: Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075 |
45 | EE | Gruia Calinescu, Peng-Jun Wan: On Ring Grooming in optical networks. J. Comb. Optim. 13(2): 103-122 (2007) |
44 | EE | Gruia Calinescu: A note on data structures for maintaining bipartitions. J. Discrete Algorithms 5(1): 129-134 (2007) |
43 | EE | Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand: Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. J. UCS 13(1): 1-3 (2007) |
2006 | ||
42 | EE | Gruia Calinescu, Michael J. Pelsmajer: Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS 2006: 117-128 |
41 | EE | Gruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. LATIN 2006: 262-273 |
40 | EE | Gruia Calinescu: Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract). SNPD 2006: 225 |
39 | EE | Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat: Bounded-hops power assignment in ad hoc wireless networks. Discrete Applied Mathematics 154(9): 1358-1371 (2006) |
38 | EE | Gruia Calinescu: A fast localized algorithm for scheduling sensors. J. Parallel Distrib. Comput. 66(4): 507-514 (2006) |
37 | EE | Gruia Calinescu, Peng-Jun Wan: Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. MONET 11(2): 121-128 (2006) |
36 | EE | Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky: Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. Wireless Networks 12(3): 287-299 (2006) |
2005 | ||
35 | EE | Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan: Separating Points by Axis-parallel Lines. Int. J. Comput. Geometry Appl. 15(6): 575-590 (2005) |
34 | EE | Gruia Calinescu, Alexander Zelikovsky: The Polymatroid Steiner Problems. J. Comb. Optim. 9(3): 281-294 (2005) |
33 | EE | Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder: Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks. Wireless Networks 11(4): 531-533 (2005) |
2004 | ||
32 | EE | Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan: Separating points by axis-parallel lines. CCCG 2004: 7-10 |
31 | EE | Gruia Calinescu: Bounding the Payment of Approximate Truthful Mechanisms. ISAAC 2004: 221-233 |
30 | EE | Gruia Calinescu, Alexander Zelikovsky: The Polymatroid Steiner Problems. ISAAC 2004: 234-245 |
29 | EE | Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi: Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Netw. 12(3): 507-514 (2004) |
28 | EE | Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky: Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. MONET 9(2): 101-111 (2004) |
27 | EE | Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004) |
2003 | ||
26 | EE | Gruia Calinescu: Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. ADHOC-NOW 2003: 175-186 |
25 | EE | Gruia Calinescu, Peng-Jun Wan: Range Assignment for High Connectivity in Wireless Ad Hoc Networks. ADHOC-NOW 2003: 235-246 |
24 | EE | Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky: Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA 2003: 114-126 |
23 | EE | Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky: A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (2003) |
22 | EE | Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, Yu Wang: Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks. IEEE Trans. Parallel Distrib. Syst. 14(10): 1035-1047 (2003) |
21 | EE | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003) |
2002 | ||
20 | Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. IFIP TCS 2002: 119-130 | |
19 | EE | Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan: Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks. INFOCOM 2002 |
18 | EE | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani: Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414 |
17 | Gruia Calinescu, Peng-Jun Wan: Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs. J. Comb. Optim. 6(4): 425-453 (2002) | |
16 | EE | Gruia Calinescu, Peng-Jun Wan: Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theor. Comput. Sci. 276(1-2): 33-50 (2002) |
15 | Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder: Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks 8(6): 607-617 (2002) | |
2001 | ||
14 | EE | Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky: Selecting forwarding neighbors in wireless Ad Hoc networks. DIAL-M 2001: 34-43 |
13 | EE | Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. INFOCOM 2001: 1162-1171 |
12 | Gruia Calinescu, Peng-Jun Wan: Traffic partition in WDM/SONET rings to minimize SONET ADMs. IPDPS 2001: 201 | |
11 | EE | Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation algorithms for the 0-extension problem. SODA 2001: 8-16 |
10 | EE | Gruia Calinescu, Cristina G. Fernandes: Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electronic Notes in Discrete Mathematics 7: 194-197 (2001) |
2000 | ||
9 | EE | Gruia Calinescu, Peng-Jun Wan: Wavelength Assignment in WDM Rings with Splitable Lightpaths. ISPAN 2000: 216-223 |
8 | Amihood Amir, Gruia Calinescu: Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36(1): 34-62 (2000) | |
7 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000) | |
1998 | ||
6 | EE | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152 |
5 | EE | Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52 |
4 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27(2): 269-302 (1998) | |
1996 | ||
3 | Gruia Calinescu, Cristina G. Fernandes: Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161 | |
2 | Amihood Amir, Gruia Calinescu: Alphabet Independent and Dictionary Scaled Matching. CPM 1996: 320-334 | |
1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25 |