Result 1 to 20 of 2268 total
4-coloring $H$-free graphs when $H$ is small. (English)
Discrete Appl. Math. 161, No. 1-2, 140-150 (2013).
1
The best choice problem for upward directed graphs. (English)
Discrete Optim. 9, No. 3, 200-204 (2012).
2
Finding a sun in building-free graphs. (English)
Graphs Comb. 28, No. 3, 347-364 (2012).
3
Average consensus on general strongly connected digraphs. (English)
Automatica 48, No. 11, 2750-2761 (2012).
4
Inapproximability of orthogonal compaction. (English)
J. Graph Algorithms Appl. 16, No. 3, 651-673 (2012).
5
Hardness results on the gapped consecutive-ones property problem. (English)
Discrete Appl. Math. 160, No. 18, 2760-2768 (2012).
6
On edge-sets of bicliques in graphs. (English)
Discrete Appl. Math. 160, No. 18, 2698-2708 (2012).
7
The maximum common edge subgraph problem: A polyhedral investigation. (English)
Discrete Appl. Math. 160, No. 18, 2523-2541 (2012).
8
Pebble games and linear equations. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 289-304, electronic only (2012).
9
Full and partial Jacobian computation vie graph coloring: Algorithms and applications. (English)
Göttingen: Cuvillier; Aachen: Univ. Aachen, Fakultät für Mathematik, Informatik und Naturwissenschaften (Diss.) (ISBN 978-3-9540410-1-5). ii, 117~p. (2012).
10
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. (English)
Networks 60, No. 2, 103-119 (2012).
11
A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. (English)
Comput. Oper. Res. 39, No. 7, 1713-1723 (2012).
12
Measuring instance difficulty for combinatorial optimization problems. (English)
Comput. Oper. Res. 39, No. 5, 875-889 (2012).
13
Scheduling jobs on identical machines with agreement graph. (English)
Comput. Oper. Res. 39, No. 2, 382-390 (2012).
14
On the number of 2-packings in a connected graph. (English)
Discrete Math. 312, No. 23, 3444-3450 (2012).
15
Mind the gap: a study of tube tour. (English)
Comput. Oper. Res. 39, No. 11, 2705-2714 (2012).
16
Graph-based relational learning with a polynomial time projection algorithm. (English)
Muggleton, Stephen H. (ed.) et al., Inductive logic programming. 21st international conference, ILP 2011, Windsor Great Park, UK, July 31 ‒ August 3, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31950-1/pbk). Lecture Notes in Computer Science 7207. Lecture Notes in Artificial Intelligence, 98-112 (2012).
17
Parallel community detection for massive graphs. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 9th international conference, PPAM 2011, Torun, Poland, September 11‒14, 2011. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-31463-6/pbk). Lecture Notes in Computer Science 7203, 286-296 (2012).
18
Route planning with turn restrictions: A computational experiment. (English)
Oper. Res. Lett. 40, No. 5, 342-348 (2012).
19
Complexity of distance paired-domination problem in graphs. (English)
Theor. Comput. Sci. 459, 89-99 (2012).
20
Result 1 to 20 of 2268 total
Start
Contact
Print
General Help
