Result 1 to 20 of 83 total
Maximum series-parallel subgraph. (English)
Algorithmica 63, No. 1-2, 137-157 (2012).
1
Maximizing a monotone submodular function subject to a matroid constraint. (English)
SIAM J. Comput. 40, No. 6, 1740-1766 (2011).
2
Register loading via linear programming. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 171-182 (2011).
3
Interference-aware broadcast scheduling in wireless networks. (English)
Ad Hoc Netw. 9, No. 7, 1069-1082 (2011).
4
An improved approximation algorithm for resource allocation (English)
ACM Transactions on Algorithms 7, No. 4, 48 (2011).
5
Register loading via linear programming (English)
WADS, 171-182 (2011).
6
Min-power strong connectivity. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 67-80 (2010).
7
Maximum series-parallel subgraph. (English)
Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24‒26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 54-65 (2010).
8
Multipath network flows: bounded buffers and jitter (English)
INFOCOM, 2714-2720 (2010).
9
Min-power strong connectivity (English)
APPROX-RANDOM, 67-80 (2010).
10
Disjoint bases in a polymatroid (English)
Random Struct. Algorithms 35, No. 4, 418-430 (2009).
11
Maximum series-parallel subgraph (English)
WG, 54-65 (2009).
12
On the $k$-restricted structure ratio in planar and outerplanar graphs. (English)
Discrete Math. Theor. Comput. Sci. 10, No. 3, 135-148, electronic only (2008).
13
Reconfigurations in graphs and grids. (English)
SIAM J. Discrete Math. 22, No. 1, 124-138 (2008).
14
Fast edge colorings with fixed number of colors to minimize imbalance. (English)
J. Graph Algorithms Appl. 12, No. 4, 401-417 (2008).
15
Relay nodes in wireless sensor networks. (English)
Li, Yingshu (ed.) et al., Wireless algorithms, systems, and applications. Third international conference, WASA 2008, Dallas, TX, USA, October 26‒28, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-88581-8/pbk). Lecture Notes in Computer Science 5258, 286-297 (2008).
16
On the k-structure ratio in planar and outerplanar graphs (English)
Discrete Mathematics & Theoretical Computer Science 10, No. 3 (2008).
17
Multiway cut (English)
Encyclopedia of Algorithms (2008).
18
Relay nodes in wireless sensor networks (English)
WASA, 286-297 (2008).
19
Interference-aware broadcast scheduling in wireless networks (English)
MSN, 258-266 (2008).
20
Result 1 to 20 of 83 total
Start
Contact
Print
General Help
