Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Theoretical Computer Science

Approximation algorithms for the bi-criteria weighted MAX-CUT problem

Discrete Applied Mathematics

Approximating component selection

WSC '04 Proceedings of the 36th conference on Winter simulation

Some competition programming problems as the beginning of artificial intelligence

Informatics in education

On k-connectivity problems with sharpened triangle inequality

Journal of Discrete Algorithms

Approximation hardness of deadline-TSP reoptimization

Theoretical Computer Science

A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form

Transportation Science

On k-edge-connectivity problems with sharpened triangle inequality

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

On the hardness of reoptimization

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science

Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems

Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov

Knowing all optimal solutions does not help for TSP reoptimization

Computation, cooperation, and life

Relational approach to boolean logic problems

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra

Relational implementation of simple parallel evolutionary algorithms

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra

Approximation algorithms for the bi-criteria weighted MAX-CUT problem

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Routing equal-size messages on a slotted ring

Journal of Scheduling

On the Hardness of Reoptimization with Multiple Given Solutions

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday