| Publication | Date of Publication | Type |
|---|
| Vertex ranking of asteroidal triple-free graphs | 2023-01-25 | Paper |
OBDD minimization based on two-level representation of Boolean functions
IEEE Transactions on Computers | 2018-07-09 | Paper |
Vertex ranking of asteroidal triple-free graphs
Information Processing Letters | 2016-06-09 | Paper |
| scientific article; zbMATH DE number 6118225 (Why is no real title available?) | 2012-12-23 | Paper |
Approximation of Boolean functions by local search
Computational Optimization and Applications | 2004-03-15 | Paper |
An experimental analysis of local minima to improve neighbourhood search.
Computers & Operations Research | 2004-02-14 | Paper |
On-line algorithms for minimizing makespan on batch processing machines
Naval Research Logistics | 2003-09-15 | Paper |
On the convergence of inhomogeneous Markov chains approximating equilibrium placements of flexible objects
Computational Optimization and Applications | 2003-08-26 | Paper |
| scientific article; zbMATH DE number 1928647 (Why is no real title available?) | 2003-06-16 | Paper |
Fast parallel heuristics for the job shop scheduling problem
Computers & Operations Research | 2003-03-18 | Paper |
| scientific article; zbMATH DE number 1759479 (Why is no real title available?) | 2002-11-25 | Paper |
An effective quasi-human based heuristic for solving the rectangle packing problem
European Journal of Operational Research | 2002-11-17 | Paper |
Time-varying minimum cost flow problems
European Journal of Operational Research | 2002-09-08 | Paper |
The convergence of stochastic algorithms solving flow shop scheduling
Theoretical Computer Science | 2002-08-05 | Paper |
| Non-static network optimization problems: A survey | 2002-07-24 | Paper |
Rooted spanning trees in tournaments
Graphs and Combinatorics | 2002-07-22 | Paper |
Steiner trees in general nonuniform orientations
Computing | 2002-03-14 | Paper |
The \(K_r\)-packing problem
Computing | 2002-01-24 | Paper |
On fixed edges and edge-reconstruction of series-parallel networks
Graphs and Combinatorics | 2002-01-08 | Paper |
Combining the perceptron algorithm with logarithmic simulated annealing
Neural Processing Letters | 2001-10-10 | Paper |
Minimizing makespan on a single batch processing machine with nonidentical job sizes
Naval Research Logistics | 2001-09-09 | Paper |
Time-varying universal maximum flow problems
Mathematical and Computer Modelling | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1507222 (Why is no real title available?) | 2000-12-06 | Paper |
On avoidable and unavoidable claws
Discrete Mathematics | 2000-11-02 | Paper |
On the bounded domination number of tournaments
Discrete Mathematics | 2000-06-21 | Paper |
Two simulated annealing-based heuristics for the job shop scheduling problem
European Journal of Operational Research | 2000-04-04 | Paper |
The strong Hall property and symmetric chain orders
Discrete Mathematics | 2000-03-13 | Paper |
| Onk-ary spanning trees of tournaments | 1999-11-14 | Paper |
| scientific article; zbMATH DE number 1262785 (Why is no real title available?) | 1999-08-17 | Paper |
| scientific article; zbMATH DE number 1301968 (Why is no real title available?) | 1999-06-16 | Paper |
On the optimal four-way switch box routing structures of FPGA greedy routing architectures
Integration | 1999-01-12 | Paper |
| A Continuity Theorem for Fuchsian Groups | 1972-01-01 | Paper |
Orthogonal \((g,f)\)-factorizations of bipartite graphs
Hokkaido Mathematical Journal | 0001-01-03 | Paper |
