Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top

Theory of Computing Systems

Issue 4/2012

Content (9 Articles)

An Effective Carathéodory Theorem

Timothy H. McNicholl

The Efficiency of Fair Division

Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou

Cops and Robber Game Without Recharging

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov

Effective Versions of Local Connectivity Properties

Dale Daniel, Timothy H. McNicholl

Open Access

Structure of Polynomial-Time Approximation

Erik Jan van Leeuwen, Jan van Leeuwen

Parameterizing by the Number of Numbers

Michael R. Fellows, Serge Gaspers, Frances A. Rosamond

Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems

Mark Burgin, Bidyut Gupta

Open Access

On the Contribution of Backward Jumps to Instruction Sequence Expressiveness

Jan A. Bergstra, Inge Bethke

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs

Ruo-Wei Hung

Apr 12
Issue: 3/2012
Jul 12
Issue: 1/2012
Computability in Europe: Mathematical Theory and Computational Practice

Current Publications

scroll for more

use your arrow keys for more

scroll or use arrow keys for more

Premium Partner

    Image Credits