UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs

Algorithmica, 2024, Vol.86 (1), p.194-217

2024

Volltextzugriff (PDF)

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem

European journal of operational research, 2007, Vol.176 (1), p.423-434

2007

Volltextzugriff (PDF)

An interdisciplinary experimental evaluation on the disjunctive temporal problem

Constraints : an international journal, 2023-03, Vol.28 (1), p.1-12

2023

Volltextzugriff (PDF)

Safety in s-t Paths, Trails and Walks

Algorithmica, 2022-03, Vol.84 (3), p.719-741

2022

Volltextzugriff (PDF)

Approximating the maximum 3-edge-colorable subgraph problem

Discrete mathematics, 2009-06, Vol.309 (12), p.4166-4170

Rizzi, Romeo

2009

Volltextzugriff (PDF)

The firefighter problem for graphs of maximum degree three

Discrete mathematics, 2007-07, Vol.307 (16), p.2094-2105

2007

Volltextzugriff (PDF)

Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution

Theoretical computer science, 2019-12, Vol.797, p.2-16

2019

Volltextzugriff (PDF)

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs

Algorithms – ESA 2011, p.275-286

Volltextzugriff (PDF)

Hierarchical clustering using the arithmetic-harmonic cut: complexity and experiments

PloS one, 2010-12, Vol.5 (12), p.e14067-e14067

2010

Volltextzugriff (PDF)

Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games

Algorithmica, 2017-04, Vol.77 (4), p.995-1021

2017

Volltextzugriff (PDF)

Permutation Pattern matching in (213, 231)-avoiding permutations

Discrete mathematics and theoretical computer science, 2017-03, Vol.18 no. 2, Permutation... (Permutation Patterns), p.14.1-22

2017

Volltextzugriff (PDF)

An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication

Algorithmica, 2018-12, Vol.80 (12), p.3525-3562

2018

Volltextzugriff (PDF)

Some simple distributed algorithms for sparse networks

Distributed computing, 2001-04, Vol.14 (2), p.97-100

2001

Volltextzugriff (PDF)

Dynamic controllability of temporal networks with instantaneous reaction

Information sciences, 2022-10, Vol.613, p.932-952

2022

Volltextzugriff (PDF)

Listing the bonds of a graph in O˜(n)–delay

Discrete Applied Mathematics, 2024-05, Vol.348, p.105-121

2024

Volltextzugriff (PDF)

On recognising words that are squares for the shuffle product

Theoretical computer science, 2023-05, Vol.956, p.111156-16, Article 111156

2023

Volltextzugriff (PDF)

Solving the train marshalling problem by inclusion–exclusion

Discrete Applied Mathematics, 2017-01, Vol.217, p.685-690

2017

Volltextzugriff (PDF)

Recognizing unit multiple interval graphs is hard

Discrete Applied Mathematics, 2025-01, Vol.360, p.258-274

2025

Volltextzugriff (PDF)

Revisiting Viewing Graph Solvability: an Effective Approach Based on Cycle Consistency

IEEE transactions on pattern analysis and machine intelligence, 2022-10, Vol.PP, p.1-14

2022

Volltextzugriff (PDF)

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm

Information and computation, 2018-04, Vol.259 (3), p.348-374

2018

Volltextzugriff (PDF)

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games

Information and computation, 2018-04, Vol.259, p.348-374

2018

Volltextzugriff (PDF)

Solving the probabilistic profitable tour problem on a line

Optimization letters, 2023-11, Vol.17 (8), p.1873-1888

2023

Volltextzugriff (PDF)

Faster FPTASes for counting and random generation of Knapsack solutions

Information and computation, 2019-08, Vol.267, p.135-144

2019

Volltextzugriff (PDF)

Checking Sets of Pure Evolving Association Rules

Fundamenta informaticae, 2021-01, Vol.178 (4), p.283-313

2021

Volltextzugriff (PDF)

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way

Information and computation, 2021-10, Vol.280, p.104637, Article 104637

2021

Volltextzugriff (PDF)

1 – 25 von 247

Menü

Weitere Dienste

Einstellungen

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem

An interdisciplinary experimental evaluation on the disjunctive temporal problem

Safety in s-t Paths, Trails and Walks

Approximating the maximum 3-edge-colorable subgraph problem

The firefighter problem for graphs of maximum degree three

Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs

Hierarchical clustering using the arithmetic-harmonic cut: complexity and experiments

Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games

Permutation Pattern matching in (213, 231)-avoiding permutations

An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication

Some simple distributed algorithms for sparse networks

Dynamic controllability of temporal networks with instantaneous reaction

Listing the bonds of a graph in O˜(n)–delay

On recognising words that are squares for the shuffle product

Solving the train marshalling problem by inclusion–exclusion

Recognizing unit multiple interval graphs is hard

Revisiting Viewing Graph Solvability: an Effective Approach Based on Cycle Consistency

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games

Solving the probabilistic profitable tour problem on a line

Faster FPTASes for counting and random generation of Knapsack solutions

Checking Sets of Pure Evolving Association Rules

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way

Suchergebnisse filtern