Result 1 to 20 of 58 total
Graph orientations optimizing the number of light or heavy vertices. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 332-343 (2012).
1
Distance-$d$ independent set problems for bipartite and chordal graphs. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 234-244 (2012).
2
Optimal distortion embedding of complete binary trees into lines. (English)
Inf. Process. Lett. 112, No. 10, 365-370 (2012).
3
NP-hardness of the sorting buffer problem on the uniform metric. (English)
Discrete Appl. Math. 160, No. 10-11, 1453-1464 (2012).
4
$(1 + ϵ)$-competitive algorithm for online OVSF code assignment with resource augmentation. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 259-270 (2011).
5
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. (English)
J. Comb. Optim. 22, No. 1, 78-96 (2011).
6
Graph orientation to maximize the minimum weighted outdegree. (English)
Int. J. Found. Comput. Sci. 22, No. 3, 583-601 (2011).
7
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. (English)
Discrete Appl. Math. 159, No. 7, 498-508 (2011).
8
Foreword (English)
IEICE Transactions 94-A, No. 6, 1221 (2011).
9
($1 + ϵ$)-competitive algorithm for online OVSF code assignment with resource augmentation (English)
COCOON, 259-270 (2011).
10
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. (English)
Inf. Process. Lett. 110, No. 3, 93-98 (2010).
11
Approximating maximum diameter-bounded subgraphs. (English)
López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 615-626 (2010).
12
Approximating maximum diameter-bounded subgraphs (English)
LATIN, 615-626 (2010).
13
Optimal distortion embedding of complete binary trees into lines (English)
FCS, 16-21 (2010).
14
Drawing borders efficiently. (English)
Theory Comput. Syst. 44, No. 2, 230-244 (2009).
15
Computational complexities of university interview timetabling (English)
IEICE Transactions 92-D, No. 2, 130-140 (2009).
16
Graph orientation to maximize the minimum weighted outdegree (English)
IPDPS, 1-8 (2009).
17
Grasp and delivery for moving objects on broken lines. (English)
Theory Comput. Syst. 42, No. 3, 289-305 (2008).
18
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (English)
CATS, 97-106 (2008).
19
NP-hardness of the sorting buffer problem on the uniform metric (English)
FCS, 137-143 (2008).
20
Result 1 to 20 of 58 total
Start
Contact
Print
General Help
