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...

Equitable partitions into matchings and coverings in mixed graphs

Discrete mathematics, 2022-01, Vol.345 (1), p.112651, Article 112651

2022

Volltextzugriff (PDF)

Base polyhedra and the linking property

Journal of combinatorial optimization, 2018-10, Vol.36 (3), p.671-677

Király, Tamás

2018

Volltextzugriff (PDF)

Scheduling with non-renewable resources: minimizing the sum of completion times

Journal of scheduling, 2024-04, Vol.27 (2), p.151-164

2024

Volltextzugriff (PDF)

Manipulating the outcome of stable marriage and roommates problems

Games and economic behavior, 2024-09, Vol.147, p.407-428

2024

Volltextzugriff (PDF)

Approximation by lexicographically maximal solutions in matching and matroid intersection problems

Theoretical computer science, 2022-04, Vol.910, p.48-53

2022

Volltextzugriff (PDF)

On the complexity of packing rainbow spanning trees

Discrete mathematics, 2023-04, Vol.346 (4), p.113297, Article 113297

2023

Volltextzugriff (PDF)

Analyzing Residual Random Greedy for monotone submodular maximization

Information processing letters, 2023-02, Vol.180, p.106340, Article 106340

2023

Volltextzugriff (PDF)

FRACTURE TESTING OF EDGE-NOTCHED TIMBER BEAMS WITH DIFFERENT GROWTH RING ORIENTATIONS

Wood Research, 2023-01, Vol.68 (3), p.558-571

2023

Volltextzugriff (PDF)

Simulation of Static Tyre–Pavement Interaction Using Two FE Models of Different Complexity

Applied sciences, 2022-03, Vol.12 (5), p.2388

2022

Volltextzugriff (PDF)

Minimizing submodular functions on diamonds via generalized fractional matroid matchings

Journal of combinatorial theory. Series B, 2022-11, Vol.157, p.294-345

2022

Volltextzugriff (PDF)

Finding strongly popular b-matchings in bipartite graphs

European journal of combinatorics, 2020-08, Vol.88, p.103105, Article 103105

2020

Volltextzugriff (PDF)

Matroid Intersection under Restricted Oracles

SIAM journal on discrete mathematics, 2023-01, Vol.37 (2), p.1311-1330

2023

Volltextzugriff (PDF)

Optimization methods and algorithms

Central European journal of operations research, 2024-03, Vol.32 (1), p.1-9

2024

Volltextzugriff (PDF)

Beating the 2-approximation factor for global bicut

Mathematical programming, 2019-09, Vol.177 (1-2), p.291-320

2019

Volltextzugriff (PDF)

MODELING THE EARLYWOOD AND LATEWOOD GROWTH RINGS OF NORWAY SPRUCE TIMBER BEAMS FOR FINITE ELEMENT CALCULATION

Wood Research, 2023-01, Vol.68 (1), p.28-43

2023

Volltextzugriff (PDF)

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology

IEEE access, 2022, Vol.10, p.120312-120328

2022

Volltextzugriff (PDF)

Blocking optimal structures

Discrete mathematics, 2018-07, Vol.341 (7), p.1864-1872

2018

Volltextzugriff (PDF)

An extension of Lehman’s theorem and ideal set functions

Discrete Applied Mathematics, 2016-08, Vol.209, p.251-263

2016

Volltextzugriff (PDF)

Degree bounded matroids and submodular flows

Combinatorica (Budapest. 1981), 2012-12, Vol.32 (6), p.703-720

2012

Volltextzugriff (PDF)

Covering Intersecting Bi-set Families under Matroid Constraints

SIAM journal on discrete mathematics, 2016-01, Vol.30 (3), p.1758-1774

2016

Volltextzugriff (PDF)

Characterizing and recognizing generalized polymatroids

Mathematical programming, 2014-08, Vol.146 (1-2), p.245-273

2014

Volltextzugriff (PDF)

PPAD-completeness of polyhedral versions of Sperner’s Lemma

Discrete mathematics, 2013-08, Vol.313 (15), p.1594-1599

2013

Volltextzugriff (PDF)

Stable Multicommodity Flows

Algorithms, 2013-03, Vol.6 (1), p.161-168

2013

Volltextzugriff (PDF)

A unifying approach to splitting-off

Combinatorica (Budapest. 1981), 2012-04, Vol.32 (4), p.373-401

2012

Volltextzugriff (PDF)

Popular Branchings and Their Dual Certificates

Integer Programming and Combinatorial Optimization, 2020, Vol.12125, p.223-237

2020

Volltextzugriff (PDF)

1 – 25 von 259

Menü

Weitere Dienste

Einstellungen

Equitable partitions into matchings and coverings in mixed graphs

Base polyhedra and the linking property

Scheduling with non-renewable resources: minimizing the sum of completion times

Manipulating the outcome of stable marriage and roommates problems

Approximation by lexicographically maximal solutions in matching and matroid intersection problems

On the complexity of packing rainbow spanning trees

Analyzing Residual Random Greedy for monotone submodular maximization

FRACTURE TESTING OF EDGE-NOTCHED TIMBER BEAMS WITH DIFFERENT GROWTH RING ORIENTATIONS

Simulation of Static Tyre–Pavement Interaction Using Two FE Models of Different Complexity

Minimizing submodular functions on diamonds via generalized fractional matroid matchings

Finding strongly popular b-matchings in bipartite graphs

Matroid Intersection under Restricted Oracles

Optimization methods and algorithms

Beating the 2-approximation factor for global bicut

MODELING THE EARLYWOOD AND LATEWOOD GROWTH RINGS OF NORWAY SPRUCE TIMBER BEAMS FOR FINITE ELEMENT CALCULATION

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology

Blocking optimal structures

An extension of Lehman’s theorem and ideal set functions

Degree bounded matroids and submodular flows

Covering Intersecting Bi-set Families under Matroid Constraints

Characterizing and recognizing generalized polymatroids

PPAD-completeness of polyhedral versions of Sperner’s Lemma

Stable Multicommodity Flows

A unifying approach to splitting-off

Popular Branchings and Their Dual Certificates

Suchergebnisse filtern