History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 260 total

A branch-and-cut-and-price approach for the capacitated $m$-ring-star problem. (English)
Discrete Appl. Math. 160, No. 18, 2728-2741 (2012).
1
The maximum common edge subgraph problem: A polyhedral investigation. (English)
Discrete Appl. Math. 160, No. 18, 2523-2541 (2012).
2
Polyhedral study of the maximum common induced subgraph problem. (English)
Ann. Oper. Res. 199, 77-102 (2012).
3
The minimum stabbing triangulation problem: IP models and computational evaluation. (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, 36-47 (2012).
4
Interactive analysis of computer scenarios through parallel coordinates graphics. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2012. 12th international conference, Salvador de Bahia, Brazil, June 18‒21, 2012. Proceedings, Part IV. Berlin: Springer (ISBN 978-3-642-31127-7/pbk). Lecture Notes in Computer Science 7336, 314-325 (2012).
5
Predicting potential responders in Twitter: a query routing algorithm. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2012. 12th international conference, Salvador de Bahia, Brazil, June 18‒21, 2012. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-31136-9/pbk). Lecture Notes in Computer Science 7335, 714-729 (2012).
6
Collaborative refactoring: results of an empirical study using grounded theory. (English)
Vivacqua, Adriana S. (ed.) et al., Collaboration and technology. 17th international conference, CRIWG 2011, Paraty, Brazil, October 2‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23800-0/pbk). Lecture Notes in Computer Science 6969, 73-80 (2011).
7
Using metaphors to explore cultural perspectives in cross-cultural design. (English)
Rau, P. L. Patrick (ed.), Internationalization, design and global development. 4th international conference, IDGD 2011, held as Part of HCI international 2011, Orlando, FL, USA, July 9‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21659-6/pbk). Lecture Notes in Computer Science 6775, 94-103 (2011).
8
Embedded cultural features in the design of an accessibility agent for the web. (English)
Stephanidis, Constantine (ed.), Universal access in human-computer interaction. Design for all and einclusion. 6th international conference, UAHCI 2011, held as Part of HCI international 2011, Orlando, FL, USA, July 9‒14, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-21671-8/pbk). Lecture Notes in Computer Science 6765, 295-304 (2011).
9
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. (English)
Discrete Appl. Math. 159, No. 16, 1901-1914 (2011).
10
Semiotic traces of computational thinking acquisition. (English)
Costabile, Maria Francesca (ed.) et al., End-user development. Third international symposium, IS-EUD 2011, Torre Canne (BR), Italy, June 7‒10, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21529-2/pbk). Lecture Notes in Computer Science 6654, 155-170 (2011).
11
A branch-and-price approach for the partition coloring problem. (English)
Oper. Res. Lett. 39, No. 2, 132-137 (2011).
12
INTERACTING WITH PUBLIC POLICY: are HCI researchers an endangered species in Brazil? (English)
Interactions 18, No. 3, 69-71 (2011).
13
Optimizing the layout of proportional symbol maps. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2011. International conference, Santander, Spain, June 20‒23, 2011. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-21930-6/pbk). Lecture Notes in Computer Science 6784, 1-16 (2011).
14
Exact algorithms for the vertex separator problem in graphs. (English)
Networks 57, No. 3, 212-230 (2011).
15
Experimental evaluation of algorithms for the orthogonal milling problem with turn costs. (English)
Pardalos, Panos M. (ed.) et al., Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20661-0/pbk). Lecture Notes in Computer Science 6630, 304-314 (2011).
16
An exact approach to the problem of extracting an embedded network matrix. (English)
Comput. Oper. Res. 38, No. 11, 1483-1492 (2011).
17
The awareness network, to whom should I display my actions? and, whose actions should I monitor? (English)
IEEE Trans. Software Eng. 37, No. 3, 325-340 (2011).
18
New branch-and-bound algorithms for k-cardinality tree problems (English)
Electronic Notes in Discrete Mathematics 37, 27-32 (2011).
19
Parameter-dependent robust $H_{\infty }$ filtering for linear systems with time-varying delay and rational parameter uncertainty (English)
IMA J. Math. Control & Information 28, No. 2, 203-224 (2011).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 260 total