| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
|
Pedrosa, Lehilton Lelis Chaves
|
|
|
|
12 |
p. 3522-3558
|
artikel
|
| 2 |
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
|
Henzinger, Monika
|
|
|
|
12 |
p. 3680-3716
|
artikel
|
| 3 |
Algebraic Restriction Codes and Their Applications
|
Aggarwal, Divesh
|
|
|
|
12 |
p. 3602-3648
|
artikel
|
| 4 |
An Adversarial Model for Scheduling with Testing
|
Dürr, Christoph
|
|
|
|
12 |
p. 3630-3675
|
artikel
|
| 5 |
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
|
Comin, Carlo
|
|
2017
|
|
12 |
p. 3525-3562
|
artikel
|
| 6 |
A Polynomial Kernel for Trivially Perfect Editing
|
Drange, Pål Grønås
|
|
2017
|
|
12 |
p. 3481-3524
|
artikel
|
| 7 |
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations
|
Elbassioni, Khaled
|
|
|
|
12 |
p. 3622-3654
|
artikel
|
| 8 |
Approximation Algorithms for Maximally Balanced Connected Graph Partition
|
Chen, Yong
|
|
|
|
12 |
p. 3715-3740
|
artikel
|
| 9 |
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
|
Kacem, Imed
|
|
2018
|
|
12 |
p. 3825-3843
|
artikel
|
| 10 |
Best-of-Both-Worlds Analysis of Online Search
|
Angelopoulos, Spyros
|
|
|
|
12 |
p. 3766-3792
|
artikel
|
| 11 |
Canonical Representations for Circular-Arc Graphs Using Flip Sets
|
Chandoo, Maurice
|
|
2018
|
|
12 |
p. 3646-3672
|
artikel
|
| 12 |
Comparison of Matrix Norm Sparsification
|
Krauthgamer, Robert
|
|
|
|
12 |
p. 3957-3972
|
artikel
|
| 13 |
Counting Minimum Weight Arborescences
|
Hayashi, Koyo
|
|
2018
|
|
12 |
p. 3908-3919
|
artikel
|
| 14 |
Deterministic Dynamic Matching in Worst-Case Update Time
|
Kiss, Peter
|
|
|
|
12 |
p. 3741-3765
|
artikel
|
| 15 |
Distinct Fringe Subtrees in Random Trees
|
Seelbach Benkner, Louisa
|
|
|
|
12 |
p. 3686-3728
|
artikel
|
| 16 |
Dynamic and Internal Longest Common Substring
|
Amir, Amihood
|
|
|
|
12 |
p. 3707-3743
|
artikel
|
| 17 |
Dynamic Path Queries in Linear Space
|
He, Meng
|
|
2018
|
|
12 |
p. 3728-3765
|
artikel
|
| 18 |
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
|
Masumura, Yuya
|
|
|
|
12 |
p. 3681-3714
|
artikel
|
| 19 |
Editor’s Note
|
|
|
2018
|
|
12 |
p. 3958
|
artikel
|
| 20 |
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium
|
|
|
|
|
12 |
p. 3521
|
artikel
|
| 21 |
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
|
Bläsius, Thomas
|
|
|
|
12 |
p. 3487-3520
|
artikel
|
| 22 |
Enumerating k-Arc-Connected Orientations
|
Blind, Sarah
|
|
|
|
12 |
p. 3588-3603
|
artikel
|
| 23 |
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
|
Gupta, Sushmita
|
|
|
|
12 |
p. 3717-3740
|
artikel
|
| 24 |
Exponential-Time Quantum Algorithms for Graph Coloring Problems
|
Shimizu, Kazuya
|
|
|
|
12 |
p. 3603-3621
|
artikel
|
| 25 |
Extreme Witnesses and Their Applications
|
Lingas, Andrzej
|
|
2018
|
|
12 |
p. 3943-3957
|
artikel
|
| 26 |
Fast Approximation Algorithms for p-Centers in Large $$\delta $$δ-Hyperbolic Graphs
|
Edwards, Katherine
|
|
2018
|
|
12 |
p. 3889-3907
|
artikel
|
| 27 |
Fault Tolerant Approximate BFS Structures with Additive Stretch
|
Parter, Merav
|
|
|
|
12 |
p. 3458-3491
|
artikel
|
| 28 |
Fault-Tolerant Approximate Shortest-Path Trees
|
Bilò, Davide
|
|
2017
|
|
12 |
p. 3437-3460
|
artikel
|
| 29 |
Finding Geometric Facilities with Location Privacy
|
Nussbaum, Eyal
|
|
|
|
12 |
p. 3572-3601
|
artikel
|
| 30 |
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes
|
Barequet, Gill
|
|
|
|
12 |
p. 3559-3586
|
artikel
|
| 31 |
Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography
|
Meiburg, Alexander
|
|
|
|
12 |
p. 3828-3854
|
artikel
|
| 32 |
$$(k,n-k)$$(k,n-k)-Max-Cut: An $$\mathcal{O}^*(2^p)$$O∗(2p)-Time Algorithm and a Polynomial Kernel
|
Saurabh, Saket
|
|
2018
|
|
12 |
p. 3844-3860
|
artikel
|
| 33 |
Lift-and-Project Methods for Set Cover and Knapsack
|
Chlamtáč, Eden
|
|
2018
|
|
12 |
p. 3920-3942
|
artikel
|
| 34 |
Local Geometric Spanners
|
Abam, Mohammad Ali
|
|
|
|
12 |
p. 3629-3648
|
artikel
|
| 35 |
Maximum Box Problem on Stochastic Points
|
Caraballo, Luis E.
|
|
|
|
12 |
p. 3741-3765
|
artikel
|
| 36 |
Monotone Circuit Lower Bounds from Robust Sunflowers
|
Cavalar, Bruno Pasqualotto
|
|
|
|
12 |
p. 3655-3685
|
artikel
|
| 37 |
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization
|
Liu, Fu-Hong
|
|
|
|
12 |
p. 3415-3457
|
artikel
|
| 38 |
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
|
Dehghan, Ali
|
|
2018
|
|
12 |
p. 3704-3727
|
artikel
|
| 39 |
On Colorful Vertex and Edge Cover Problems
|
Bandyapadhyay, Sayan
|
|
|
|
12 |
p. 3816-3827
|
artikel
|
| 40 |
Online Makespan Scheduling with Job Migration on Uniform Machines
|
Englert, Matthias
|
|
|
|
12 |
p. 3537-3566
|
artikel
|
| 41 |
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
|
Al-Bawani, Kamal
|
|
2018
|
|
12 |
p. 3861-3888
|
artikel
|
| 42 |
On Scheduling Coflows
|
Ahmadi, Saba
|
|
|
|
12 |
p. 3604-3629
|
artikel
|
| 43 |
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms
|
Corus, Dogan
|
|
|
|
12 |
p. 3676-3706
|
artikel
|
| 44 |
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
|
Blair, Jean R. S.
|
|
|
|
12 |
p. 3587-3602
|
artikel
|
| 45 |
Opinion Dynamics with Limited Information
|
Fotakis, Dimitris
|
|
|
|
12 |
p. 3855-3888
|
artikel
|
| 46 |
Parameterized Complexity of Length-bounded Cuts and Multicuts
|
Dvořák, Pavel
|
|
2018
|
|
12 |
p. 3597-3617
|
artikel
|
| 47 |
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
|
Arvind, V.
|
|
|
|
12 |
p. 3567-3601
|
artikel
|
| 48 |
Path Refinement in Weighted Regions
|
Gheibi, Amin
|
|
2018
|
|
12 |
p. 3766-3802
|
artikel
|
| 49 |
Peak Demand Minimization via Sliced Strip Packing
|
Deppert, Max A.
|
|
|
|
12 |
p. 3649-3679
|
artikel
|
| 50 |
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics
|
Klootwijk, Stefan
|
|
|
|
12 |
p. 3793-3815
|
artikel
|
| 51 |
Quantifying Competitiveness in Paging with Locality of Reference
|
Albers, Susanne
|
|
2018
|
|
12 |
p. 3563-3596
|
artikel
|
| 52 |
Quasimetric Embeddings and Their Applications
|
Mémoli, Facundo
|
|
2018
|
|
12 |
p. 3803-3824
|
artikel
|
| 53 |
Self-Stabilizing Balls and Bins in Batches
|
Berenbrink, Petra
|
|
2018
|
|
12 |
p. 3673-3703
|
artikel
|
| 54 |
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
|
Bodlaender, Hans L.
|
|
|
|
12 |
p. 3566-3587
|
artikel
|
| 55 |
The Densest Subgraph Problem with a Convex/Concave Size Function
|
Kawase, Yasushi
|
|
2017
|
|
12 |
p. 3461-3480
|
artikel
|
| 56 |
The Fast Search Number of a Complete k-Partite Graph
|
Xue, Yuan
|
|
2018
|
|
12 |
p. 3959-3981
|
artikel
|
| 57 |
The Online Broadcast Range-Assignment Problem
|
de Berg, Mark
|
|
|
|
12 |
p. 3928-3956
|
artikel
|
| 58 |
The Power of Linear-Time Data Reduction for Maximum Matching
|
Mertzios, George B.
|
|
|
|
12 |
p. 3521-3565
|
artikel
|
| 59 |
The Sandwich Problem for Decompositions and Almost Monotone Properties
|
Chudnovsky, Maria
|
|
2018
|
|
12 |
p. 3618-3645
|
artikel
|
| 60 |
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes
|
Hernández, Félix
|
|
|
|
12 |
p. 3973-3995
|
artikel
|
| 61 |
Top Tree Compression of Tries
|
Bille, Philip
|
|
|
|
12 |
p. 3602-3628
|
artikel
|
| 62 |
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
|
Kratochvíl, Jan
|
|
|
|
12 |
p. 3649-3680
|
artikel
|
| 63 |
Unique Response Roman Domination: Complexity and Algorithms
|
Banerjee, Sumanta
|
|
|
|
12 |
p. 3889-3927
|
artikel
|
| 64 |
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
|
Binucci, Carla
|
|
|
|
12 |
p. 3521-3571
|
artikel
|
| 65 |
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs
|
Matl, Gregor
|
|
|
|
12 |
p. 3492-3520
|
artikel
|
Tijdschrift beschrijving