Result 1 to 20 from 308 total
Characterizing mechanisms in obnoxious facility game. (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, 301-311 (2012).
1
An improved exact algorithm for TSP in degree-4 graphs. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 74-85 (2012).
2
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. (English)
Theor. Comput. Sci. 445, 36-51 (2012).
3
Submodular minimization via pathwidth. (English)
Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 584-593 (2012).
4
A refined exact algorithm for edge dominating set. (English)
Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 360-372 (2012).
5
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. (English)
Algorithmica 62, No. 3-4, 787-806 (2012).
6
A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners. (English)
Algorithmica 62, No. 3-4, 1122-1158 (2012).
7
An FPT algorithm for edge subset feedback edge set. (English)
Inf. Process. Lett. 112, No. 1-2, 5-9 (2012).
8
An approximation algorithm for locating maximal disks within convex polygons. (English)
Int. J. Comput. Geom. Appl. 21, No. 6, 661-684 (2011).
9
Improved bounds for minimum fault-tolerant gossip graphs. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 203-214 (2011).
10
Extending Steinitz’s theorem to upward star-shaped polyhedra and spherical polyhedra. (English)
Algorithmica 61, No. 4, 1022-1076 (2011).
11
Special issue: ISAAC 2008. Selected papers from the 19th annual international symposium on algorithms and computation, Gold Coast, Australia, December 15‒17, 2008. (English)
Algorithmica 61, No. 4, 777-922 (2011).
12
An A* algorithm framework for the point-to-point time-dependent shortest path problem. (English)
Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3‒6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 154-163 (2011).
13
On the one-dimensional stock cutting problem in the paper tube industry. (English)
J. Sched. 14, No. 3, 281-290 (2011).
14
Further improvement on maximum independent set in degree-4 graphs. (English)
Wang, Weifan (ed.) et al., Combinatorial optimization and applications. 5th international conference, COCOA 2011, Zhangjiajie, China, August 4‒6, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22615-1/pbk). Lecture Notes in Computer Science 6831, 163-178 (2011).
15
Special issue: Selected papers from the 19th annual international symposium on algorithms and computation (ISAAC 2008), Gold Coast, Australia, December 15‒17, 2008. (English)
Int. J. Comput. Geom. Appl. 21, No. 3, 251-381 (2011).
16
Parameterized edge dominating set in cubic graphs. (Extended abstract). (English)
Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 100-112 (2011).
17
Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming. (English)
J. Math. Chem. 49, No. 4, 910-970 (2011).
18
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. (English)
Math. Program. 127, No. 2 (A), 297-343 (2011).
19
Approximating capacitated tree-routings in networks. (English)
J. Comb. Optim. 21, No. 2, 254-267 (2011).
20
Result 1 to 20 from 308 total
Start
Contact
Print
General Help
