Search results for "$k$-Cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Xiaowen Lou, Daming Zhu	A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations.	COCOON	2008	DBLP DOI BibTeX RDF
24	Lap Chi Lau	An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40
24	Mikkel Thorup	Fully-Dynamic Min-Cut.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
24	Hang Chang, Qing Yang 0002, Manfred Auer, Bahram Parvin	Modeling of Front Evolution with Graph Cut Optimization.	ICIP (1)	2007	DBLP DOI BibTeX RDF
24	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh	Compacting cuts: a new linear formulation for minimum cut.	SODA	2007	DBLP BibTeX RDF
24	Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown	BddCut: Towards Scalable Symbolic Cut Enumeration.	ASP-DAC	2007	DBLP DOI BibTeX RDF
24	Dong Liu 0022, Chunyuan Zhang, Weiyan Xing, Rui Li 0051, Haiyan Li	Quantification of Cut Sequence Set for Fault Tree Analysis.	HPCC	2007	DBLP DOI BibTeX RDF
24	W. A. Barrett	Biometrics of Cut Tree Faces.	SCSS (1)	2007	DBLP DOI BibTeX RDF
24	Linda Buisman, Rajeev Goré	A Cut-Free Sequent Calculus for Bi-intuitionistic Logic.	TABLEAUX	2007	DBLP DOI BibTeX RDF
24	Jian Sun 0009, Jian Sun 0001, Sing Bing Kang, Zongben Xu, Xiaoou Tang, Heung-Yeung Shum	Flash Cut: Foreground Extraction with Flash and No-flash Image Pairs.	CVPR	2007	DBLP DOI BibTeX RDF
24	Sagi Snir, Satish Rao	Using Max Cut to Enhance Rooted Trees Consistency.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
24	Jarrod A. Roy, Saurabh N. Adya, David A. Papa, Igor L. Markov	Min-cut floorplacement.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
24	Tiago Soares, Ricardo Rocha 0001, Michel Ferreira	Generic Cut Actions for External Prolog Predicates.	PADL	2006	DBLP DOI BibTeX RDF	Prolog Systems Implementation, External Modules, Pruning
24	Fernando Boto Sánchez, Andoni Cortés Vidal, Clemente Rodríguez Lafuente	Cut Digits Classification with k-NN Multi-specialist.	Document Analysis Systems	2006	DBLP DOI BibTeX RDF
24	Kentaro Kikuchi	On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus.	LPAR	2006	DBLP DOI BibTeX RDF
24	Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos	Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold.	ESA	2006	DBLP DOI BibTeX RDF
24	Chung-Chi Lin, Ming-Hwa Sheu, Huann-Keng Chiang, Chishyan Liaw, Ming-Che Chen	Film-to-Video Conversion with Scene Cut Detection.	ICICIC (1)	2006	DBLP DOI BibTeX RDF
24	Richard Bonichon, Olivier Hermant	On Constructive Cut Admissibility in Deduction Modulo.	TYPES	2006	DBLP DOI BibTeX RDF
24	Roy Dyckhoff, Delia Kesner, Stéphane Lengrand	Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.	IJCAR	2006	DBLP DOI BibTeX RDF
24	Christoph Benzmüller, Chad E. Brown, Michael Kohlhase	Cut-Simulation in Impredicative Logics.	IJCAR	2006	DBLP DOI BibTeX RDF
24	Xiaomei Liu, Li Xiao 0001, Andrew Kreling, Yunhao Liu 0001	Optimizing overlay topology by reducing cut vertices.	NOSSDAV	2006	DBLP DOI BibTeX RDF
24	Daniel Golovin, Vineet Goyal, R. Ravi 0001	Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.	STACS	2006	DBLP DOI BibTeX RDF
24	Mario Sormann, Christopher Zach, Konrad F. Karner	Graph Cut Based Multiple View Segmentation for 3D Reconstruction.	3DPVT	2006	DBLP DOI BibTeX RDF
24	Adi Avidor, Uri Zwick	Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
24	Chiyan Chen, Dengping Zhu, Hongwei Xi	Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell.	PADL	2004	DBLP DOI BibTeX RDF
24	Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr	Cut-Elimination: Experiments with CERES.	LPAR	2004	DBLP DOI BibTeX RDF
24	Lap Chi Lau	An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem.	FOCS	2004	DBLP DOI BibTeX RDF
24	Ralph Ewerth, Bernd Freisleben	Improving Cut Detection in MPEG Videos by GOP-Oriented Frame Difference Normalization.	ICPR (2)	2004	DBLP DOI BibTeX RDF
24	Guangpu Xia, Zheng Tang, Jiahai Wang, Rong Long Wang, Yong Li 0003, Guangan Xia	A New Parallel Improvement Algorithm for Maximum Cut Problem.	ISNN (1)	2004	DBLP DOI BibTeX RDF
24	Zoya Svitkina, Éva Tardos	Min-Max Multiway Cut.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
24	Charles J. Alpert, Gi-Joon Nam, Paul G. Villarrubia	Effective free space management for cut-based placement via analytical constraint generation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
24	Sven-Arne Reinemo, Frank Olaf Sem-Jacobsen, Tor Skeie, Olav Lysne	Admission Control for DiffServ Based Quality of Service in Cut-Through Networks.	HiPC	2003	DBLP DOI BibTeX RDF
24	Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani	MAX k-CUT and Approximating the Chromatic Number of Random Graphs.	ICALP	2003	DBLP DOI BibTeX RDF
24	David E. Cardoze	An optimal algorithm for the minimum edge cardinality cut surface problem.	SCG	2003	DBLP DOI BibTeX RDF	manifold conversion, computer graphics, scientific visualization, computational topology
24	Henning Biermann, Ioana M. Martin, Fausto Bernardini, Denis Zorin	Cut-and-paste editing of multiresolution surfaces.	ACM Trans. Graph.	2002	DBLP DOI BibTeX RDF
24	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	IPCO	2002	DBLP DOI BibTeX RDF
24	Gareth Brisbane, Reihaneh Safavi-Naini, Philip Ogunbona	An Algorithm for Data Hiding Using Median Cut Segmentation.	IEEE Pacific Rim Conference on Multimedia	2002	DBLP DOI BibTeX RDF
24	James Laird	A Deconstruction of Non-deterministic Classical Cut Elimination.	TLCA	2001	DBLP DOI BibTeX RDF
24	Maurizio Patrignani, Maurizio Pizzonia	The Complexity of the Matching-Cut Problem.	WG	2001	DBLP DOI BibTeX RDF
24	Athanasios Papadopoulos, Theodore Antonakopoulos 0001, Vassilios Makios	A New Cut-Through Forwarding Mechanism for ATM Multipoint-to-Point Connections.	ICN (2)	2001	DBLP DOI BibTeX RDF
24	Adam N. Letchford, Andrea Lodi 0001	An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
24	Matteo Fischetti, Andrea Lodi 0001, Paolo Toth	Solving Real-World ATSP Instances by Branch-and-Cut.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
24	Yuri Boykov, Vladimir Kolmogorov	An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision.	EMMCVPR	2001	DBLP DOI BibTeX RDF
24	Alexander A. Ageev, Maxim Sviridenko	An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts.	ESA	2000	DBLP DOI BibTeX RDF
24	Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki	Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.	ISAAC	1999	DBLP DOI BibTeX RDF
24	D. Stroobannt	PIN count prediction in ratio cut partitioning for VLSI and ULSI.	ISCAS (6)	1999	DBLP DOI BibTeX RDF
24	Agata Ciabattoni, Dov M. Gabbay, Nicola Olivetti	Cut-free proof systems for logics of weak excluded middle.	Soft Comput.	1998	DBLP DOI BibTeX RDF
24	Yngvi Björnsson, T. Anthony Marsland	Multi-cut Pruning in Alpha-Beta Search.	Computers and Games	1998	DBLP DOI BibTeX RDF
24	Ichiro Ogata	Cut Elimination for Classical Proofs as Continuation Passing Style Computation.	ASIAN	1998	DBLP DOI BibTeX RDF
24	Karl Stroetmann 0001, Thomas Glaß	A Declarative Semantics for the Prolog Cut Operator.	ELP	1996	DBLP DOI BibTeX RDF
24	D. R. Brown, Mark R. Cutkosky, Jay M. Tenenbaum	Next-Cut: A Second Generation Framework for Concurrent Engineering.	MIT-JSME Workshop	1989	DBLP DOI BibTeX RDF
23	Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin	Maximum Flow Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem
23	Liang-Liang Xie, Panganamala R. Kumar	On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory
23	A. Karygiannis, E. Antonakakis, A. Apostolopoulos	Detecting Critical Nodes for MANET Intrusion Detection Systems.	SecPerU	2006	DBLP DOI BibTeX RDF	edge-cut, vertex-cut, security, mobile ad hoc network, MANET, intrusion detection, IDS
23	Yuri Boykov, Olga Veksler, Ramin Zabih	Fast Approximate Energy Minimization via Graph Cuts.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF	multiway cut, Markov Random Fields, graph algorithms, image restoration, motion, stereo, Energy minimization, maximum flow, minimum cut, early vision, Potts model
23	Alan M. Frieze, Ravi Kannan	The Regularity Lemma and Approximation Schemes for Dense Problems.	FOCS	1996	DBLP DOI BibTeX RDF	dense problems, polynomial time approximation, dense graphs, Graph Bisection problem, Min l-way cut problem, Graph Separator problem, Max-SNP hard problems, graph theory, approximation schemes, Quadratic Assignment Problem, regularity lemma, Max Cut problem
23	Anne Bottreau, Yves Métivier	The Kronecker Product and Local Computations in Graphs.	CAAP	1996	DBLP DOI BibTeX RDF	Cut-edge, Cut-vertex, k-covering, Local computations on graphs, The Kronecker product, Planar, Subgraph, Minor
23	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
21	Volker Roth 0002, Thea Turner	Bezel swipe: conflict-free scrolling and multiple selection on mobile touch screen devices.	CHI	2009	DBLP DOI BibTeX RDF	cut paste, mode change, multiple selection, swipe, zoomable, mobile device, gesture, handheld, zooming, iphone, small display, study, touch interaction, crossing
21	Jialu Zhang 0001, Guojun Wang, Mingdi Hu	Topology on the set of R 0 semantics for R 0 algebras.	Soft Comput.	2008	DBLP DOI BibTeX RDF	R 0 algebra, R 0 fuzzy topological space, Cut topology, R 0 logic, Compactness property, category, category
21	Bruce L. Golden, S. Raghavan 0001, Daliborka Stanojevic	The prize-collecting generalized minimum spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Genetic algorithms, Networks, Heuristics, Local search, Branch-and-cut
21	Federico Della Croce, Vangelis Th. Paschos	Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.	Oper. Res.	2008	DBLP DOI BibTeX RDF	Dominance conditions, Set covering, Max cut, Worst-case complexity
21	Sylvia C. Boyd, Sally Cockburn, Danielle Vella	On the domino-parity inequalities for the STSP.	Math. Program.	2007	DBLP DOI BibTeX RDF	Branch and cut method, Travelling salesman problem, Cutting planes, Valid inequalities
21	David Kempe 0001, Adam Meyerson, Nainesh Solanki, Ramnath K. Chellappa	Pricing of partially compatible products.	EC	2007	DBLP DOI BibTeX RDF	duopoly, graph, pricing, compatibility, cut
21	Zongwei Zhou, Yibo Xue, Junda Liu, Wei Zhang, Jun Li 0003	MDH: A High Speed Multi-phase Dynamic Hash String Matching Algorithm for Large-Scale Pattern Set.	ICICS	2007	DBLP DOI BibTeX RDF	String Matching Algorithm, Multi-Phases Hash, Dynamic-Cut Heuristics, Network Security
21	Prabha Sharma	Algorithms for the optimum communication spanning tree problem.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution
21	Carsten Rother, Lucas Bordeaux, Youssef Hamadi, Andrew Blake 0001	AutoCollage.	ACM Trans. Graph.	2006	DBLP DOI BibTeX RDF	photomontage, poisson blending, constraint satisfaction, energy minimization, graph cut, image editing
21	Alan Mishchenko, Satrajit Chatterjee, Robert K. Brayton	Improvements to technology mapping for LUT-based FPGAs.	FPGA	2006	DBLP DOI BibTeX RDF	area recovery, cut enumeration, lossless synthesis, FPGA, technology mapping
21	Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, Bernd Hamann	Segmenting Point Sets.	SMI	2006	DBLP DOI BibTeX RDF	sampling, features, spectral analysis, geodesic distance, point sets, normalized cut, hierarchical segmentation
21	P. Nagabhushan, Shanmukhappa A. Angadi, Basavaraj S. Anami	A Fuzzy Symbolic Inference System for Postal Address Component Extraction and Labelling.	FSKD	2006	DBLP DOI BibTeX RDF	Postal address component labelling, Fuzzy methodology, Symbolic similarity measure, alpha cut based de-fuzzification, Inference System
21	Dong-Ming Yan 0001, Yang Liu 0014, Wenping Wang	Quadric Surface Extraction by Variational Shape Approximation.	GMP	2006	DBLP DOI BibTeX RDF	variational surface approximation, quadric surface fitting, segmentation, graph cut
21	Gang Zeng, Sylvain Paris, Long Quan, François X. Sillion	Progressive Surface Reconstruction from Images Using a Local Prior.	ICCV	2005	DBLP DOI BibTeX RDF	Local Prior, Voxel Carving, Complete/Partial Reconstruction, Surface Reconstruction, Graph Cut
21	Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi	On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price.	CPAIOR	2005	DBLP DOI BibTeX RDF	preflow-push algorithms, networks, Steiner trees, branch-and-cut
21	Hitomi Tamura, Shogo Nakazawa, Kenji Kawahara, Yuji Oie	Performance Analysis for QoS Provisioning in MPLS Networks.	Telecommun. Syst.	2004	DBLP DOI BibTeX RDF	cut-through, QoS, performance analysis, MPLS, LSR
21	Andrew B. Kahng, Igor L. Markov, Sherief Reda	On legalization of row-based placements.	ACM Great Lakes Symposium on VLSI	2004	DBLP DOI BibTeX RDF	min-cut placement, legalization, detailed placement
21	Jeff Erickson 0001, Sariel Har-Peled	Optimally cutting a surface into a disk.	SCG	2002	DBLP DOI BibTeX RDF	cut graph, polygonal schema, polyhedral 2-manifold, approximation, NP-hardness, computational topology
21	Jeffrey Ng, Shaogang Gong	Learning Intrinsic Video Content Using Levenshtein Distance in Graph Partitioning.	ECCV (4)	2002	DBLP DOI BibTeX RDF	Automatic Model Order Selection, Modelling Video Content, Normalised Cut, Trajectory Modelling, Graph-Partitioning, Dynamic Time Warping, Unsupervised Clustering, Levenshtein Distance
21	Clement Forest, Hervé Delingette, Nicholas Ayache	Removing Tetrahedra from a Manifold Mesh.	CA	2002	DBLP DOI BibTeX RDF	Interactive Cut, Topological Singularities, Manifoldness, Tetrahedral Meshes, Surgery Simulation
21	David R. Karger	Minimum cuts in near-linear time.	J. ACM	2000	DBLP DOI BibTeX RDF	tree packing, optimization, connectivity, min-cut, Monte Carlo algorithm
21	Ralf Hinze	Deriving backtracking monad transformers.	ICFP	2000	DBLP DOI BibTeX RDF	Prolog, Prolog, Haskell, Haskell, continuations, monads, backtracking, cut, program derivation, PEARL, monad transformers
21	Jens Gramm, Rolf Niedermeier	Faster Exact Solutions for MAX2SAT.	CIAC	2000	DBLP DOI BibTeX RDF	MAX2SAT, Maximum Cut, NP-complete problems, exact algorithms, parameterized complexity
21	Marcus Oswald, Gerhard Reinelt	Polyhedral Aspects of the Consecutive Ones Problem.	COCOON	2000	DBLP DOI BibTeX RDF	consecutive ones, polytope, branch-and-cut
21	Piotr Berman, Marek Karpinski	On Some Tighter Inapproximability Results (Extended Abstract).	ICALP	1999	DBLP DOI BibTeX RDF	Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
21	Jaime Cohen, Claudio L. Lucchesi	Minimax relations for T-join packing problems.	ISTCS	1997	DBLP DOI BibTeX RDF	minimax relations, T-join packing problems, algorithmic results, structural results, minimum T-cut, maximization problem, theorem proving, polynomial time algorithm, perfect matchings, minimax techniques
21	Grace SauLan Loo, Tharam S. Dillon, John Zeleznikow, Kok-Huat Lee	Enhancing Query Processing of Information Systems.	ISMIS	1996	DBLP DOI BibTeX RDF	alpha-cut, inadequate queries, query weakening, metric, relational database, Approximate, fuzzy sets, intelligent, linguistic
21	Hyunmin Park, Dharma P. Agrawal	Generic Methodologies for Deadlock-Free Routing.	IPPS	1996	DBLP DOI BibTeX RDF	Subdigraph, Hypercube, Mesh, Adaptive Routing, Virtual Channel, Torus, Channels, Wormhole, Virtual Cut-through, Store-and-Forward, Deadlock-free Routing Algorithm
21	Sunggu Lee, Kang G. Shin	Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	all-to-allreliable broadcast, point-to-point interconnection networks, reliablebroadcasts, IHC Algorithm, regular meshes, fault-tolerance, interconnection networks, broadcast, hypercubes, multiprocessor interconnection networks, meshes, wormhole routing, telecommunication network routing, virtual cut-through
21	Javier Campos, José Manuel Colom, Hauke Jungnitz, Manuel Silva Suárez	Approximate Throughput Computation of Stochastic Marked Graphs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	approximate throughput computation, stochastic marked graphs, stochastic strongly connected marked graphs, net decomposition, single input-single output cut, qualitative behavior, general decomposition technique, iterative response time approximation method, intractable systems, stochastic Petri net models, performance evaluation, Petri nets, error, stochastic processes, state space, iterative technique
21	Anil Raj, Chris H. Wiggins 0001	An Information-Theoretic Derivation of Min-Cut-Based Clustering.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	graph diffusion, clustering, Graphs, information theory, min-cut, Information Bottleneck
21	Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano	A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching.	NAS	2010	DBLP DOI BibTeX RDF	non-minimal fully adaptive routing, NoC, deadlock-free routing, SAN, turn-model, virtual cut-through
21	Antti Siirtola	Cut-Offs with Network Invariants.	ACSD	2010	DBLP DOI BibTeX RDF	parameterised verification, cut-off, formal verification, refinement, process algebra, induction, network invariant
21	Shuguang Xiong, Jianzhong Li	An Efficient Algorithm for Cut Vertex Detection in Wireless Sensor Networks.	ICDCS	2010	DBLP DOI BibTeX RDF	cut vertex detection, wireless sensor networks, energy efficiency, topology discovery
21	Steffen Rebennack	Stable Set Problem: Branch & Cut Algorithms.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Stable set, Vertex packing, Branch & Cut, Separation, Independent set, Maximum clique, Exact method
21	Jeff Cheeger, Bruce Kleiner, Assaf Naor	A (log n)Omega(1) Integrality Gap for the Sparsest Cut SDP.	FOCS	2009	DBLP DOI BibTeX RDF	Sparsest Cut problem, Heisenberg group, semidefinite programming, metric embeddings, integrality gap
21	Jonathan Eckstein, Mikhail Nediak	Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming.	J. Heuristics	2007	DBLP DOI BibTeX RDF	Simplex pivot, Convexity cut, Integer programming
21	Egon Balas, Pierre Bonami	New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing.	IPCO	2007	DBLP DOI BibTeX RDF	branch and cut algorithms, integer programming
21	Frank Thomson Leighton, Satish Rao	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.	J. ACM	1999	DBLP DOI BibTeX RDF	muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection
21	Thomas Christof, John D. Kececioglu	Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut.	RECOMB	1999	DBLP DOI BibTeX RDF	physical mapping of chromosomes, computational biology, branch-and-cut, consecutive ones property
21	Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt	A branch-and-cut approach to physical mapping with end-probes.	RECOMB	1997	DBLP DOI BibTeX RDF	betweeness problem, physcial mapping of chromosomes, computational biology, branch-and-cut, linear ordering problem
21	Raymond Lo, Sun Chan, James C. Dehnert, Ross A. Towle	Aggregate Operation Movement: A Min-Cut Approach to Global Code Motion.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF	global code motion, software pipelining, network flow, superscalar, minimum cut, global scheduling