Search the dblp DataBase
George Steiner :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Stavros G. Kolliopoulos , George Steiner Partially-Ordered Knapsack and Applications to Scheduling. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:612-624 [Conf ] Stavros G. Kolliopoulos , George Steiner On Minimizing the Total Weighted Tardiness on a Single Machine. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:176-186 [Conf ] George Steiner A poset-based method for counting partitions and Ferrers diagrams. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1997, v:47, n:, pp:- [Journal ] Jitender S. Deogun , George Steiner Hamiltonian Cycle is Polynomial on Cocomparability Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:39, n:2, pp:165-172 [Journal ] Michel Habib , Raoul Medina , Lhouari Nourine , George Steiner Efficient algorithms on distributive lattices. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:169-187 [Journal ] George Steiner Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:167-177 [Journal ] George Steiner , Zhihui Xue The maximum traveling salesman problem on van der Veen matrices. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:146, n:1, pp:1-2 [Journal ] Stavros G. Kolliopoulos , George Steiner Partially ordered knapsack and applications to scheduling. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:8, pp:889-897 [Journal ] Jitender S. Deogun , Dieter Kratsch , George Steiner An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:3, pp:121-127 [Journal ] George Steiner , Scott Yeomans A Note on ``Scheduling Unit-Time Tasks with Integer Release Times and Deadlines''. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:47, n:3, pp:165-166 [Journal ] Michel Habib , Lhouari Nourine , George Steiner Gray Codes for the Ideals of Interval Orders. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:1, pp:52-66 [Journal ] George Steiner Searching in 2-Dimensional Partial Orders. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1987, v:8, n:1, pp:95-105 [Journal ] Vladimir G. Deineko , George Steiner , Zhihui Xue Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2005, v:9, n:4, pp:381-399 [Journal ] Jiang Chen , George Steiner Approximation methods for discrete lot streaming in flow shops. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 1997, v:21, n:3, pp:139-145 [Journal ] Dvir Shabtay , George Steiner Two due date assignment problems in scheduling a single machine. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2006, v:34, n:6, pp:683-691 [Journal ] George Steiner , Zhihui Xue Scheduling in Reentrant Robotic Cells: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2005, v:8, n:1, pp:25-48 [Journal ] George Steiner , Zhihui Xue On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2006, v:9, n:4, pp:381-387 [Journal ] Jitender S. Deogun , George Steiner Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:3, pp:520-552 [Journal ] George Steiner , Paul Stephenson Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2000, v:13, n:4, pp:419-435 [Journal ] Stavros G. Kolliopoulos , George Steiner Approximation algorithms for minimizing the total weighted tardiness on a single machine. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:355, n:3, pp:261-273 [Journal ] George Steiner On the k-path partition of graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:290, n:3, pp:2147-2155 [Journal ] Esaignani Selvarajah , George Steiner Batch scheduling in a two-level supply chain - a focus on the supplier. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2006, v:173, n:1, pp:226-240 [Journal ] George Steiner , Paul Stephenson Pareto optima for total weighted completion time and maximum lateness on a single machine. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:17, pp:2341-2354 [Journal ] Dvir Shabtay , George Steiner A survey of scheduling with controllable processing times. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:13, pp:1643-1666 [Journal ] George Steiner Minimizing bumps in ordered sets by substitution decomposition. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:76, n:3, pp:285-289 [Journal ] Jitender S. Deogun , Dieter Kratsch , George Steiner 1-Tough cocomparability graphs are hamiltonian. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:170, n:1-3, pp:99-106 [Journal ] Partioning A Bipartite Graph into Vertex-Disjoint Paths. [Citation Graph (, )][DBLP ] Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. [Citation Graph (, )][DBLP ] 'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.005secs