yusuke1997/dblp-id-title huggingface dataset:
Fast separable solver for mixed finite element methods and applications
Error control in h - and hp -adaptive FEM for Signorini's problem
Multigrid analysis for higher order finite difference scheme
Estimates of the modeling error generated by homogenization of an elliptic boundary value problem
Two mixed finite element formulations for the weak imposition of the Neumann boundary conditions for the Darcy flow
A C0-conforming DG finite element method for biharmonic equations on triangle/tetrahedron
Exploring numerical blow-up phenomena for the Keller-Segel-Navier-Stokes equations
A posteriori control of modelling and discretization errors for quasi periodic solutions
Improvements of algebraic flux-correction schemes based on Bernstein finite elements
Preconditioning methods for eddy-current optimally controlled time-harmonic electromagnetic problems
A decoupled finite element method with diferent time steps for the nonstationary Darcy-Brinkman problem
On the stability of the space-time discontinuous Galerkin method for the numerical solution of nonstationary nonlinear convection-diffusion problems
Analysis of the streamline-diffusion finite element method on a piecewise uniform mesh for a convection-diffusion problem with exponential layers
A scenario for symmetry breaking in Caffarelli-Kohn-Nirenberg inequalities
Diffusion of tangential tensor fields: numerical issues and influence of geometric properties
Estimating the control error in discretized PDE-constrained optimization
Error analysis of higher order Trace Finite Element Methods for the surface Stokes equation
Stability and convergence of mixed discontinuous finite element methods for second-order differential problems
A well-balanced solver for the Saint Venant equations with variable cross-section
Residual-based a posteriori error estimation for hp-adaptive finite element methods for the Stokes equations
A note on the efficient evaluation of a modified Hilbert transformation
Higher order Galerkin time discretizations and fast multigrid solvers for the heat equation
A non-standard FETI-DP mortar method for Stokes problem
Analysis of the Chang-Cooper discretization scheme for a class of Fokker-Planck equations
Stabilized weighted reduced order methods for parametrized advection-dominated optimal control problems governed by partial differential equations with random inputs
Convergence rate analysis of domain decomposition methods for obstacle problems
The all-floating boundary element tearing and interconnecting method
A priori error analysis for optimal distributed control problem governed by the first order linear hyperbolic equation: hp-streamline diffusion discontinuous galerkin method
A monotone Schwarz algorithm for a semilinear convection-diffusion problem
A proof of the well posedness of discretized wave equation with an absorbing boundary condition
Corrigendum to: Numerical analysis for a Cahn-Hilliard system modelling tumour growth with chemotaxis and active transport
Solving 0 = F(t, y(t), y′(t)) in Matlab
Goal-oriented error control of the iterative solution of finite element equations
A new approach to constructing vector splitting schemes in mixed finite element method for parabolic problems
On the piecewise-spectral homotopy analysis method and its convergence: solution of hyperchaotic Lü system
Higher-order relaxation schemes for hyperbolic systems of conservation laws
Convergence of explicitly coupled simulation tools (co-simulations)
Numerical approximations for singularly perturbed differential-difference BVPs with layer and oscillatory behavior
Relative error analysis of matrix exponential approximations for numerical integration
Low Machnumber aeroacoustics - A direct one-grid approach
Fully implicit nonstationary flow simulations with a monolithic off-lattice Boltzmann approach
Robust residual a posteriori error estimators for the Reissner-Mindlin eigenvalues system
Convergence analysis of an adaptive interior penalty discontinuous Galerkin method for the biharmonic problem
A second-order scheme for singularly perturbed differential equations with discontinuous source term
Solution of 2D Boussinesq systems with freefem++: the flat bottom case
The deal.II library, version 8.5
On three steps two-grid finite element methods for the 2D-transient Navier-Stokes equations
Error estimates for Neumann boundary control problems with energy regularization
A contraction property of an adaptive divergence-conforming discontinuous Galerkin method for the Stokes problem
Numerical analysis for a Cahn-Hilliard system modelling tumour growth with chemotaxis and active transport
Some transpose-free CG-like solvers for nonsymmetric ill-posed problems
Regularity estimates for elliptic boundary value problems with smooth data on polygonal domains
Analysis of the Scott-Zhang interpolation in the fractional order Sobolev spaces
Convergence and superconvergence of a nonconforming finite element method for the Stokes problem
A combined spectral element/finite element approach to the numerical solution of a nonlinear evolution equation describing amorphous surface growth of thin films
A finite element method for degenerate two-phase flow in porous media. Part I: Well-posedness
Cascadic multigrid method for P 1 -nonconforming quadrilateral element
A new sequence of hierarchic prismatic elements satisfying De Rham diagram on hybrid meshes
Families of interior penalty hybridizable discontinuous Galerkin methods for second order elliptic problems
An augmented Lagrangian approach to the numerical solution of a non-smooth eigenvalue problem
Reuse of standard preconditioners for higher-order time discretizations of parabolic PDEs
A multipoint Birkhoff type boundary value problem
Convergence analysis of finite element methods for H (div;Ω)-elliptic interface problems
Doubly-adaptive artificial compression methods for incompressible flow
Asynchronous Multi-Agent Bandits: Fully Distributed vs . Leader-Coordinated Algorithms
Shedding Light on Shadows: Automatically Tracing Illicit Money Flows on EVM-Compatible Blockchains
ScaleQsim: Highly Scalable Quantum Circuit Simulation Framework for Exascale HPC Systems
POMACS V6, N2, June 2022 Editorial
Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment
Optimizing Storage Overhead of User Behavior Log for ML-embedded Mobile Apps
DiskAdapt: Hard Disk Failure Prediction Based on Pre-Training and Fine-Tuning
Exploring the 5G Digital Divide in the Non-Contiguous US: LEO Satellites to the Rescue?
Three Birds with One Stone: Improving Performance, Convergence, and System Throughput with NEST
POMACS V7, N3, December 2023 Editorial
POMACS V8, N2, June 2024 Editorial
Network Fairness Ambivalence: When does social network capital mitigate or amplify unfairness?
Everything You Should Know About Intel SGX Performance on Virtualized Systems
Anchor: Reducing Temporal and Spatial Output Performance Variability on Quantum Computers
Poison comes in small packages: Application-driven Reexamination of Datacenter Microbursts
Better than Optimal: Improving Adaptive Stochastic Quantization Using Shared Randomness
POMACS V5, N3, December 2021 Editorial
MeshAgent: Enabling Reliable Network Management with Large Language Models
A Tale of Two Traffics: Optimizing Tail Latency in the Light-Tailed M/G/k
Expected Values Estimated via Mean-Field Approximation are 1/N-Accurate
Stein's Method for Mean Field Approximations in Light and Heavy Traffic Regimes
Towards Optimality in Parallel Scheduling
DaeMon: Architectural Support for Efficient Data Movement in Fully Disaggregated Systems
SAGESERVE: Optimizing LLM Serving on Cloud Data Centers with Forecast Aware Auto-Scaling
POMACS V8, N1, March 2024 Editorial
SparseP: Towards Efficient Sparse Matrix Vector Multiplication on Real Processing-In-Memory Architectures
POMACS V9, N1, March 2025 Editorial
POMACS V6, N1, March 2022 Editorial
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs
Optimal Scheduling Algorithms for LLM Inference: Theory and Practice
PyGim : An Efficient Graph Neural Network Library for Real Processing-In-Memory Architectures
Multiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
ObliQ: Solving Quadratic Unconstrained Binary Optimization Problems on Real Photonic Quantum Machines
FastFlow: Early Yet Robust Network Flow Classification using the Minimal Number of Time-Series Packets
Delay-optimal Policies in Partial Fork-Join Systems with Redundancy and Random Slowdowns
Quantum Computing in the RAN with Qu4Fec: Closing Gaps Towards Quantum-based FEC processors
Bregman-style Online Convex Optimization with EnergyHarvesting Constraints
FuncPipe: A Pipelined Serverless Framework for Fast and Cost-Efficient Training of Deep Learning Models
The Impact of IP Version on Household Internet Speed: A Comparative Study
Benchmarking and Characterization of Large Language Model Inference on Apple Silicon
µ-VF: Enabling Virtualization of Embedded FPGAs
Cross-Chain Arbitrage: The Next Frontier of MEV in Decentralized Finance
POMACS V9, N3, December 2025 Editorial
POMACS V6, N3 December 2022 Editorial
POMACS V7, N2, June 2023 Editorial
Safe Randomized Load-Balanced Switching By Diffusing Extra Loads
POMACS V7, N1, March 2023 Editorial
PEACH: Proactive and Environment-Aware Channel State Information Prediction with Depth Images
The Tale of Errors in Microservices
Beyond Single-Tokenomics: How Farcaster's Pluralistic Incentives Reshape Social Networking
Lancet: Better Network Resilience by Designing for Pruned Failure Sets
Heterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models
Learning with Episodic Hypothesis Testing in General Games: A Framework for Equilibrium Selection
POMACS V9, N2, June 2025 Editorial
H3DM: A High-bandwidth High-capacity Hybrid 3D Memory Design for GPUs
From Measurement to Emissions: Assessing the Carbon Footprint of Traffic Flows
mRSC: Multi-dimensional Robust Synthetic Control
POMACS V8, N3, December 2024 Editorial
Hard to solve instances of the Euclidean Traveling Salesman Problem
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization
A triangulation and fill-reducing initialization procedure for the simplex algorithm
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
Parallel and distributed asynchronous adaptive stochastic gradient methods
The MIP Workshop 2023 Computational Competition on reoptimization
An inexact interior point method for L 1 -regularized sparse covariance selection
Maximum-weight stable sets and safe lower bounds for graph coloring
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
PySP: modeling and solving stochastic programs in Python
A nonmonotone GRASP
Thinning out Steiner trees: a node-based model for uniform edge costs
Large-scale optimization with the primal-dual column generation method
Faster min-max resource sharing in theory and practice
Computing feasible points for binary MINLPs with MPECs
General k -opt submoves for the Lin-Kernighan TSP heuristic
Solving network design problems via iterative aggregation
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
Cubic regularization in symmetric rank-1 quasi-Newton methods
Nonlinear conjugate gradient for smooth convex functions
A derivative-free Gauss-Newton method
Computing minimum-volume enclosing ellipsoids
A general cut-generating strategy for the caterpillar-packing polytope
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
On integer and bilevel formulations for the k -vertex cut problem
On optimizing over lift-and-project closures
A factorization with update procedures for a KKT matrix arising in direct optimal control
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem
mplrs: A scalable parallel vertex/facet enumeration code
Optimal linear arrangements using betweenness variables
Generalized alternating direction method of multipliers: new theoretical insights and applications
Solving equilibrium problems using extended mathematical programming
A dynamic programming approach for generalized nearly isotonic optimization
QPLIB: a library of quadratic programming instances
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs
Instance-specific linear relaxations of semidefinite optimization problems
A hybrid LP/NLP paradigm for global optimization relaxations
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem
SDPNAL \(+\) : a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
On efficiently combining limited-memory and trust-region techniques
Extended formulations in mixed integer conic quadratic programming
An active set algorithm for robust combinatorial optimization based on separation oracles
On fast trust region methods for quadratic models with linear constraints
A computational study of perspective cuts
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form
Deterministic global optimization with Gaussian processes embedded
A hierarchy of spectral relaxations for polynomial optimization
Mixed-integer programming techniques for the connected max-k-cut problem
Trajectory-following methods for large-scale degenerate convex quadratic programming
Support vector machine classification with indefinite kernels
Parsimonious formulations for low-diameter clusters
A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
K-shortest simple paths using biobjective path search
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
Swap-vertex based neighborhood for Steiner tree problems
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect
A branch and bound algorithm for robust binary optimization with budget uncertainty
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Pyomo: modeling and solving mathematical programs in Python
Communication protocols for options and results in a distributed optimization environment
A primal-dual regularized interior-point method for convex quadratic programs
MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Certifiably optimal sparse principal component analysis
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Solving linear programs with complementarity constraints using branch-and-cut
ADMM for the SDP relaxation of the QAP
On the safety of Gomory cut generators
Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation
Efficient MIP techniques for computing the relaxation complexity
Branch-and-cut for complementarity-constrained optimization
A new computational framework for log-concave density estimation
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
Phase retrieval for imaging problems
Implementation of a unimodularity test
An adaptive primal-dual framework for nonsmooth convex minimization
Scalable branching on dual decomposition of stochastic mixed-integer programming problems
Alternating direction augmented Lagrangian methods for semidefinite programming
A heuristic to generate rank-1 GMI cuts
Progressively strengthening and tuning MIP solvers for reoptimization
Partial hyperplane activation for generalized intersection cuts
A numerical study of transformed mixed-integer optimal control problems
Split cuts from sparse disjunctions
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Efficient block-coordinate descent algorithms for the Group Lasso
A trust-region framework for derivative-free mixed-integer optimization
A library of local search heuristics for the vehicle routing problem
Alternating proximal gradient method for sparse nonnegative Tucker decomposition
Templates for convex cone problems with applications to sparse signal recovery
OAR Lib: an open source arc routing library
Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
A novel matching formulation for startup costs in unit commitment
Using symmetry to optimize over the Sherali-Adams relaxation
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
The (not so) trivial lifting in two dimensions
LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization
Effective matrix adaptation strategy for noisy derivative-free optimization
Feasibility Jump: an LP-free Lagrangian MIP heuristic
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
Feasibility pump 2.0
Methods for convex and general quadratic programming
Improved branch-cut-and-price for capacitated vehicle routing
New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
$\mathtt {Tenscalc}$: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
RBFOpt: an open-source library for black-box optimization with costly function evaluations
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
Optimal sensitivity based on IPOPT
Exploiting sparsity for the min k -partition problem
Computing convex hulls and counting integer points with polymake
Incorporating bounds from decision diagrams into integer programming
SCIP-Jack - a solver for STP and variants with parallelization extensions
A recipe for finding good solutions to MINLPs
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
CDOpt: a Python package for a class of Riemannian optimization
SCIP: solving constraint integer programs
Asynchronous Lagrangian scenario decomposition
Adaptive sieving: a dimension reduction technique for sparse optimization problems
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Optimal patchings for consecutive ones matrices
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
Computing compatible tours for the symmetric traveling salesman problem
Erratum to: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming
Approximate maximum likelihood estimators for linear regression with independent component-wise design matrix uncertainty
Customizing the solution process of COIN-OR's linear solvers with Python
Testing cut generators for mixed-integer linear programming
Multiparent path relinking. An application to the power dominating set problem
Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
Global optimization of nonconvex problems with multilinear intermediates
Implementation of an interior point method with basis preconditioning
Optimization of algorithms with OPAL
Block splitting for distributed optimization
GPU accelerated greedy algorithms for compressed sensing
Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
acados - a modular open-source framework for fast embedded optimal control
A branch-and-bound algorithm for instrumental variable quantile regression
Efficient unconstrained black box optimization
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
Adaptive large neighborhood search for mixed integer programming
Lifted collocation integrators for direct optimal control in ACADO toolkit
Performance enhancements for a generic conic interior point algorithm
qpOASES: a parametric active-set algorithm for quadratic programming
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
Structure-driven fix-and-propagate heuristics for mixed integer programming
Local elimination in the traveling salesman problem
Design and implementation of a modular interior-point solver for linear optimization
The strength of multi-row models
CP-Lib: Benchmark Instances of the Clique Partitioning Problem
Branch-and-cut for linear programs with overlapping SOS1 constraints
Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun Algorithm
A parallel quadratic programming method for dynamic optimization problems
Convex mixed-integer optimization with Frank-Wolfe methods
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
Allocation of fungible resources via a fast, scalable price discovery method
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
Parallelizing the dual revised simplex method
RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems
RENS
Progress in presolving for mixed integer programming
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
A penalized method of alternating projections for weighted low-rank hankel matrix optimization
Polynomial optimization relaxations for generalized semi-infinite programs
A data driven Dantzig-Wolfe decomposition framework
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem
MIPLIB 2010
The time dependent traveling salesman problem: polyhedra and algorithm
Information-based branching schemes for binary linear mixed integer problems
A Benders squared (B 2 ) framework for infinite-horizon stochastic linear programs
Detecting almost symmetries of graphs
Correction to: Asynchronous Lagrangian scenario decomposition
A practical volume algorithm
PEBBL: an object-oriented framework for scalable parallel branch and bound