Result 1 to 20 of 416 total
Efficient algorithms for the double traveling salesman problem with multiple stacks. (English)
Comput. Oper. Res. 39, No. 5, 1044-1053 (2012).
1
A self-stabilizing algorithm for optimally efficient sets in graphs. (English)
Inf. Process. Lett. 112, No. 16, 621-623 (2012).
2
Efficient offset trimming for planar rational curves using biarc trees. (English)
Comput. Aided Geom. Des. 29, No. 7, 555-564 (2012).
3
Quick testing of random sequences. (English)
Egri-Nagy, Attila (ed.) et al., Proceedings of the 8th international conference on applied informatics (ICAI 2010), Eger, Hungary, January 27‒30, 2010. 2 Volumes. Eger: BVB Nyomda és Kiadó Kft. (ISBN 978-963-9894-72-3/pbk). 379-386 (2012).
4
Linear computational complexity robust ILC for lifted systems. (English)
Automatica 48, No. 6, 1102-1110 (2012).
5
Compact and low delay routing labeling scheme for unit disk graphs. (English)
Comput. Geom. 45, No. 7, 305-325 (2012).
6
Computing all-pairs shortest paths by leveraging low treewidth. (English)
J. Artif. Intell. Res. (JAIR) 43, 353-388 (2012).
7
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. (English)
Discrete Appl. Math. 160, No. 4-5, 471-478 (2012).
8
Lightweight data indexing and compression in external memory. (English)
Algorithmica 63, No. 3, 707-730 (2012).
9
RAGE - a rapid graphlet enumerator for large networks. (English)
Comput. Netw. 56, No. 2, 810-819 (2012).
10
Algorithms for finding biclique covers of graphs with bounded pathwidth. (Russian)
Tr. Inst. Mat., Minsk 19, No. 2, 69-81 (2011).
11
FAST: an efficient decision procedure for deduction and static equivalence. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 11-20, electronic only (2011).
12
A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems. (English)
Optimization 60, No. 7-9, 1091-1104 (2011).
13
Monoidic codes in cryptography. (English)
Yang, Bo-Yin (ed.), Post-quantum cryptography. 4th international workshop, PQCrypto 2011, Taipei, Taiwan, November 29‒December 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25404-8/pbk). Lecture Notes in Computer Science 7071, 179-199 (2011).
14
Algorithms for matrix groups. (English)
Campbell, C.M. (ed.) et al., Groups St. Andrews 2009. Vol. II. Selected papers of the conference, University of Bath, Bath, UK, August 1‒15, 2009. Cambridge: Cambridge University Press (ISBN 978-0-521-27904-8/pbk). London Mathematical Society Lecture Note Series 388, 297-323 (2011).
15
Minimax regret path location on trees. (English)
Networks 58, No. 2, 147-158 (2011).
16
DESC: Distributed energy efficient scheme to cluster wireless sensor networks. (English)
Masip-Bruin, Xavier (ed.) et al., Wired/wireless internet communications. 9th IFIP TC 6 international conference, WWIC 2011, Vilanova i la Geltrú, Spain, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21559-9/pbk). Lecture Notes in Computer Science 6649, 234-246 (2011).
17
Navigating in a graph by aid of its spanning tree metric. (English)
SIAM J. Discrete Math. 25, No. 1, 306-332 (2011).
18
Parametric algorithms for 2-cyclic robot scheduling with interval processing times. (English)
J. Sched. 14, No. 3, 267-279 (2011).
19
On partitioning interval graphs into proper interval subgraphs and related problems. (English)
J. Graph Theory 68, No. 1, 38-54 (2011).
20
Result 1 to 20 of 416 total
Start
Contact
Print
General Help
