BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
algorithm (5)
constraint (3)
maxim (3)
problem (3)
intersect (3)

Stem matroid$ (all stems)

27 papers:

ICALPICALP-v1-2015-LokshtanovMPS #linear
Deterministic Truncation of Linear Matroids (DL, PM, FP, SS), pp. 922–934.
ICALPICALP-v1-2014-GuptaTW #multi #optimisation
Changing Bases: Multistage Optimization for Matroids and Matchings (AG, KT, UW), pp. 563–575.
KDDKDD-2013-AbbassiMT #constraints
Diversity maximization under matroid constraints (ZA, VSM, MT), pp. 32–40.
Matroids and integrality gaps for hypergraphic steiner tree relaxations (MXG, NO, TR, RZ), pp. 1161–1176.
Matroid prophet inequalities (RK, SMW), pp. 123–136.
ICALPICALP-v1-2012-BuchbinderNRS #algorithm #approximate #constraints #online #rank
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.
ICALPICALP-v1-2012-ItoTY #algorithm
Constant-Time Algorithms for Sparsity Matroids (HI, SiT, YY), pp. 498–509.
ICALPICALP-v2-2012-GavenciakKO #first-order
Deciding First Order Properties of Matroids (TG, DK, SiO), pp. 239–250.
CASECASE-2011-TalpasanuK #analysis #approach
Exoskeleton systems kinematics analysis with graph-matroid approach (IT, SK), pp. 822–827.
ICALPICALP-v1-2011-GoldbergJ #algorithm #polynomial
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (LAG, MJ), pp. 521–532.
ICALPICALP-v1-2011-Varadaraja #approximate #problem
Buyback Problem — Approximate Matroid Intersection with Cancellation Costs (ABV), pp. 379–390.
STOCSTOC-2010-LeeSV #power of
Matroid matching: the power of local search (JL, MS, JV), pp. 369–378.
ICALPICALP-v1-2010-Kral #composition
Decomposition Width of Matroids (DK), pp. 55–66.
STOCSTOC-2009-LeeMNS #constraints
Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.
Competitive Weighted Matching in Transversal Matroids (NBD, CGP), pp. 397–408.
ICALPICALP-v1-2006-Marx #optimisation #problem
A Parameterized View on Matroid Optimization Problems (DM), pp. 655–666.
ICPRICPR-v2-2004-SerratosaGS #2d #distance
Distance between 2D-Scenes based on Oriented Matroid Theory (FS, AG, AS), pp. 196–199.
STOCSTOC-2001-MontenegroS #agile #geometry #markov
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains (RM, JBS), pp. 704–711.
ICALPICALP-1998-Peleg #distributed
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.
ICALPICALP-1997-Fujito #approach #approximate #problem
A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.
STOCSTOC-1995-Eppstein #bound #geometry #optimisation #parametricity
Geometric lower bounds for parametric matroid optimization (DE), pp. 662–671.
Balanced Matroids (TF, MM), pp. 26–38.
STOCSTOC-1991-Gabow #approach
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences (HNG), pp. 112–122.
STOCSTOC-1988-GabowW #algorithm #game studies
Forests, Frames and Games: Algorithms for Matroid Sums and Applications (HNG, HHW), pp. 407–421.
ICALPICALP-1985-GabowS #algorithm #performance
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) (HNG, MFMS), pp. 210–220.
STOCSTOC-1984-FredericksonS #data type #online
Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version) (GNF, MAS), pp. 383–390.
STOCSTOC-1980-ReifS #random
Random Matroids (JHR, PGS), pp. 385–397.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.