UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 150

Sortiert nach

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings

1, 2022

Link zum Volltext

Verfügbarkeit prüfen

Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022

Algorithmica, 2024, Vol.86 (3), p.695-696

2024

Link zum Volltext

Verfügbarkeit prüfen

One-exact approximate Pareto sets

Journal of global optimization, 2021-05, Vol.80 (1), p.87-115

2021

Link zum Volltext

Verfügbarkeit prüfen

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems

Theory of computing systems, 2022-02, Vol.66 (1), p.395-415

2022

Link zum Volltext

Verfügbarkeit prüfen

An approximation algorithm for a general class of parametric optimization problems

Journal of combinatorial optimization, 2022-07, Vol.43 (5), p.1328-1358

2022

Link zum Volltext

Verfügbarkeit prüfen

An approximation algorithm for the maximum spectral subgraph problem

Journal of combinatorial optimization, 2022-10, Vol.44 (3), p.1880-1899

2022

Link zum Volltext

Verfügbarkeit prüfen

Solving efficiently the 0–1 multi-objective knapsack problem

Computers & operations research, 2009, Vol.36 (1), p.260-279

2009

Link zum Volltext

Verfügbarkeit prüfen

Min–max and min–max regret versions of combinatorial optimization problems: A survey

European journal of operational research, 2009-09, Vol.197 (2), p.427-438

2009

Link zum Volltext

Verfügbarkeit prüfen

Approximation of min–max and min–max regret versions of some combinatorial optimization problems

European journal of operational research, 2007-06, Vol.179 (2), p.281-290

2007

Link zum Volltext

Verfügbarkeit prüfen

Complexity of the min–max and min–max regret assignment problems

Operations research letters, 2005-11, Vol.33 (6), p.634-640

2005

Link zum Volltext

Verfügbarkeit prüfen

General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems

Discrete optimization, 2010-08, Vol.7 (3), p.136-148

2010

Link zum Volltext

Verfügbarkeit prüfen

Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness

Theoretical computer science, 2005-06, Vol.339 (2), p.272-292

2005

Link zum Volltext

Verfügbarkeit prüfen

Efficient algorithms for decomposing graphs under degree constraints

Discrete Applied Mathematics, 2007-04, Vol.155 (8), p.979-988

2007

Link zum Volltext

Verfügbarkeit prüfen

Parameterized and approximation complexity of Partial VC Dimension

Theoretical computer science, 2019-04, Vol.766, p.1-15

2019

Link zum Volltext

Verfügbarkeit prüfen

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels

European journal of operational research, 2017-08, Vol.260 (3), p.814-827

2017

Link zum Volltext

Verfügbarkeit prüfen

Degree-anonymization using edge rotations

Theoretical computer science, 2021-06, Vol.873, p.1-15

2021

Link zum Volltext

Verfügbarkeit prüfen

Finding a potential community in networks

Theoretical computer science, 2019-05, Vol.769, p.32-42

2019

Link zum Volltext

Verfügbarkeit prüfen

Approximating multiobjective optimization problems: How exact can you be?

Mathematical methods of operations research (Heidelberg, Germany), 2023-09

2023

Link zum Volltext

Verfügbarkeit prüfen

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability

Discrete Applied Mathematics, 2020-06, Vol.280, p.23-42

2020

Link zum Volltext

Verfügbarkeit prüfen

Structural and Algorithmic Properties of 2-Community Structures

Algorithmica, 2018-06, Vol.80 (6), p.1890-1908

2018

Link zum Volltext

Verfügbarkeit prüfen

Approximate Pareto sets of minimal size for multi-objective optimization problems

Operations research letters, 2015-01, Vol.43 (1), p.1-6

2015

Link zum Volltext

Verfügbarkeit prüfen

Degree-constrained decompositions of graphs: Bounded treewidth and planarity

Theoretical computer science, 2006-04, Vol.355 (3), p.389-395

2006

Link zum Volltext

Verfügbarkeit prüfen

Aspects of upper defensive alliances

Discrete Applied Mathematics, 2019-08, Vol.266, p.111-120

2019

Link zum Volltext

Verfügbarkeit prüfen

The most vital nodes with respect to independent set and vertex cover

Discrete Applied Mathematics, 2011-10, Vol.159 (17), p.1933-1946

2011

Link zum Volltext

Verfügbarkeit prüfen

Graphs without a partition into two proportionally dense subgraphs

Information processing letters, 2020-03, Vol.155, p.105877, Article 105877

2020

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 150

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(100)
Mit Volltextzugriff
(150)

Publikationsform

Sprache

Englisch
(150)
Japanisch
(9)

Erscheinungsjahr

n.n

Thema

Science & Technology
(93)
Computer Science
(85)
Technology
(76)
Mathematics
(54)
Computer Science, Theory & Methods
(48)
Physical Sciences
(48)
Mathematics, Applied
(38)
Exact Sciences And Technology
(29)
Applied Sciences
(27)
Approximation
(25)
Complexity
(23)
Computer Science; Control Theory; Systems
(20)
Operations Research & Management Science
(18)
Theoretical Computing
(18)
Graph Theory
(16)
Algorithms
(15)
Approximation Algorithm
(15)
Combinatorics
(14)
Algorithmics. Computability. Computer Arithmetics
(13)
Optimization
(13)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings

Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022

One-exact approximate Pareto sets

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems

An approximation algorithm for a general class of parametric optimization problems

An approximation algorithm for the maximum spectral subgraph problem

Solving efficiently the 0–1 multi-objective knapsack problem

Min–max and min–max regret versions of combinatorial optimization problems: A survey

Approximation of min–max and min–max regret versions of some combinatorial optimization problems

Complexity of the min–max and min–max regret assignment problems

General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems

Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness

Efficient algorithms for decomposing graphs under degree constraints

Parameterized and approximation complexity of Partial VC Dimension

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels

Degree-anonymization using edge rotations

Finding a potential community in networks

Approximating multiobjective optimization problems: How exact can you be?

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability

Structural and Algorithmic Properties of 2-Community Structures

Approximate Pareto sets of minimal size for multi-objective optimization problems

Degree-constrained decompositions of graphs: Bounded treewidth and planarity

Aspects of upper defensive alliances

The most vital nodes with respect to independent set and vertex cover

Graphs without a partition into two proportionally dense subgraphs

Suchergebnisse filtern