Matching with Couples: a Multidisciplinary Survey [PDF]
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Flip Klijn, Peter Biro
core
An efficient numerical method on modified space-time sparse grid for time-fractional diffusion equation with nonsmooth data. [PDF]
Zhu BY, Xiao AG, Li XY.
europepmc +1 more source
Computing nearest neighbour interchange distances between ranked phylogenetic trees. [PDF]
Collienne L, Gavryushkin A.
europepmc +1 more source
Covering Convex Bodies and the Closest Vector Problem. [PDF]
Naszódi M, Venzin M.
europepmc +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Continuous facility location on graphs. [PDF]
Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source
Maximum Matchings in Geometric Intersection Graphs. [PDF]
Bonnet É, Cabello S, Mulzer W.
europepmc +1 more source
New Results on Superlinear Convergence of Classical Quasi-Newton Methods. [PDF]
Rodomanov A, Nesterov Y.
europepmc +1 more source
Modeling calcium dynamics in neurons with endoplasmic reticulum: existence, uniqueness and an implicit-explicit finite element scheme. [PDF]
Guan Q, Queisser G.
europepmc +1 more source
Subgradient ellipsoid method for nonsmooth convex problems. [PDF]
Rodomanov A, Nesterov Y.
europepmc +1 more source

