Result 1 to 20 of 116 total
On the approximability of some degree-constrained subgraph problems. (English)
Discrete Appl. Math. 160, No. 12, 1661-1679 (2012).
1
GMPLS label space minimization through hypergraph layouts. (English)
Theor. Comput. Sci. 444, 3-16 (2012).
2
Optimal time data gathering in wireless networks with omni-directional antennas. (English)
Kosowski, Adrian (ed.) et al., Structural information and communication complexity. 18th international colloquium, SIROCCO 2011, Gdańsk, Poland, June 26‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22211-5/pbk). Lecture Notes in Computer Science 6796, 306-317 (2011).
3
Optimal time data gathering in wireless networks with omni-directional antennas (English)
SIROCCO, 306-317 (2011).
4
Cross line and column generation for the cut covering problem in wireless networks. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 255-262 (2010).
5
Data life time for different placement policies in P2P storage systems. (English)
Hameurlain, Abdelkader (ed.) et al., Data management in grid and peer-to-peer systems. Third international conference, Globe 2010, Bilbao, Spain, September 1‒2, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15107-1/pbk). Lecture Notes in Computer Science 6265, 75-88 (2010).
6
Minimal selectors and fault tolerant networks. (English)
Networks 55, No. 4, 326-340 (2010).
7
Fractional path coloring in bounded degree trees with applications. (English)
Algorithmica 58, No. 2, 516-540 (2010).
8
Designing hypergraph layouts to GMPLS routing strategies. (English)
Kutten, Shay (ed.) et al., Structural information and communication complexity. 16th international colloquium, SIROCCO 2009, Piran, Slovenia, May 25‒27, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11475-5/pbk). Lecture Notes in Computer Science 5869, 57-71 (2010).
9
Cross line and column generation for the cut covering problem in wireless networks (English)
Electronic Notes in Discrete Mathematics 36, 255-262 (2010).
10
Stability of a localized and greedy routing algorithm (English)
IPDPS Workshops, 1-8 (2010).
11
Data life time for different placement policies in P2P storage systems (English)
Globe, 75-88 (2010).
12
Peer-to-peer storage systems: A practical guideline to be lazy (English)
GLOBECOM, 1-6 (2010).
13
On the path-width of planar graphs. (English)
SIAM J. Discrete Math. 23, No. 3, 1311-1316 (2009).
14
Hardness and approximation of traffic grooming. (English)
Theor. Comput. Sci. 410, No. 38-40, 3751-3760 (2009).
15
MPLS label stacking on the line network. (English)
Fratta, Luigi (ed.) et al., NETWORKING 2009. 8th international IFIP-TC 6 networking conference, Aachen, Germany, May 11‒15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-01398-0/pbk). Lecture Notes in Computer Science 5550, 809-820 (2009).
16
Optimal routing and call scheduling in wireless mesh networks with localized informations. (English)
Kaklamanis, Christos (ed.) et al., Trustworthy global computing. 4th international symposium, TGC 2008, Barcelona, Spain, November 3‒4, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-00944-0/pbk). Lecture Notes in Computer Science 5474, 171-185 (2009).
17
Disjoint paths in symmetric digraphs. (English)
Discrete Appl. Math. 157, No. 1, 90-97 (2009).
18
Degree-constrained subgraph problems: Hardness and approximation results. (English)
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18‒19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 29-42 (2009).
19
Analysis of failure correlation impact on peer-to-peer storage systems (English)
Peer-to-Peer Computing, 184-193 (2009).
20
Result 1 to 20 of 116 total
Start
Contact
Print
General Help
