The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase $k$-Cut (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1959-1973 (16) 1974-1977 (15) 1978-1980 (20) 1981-1983 (20) 1984-1985 (21) 1986 (15) 1987 (20) 1988 (27) 1989 (31) 1990 (49) 1991 (50) 1992 (47) 1993 (58) 1994 (76) 1995 (86) 1996 (89) 1997 (121) 1998 (125) 1999 (165) 2000 (157) 2001 (231) 2002 (220) 2003 (250) 2004 (356) 2005 (432) 2006 (499) 2007 (524) 2008 (537) 2009 (410) 2010 (267) 2011 (205) 2012 (207) 2013 (217) 2014 (232) 2015 (230) 2016 (268) 2017 (254) 2018 (302) 2019 (269) 2020 (331) 2021 (355) 2022 (319) 2023 (300) 2024 (76)
Publication types (Num. hits)
article(3875) book(3) data(1) incollection(65) inproceedings(4523) phdthesis(32)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3915 occurrences of 2226 keywords

Results
Found 8506 publication records. Showing 8499 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
106Julia Chuzhoy, Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
90Julia Chuzhoy, Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Directed multicut, hardness of approximation, sparsest cut
78WoongChul Choi, JinWoo Han, Byung Joon Park, Jiman Hong BCTMA(Bi-directional Cut-Through Medium Access) Protocol for 802.11-Based Multi-hop Wireless Networks. Search on Bibsonomy ISSADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Forward cut-through scheme, Backward cut-through scheme, BCTMA (Bi-directional Cut-Through Medium Access) protocol, DCF (Distributed Coordination Function), IEEE 802.11, Wireless multi-hop networks
75Chandra Chekuri, Sudipto Guha, Joseph Naor Approximating Steiner k-Cuts. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual
74Takehiro Ito, Marcin Kaminski 0001, Daniël Paulusma, Dimitrios M. Thilikos Parameterizing Cut Sets in a Graph by the Number of Their Components. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
72Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten Complexity of the Min-Max (Regret) Versions of Cut Problems. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF min-max regret, s–t min cut, complexity, min cut, min-max
70Hannah Honghua Yang, D. F. Wong 0001 New algorithms for min-cut replication in partitioned circuits. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout
68Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays. Search on Bibsonomy ICCAD The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
64Hannah Honghua Yang, Martin D. F. Wong Optimal min-area min-cut replication in partitioned circuits. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
62Olivier Hermant Semantic Cut Elimination in the Intuitionistic Sequent Calculus. Search on Bibsonomy TLCA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF intuitionistic sequent calculus, cut admissibility, cut elimination property, semantic, Kripke Structure, deduction modulo
62Kai Brünnler Atomic Cut Elimination for classical Logic. Search on Bibsonomy CSL The full citation details ... 2003 DBLP  DOI  BibTeX  RDF atomic cut, sequent calculus, cut elimination, natural deduction, classical logic
61Mingyu Xiao 0001 Algorithms for Multiterminal Cuts. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multiterminal Cut, Graph Algorithm, Fixed Parameter Tractability, Multicut
60Song Wang 0002, Jeffrey Mark Siskind Image Segmentation with Ratio Cut - Supplemental Material. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Graph partitioning algorithms, cut ratio, cycle ratio, image segmentation, edge detection, machine vision, perceptual organization, perfect matching
60Song Wang 0002, Jeffrey Mark Siskind Image Segmentation with Ratio Cut. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Graph partitioning algorithms, cut ratio, cycle ratio, image segmentation, edge detection, machine vision, perceptual organization, perfect matching
60Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
58Teofilo F. Gonzalez, Toshio Murayama Alhorithms for a Class of Min-Cut and Max-Cut Problem. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
57Manfred Wamsler On the selection of the mode cut-off number in component mode reduction. Search on Bibsonomy Eng. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Structural dynamics, Component mode reduction, Component mode synthesis, Mixed Guyan and modal reduction, Craig-Bampton method, Direct solution formulation, Modal solution formulation, Mode cut-off number, Cut-off frequency
55Ryan O'Donnell, Yi Wu 0002 An optimal sdp algorithm for max-cut, and equally optimal long code tests. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF semidefinite programming, hardness of approximation, max-cut
55Hanwen Guo, Minyong Shi, Zhiguo Hong, Rui Yang, Li Zhang Virtual Artistic Paper-Cut. Search on Bibsonomy Edutainment The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Subdivision Curve, Paper-Cut, NPR, SVG, Contour Extraction, Polygon Clipping
55Julia Chuzhoy, Sanjeev Khanna Hardness of cut problems in directed graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF directed multicut, hardness of approximation, sparsest cut
55Wai-Kei Mak, D. F. Wong 0001 Minimum replication min-cut partitioning. Search on Bibsonomy ICCAD The full citation details ... 1996 DBLP  DOI  BibTeX  RDF min-cut partitioning, circuit partitioning, logic replication
54Alexandre X. Falcão, Paulo A. V. Miranda, Anderson Rocha 0001 A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures. Search on Bibsonomy ACIVS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
54Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. Search on Bibsonomy Computational Combinatorial Optimization The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
51Hans L. Bodlaender, Babette van Antwerpen-de Fluiter Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
51Tamal K. Dey, Kuiyu Li Cut locus and topology from surface point data. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF cut locus, rips complex, surface point cloud, topology, differential geometry
51Yong He 0003, Sixin Xu, Kejun Zhu, Ting Liu, Yue Li A Genetic-Neural Method of Optimizing Cut-Off Grade and Grade of Crude Ore. Search on Bibsonomy ISNN (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Genetic-neural optimization, Cut-off grade, Grade of crude ore
51David R. Karger, Clifford Stein 0001 A New Approach to the Minimum Cut Problem. Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF parallel computing, randomized algorithm, graph algorithm, network reliability, minimum cut
50Monique Laurent Semidefinite Relaxations for Max-Cut. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
50Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq (1, 2)-Survivable Networks: Facets and Branch-and-Cut. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
49Padmanabhan Soundararajan, Sudeep Sarkar An In-Depth Study of Graph Partitioning Measures for Perceptual Organization. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF grouping, graph partitioning, empirical evaluation, Perceptual organization, stochastic orders
49Chandra Chekuri, Sanjeev Khanna Algorithms for 2-Route Cut Problems. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Alejandro Duran, Julita Corbalán, Eduard Ayguadé An adaptive cut-off for task parallelism. Search on Bibsonomy SC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Subhash Khot, Nisheeth K. Vishnoi The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
48Yu G. Chen, Maria C. Yuang An efficient terminal-pair reliability algorithm for network management. Search on Bibsonomy LCN The full citation details ... 1995 DBLP  DOI  BibTeX  RDF terminal-pair reliability, probabilistic reliability, path-based partition method, network reduction technique, cut-based partition algorithm, network reduction, performance evaluation, network management, computer network management, minimum cut, failure probabilities
47Jiabing Wang, Hong Peng, Jing-Song Hu, Chuangxin Yang A Graph Clustering Algorithm Based on Minimum and Normalized Cut. Search on Bibsonomy International Conference on Computational Science (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF image segmentation, graph clustering, minimum cut, normalized cut
46Hoang Tuy Cutting Plane Methods for Global Optimization. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Inner approximation, Polyhedral annexation, Concavity cut, Intersection cut, Convexity cut, Nonlinear cut, Polyblock approximation, Monotonic optimization, Outer approximation, Cutting plane method
46Qiusong Yang, Mingshu Li 0001 A cut-off approach for bounded verification of parameterized systems. Search on Bibsonomy ICSE (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF cut-off, bounded model checking, parameterized system
46Monia Giandomenico, Adam N. Letchford Exploring the Relationship Between Max-Cut and Stable Set Relaxations. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Stable set problem, Polyhedral combinatorics, Max-cut problem
46Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Convex integer programming, Total unimodularity, Network flow, Minimum cut, Nonlinear integer programming
46Reijer Grimbergen Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Plausible move generation, move merit analysis, cut-off thresholds, shogi
44Reda Alhajj, Ashraf Elnagar Multiagents to Separating Handwritten Connected Digits. Search on Bibsonomy IEEE Trans. Syst. Man Cybern. Part A The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
44Padmanabhan Soundararajan, Sudeep Sarkar Investigation of Measures for Grouping by Graph Partitioning. Search on Bibsonomy CVPR (1) The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
44Jin Zhang, Lei Xie 0001, Wei Feng 0005, Yanning Zhang A Subword Normalized Cut Approach to Automatic Story Segmentation of Chinese Broadcast News. Search on Bibsonomy AIRS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
44David Avis, Hiroshi Imai, Tsuyoshi Ito Generating facets for the cut polytope of a graph by triangular elimination. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 52B12, 90C57, 05C99
44Wai-Kei Mak, Martin D. F. Wong Minimum replication min-cut partitioning. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
44Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato Min-cut placement with global objective functions for large scale sea-of-gates arrays. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
43Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut
42Jianer Chen, Yang Liu 0002, Songjian Lu An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multiway cut problem, Network flow, Fixed-parameter tractability, Minimum cut, Parameterized algorithm
42Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino Generating Cut Conjunctions in Graphs and Related Problems. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cut conjunction, Cut generation, Graph, Matroid, Multicut
42Ching-Yung Yang, Ja-Chen Lin Color quantization by RWM-cut. Search on Bibsonomy ICDAR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF RWM-cut, radius weighted mean cut, hierarchically divisive method, two-class partition, MSE quantization error, LBG algorithm, initial palette, full-color image, color palette, color image, image colour analysis, centroid, color quantization
42Wei-Kuan Shih, Sun Wu, Yue-Sun Kuo Unifying Maximum Cut and Minimum Cut of a Planar Graph. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1990 DBLP  DOI  BibTeX  RDF maximum cut, nonnegative edge weights, computational complexity, graph theory, planar graph, minimum cut
41Young-Il Lee, Yong-Gi Kim Comparison of fuzzy implication operators by means of fuzzy relational products used for intelligent local path-planning of AUVs. Search on Bibsonomy Soft Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Autonomous underwater vehicles(AUVs), ?-Cut, Fuzzy relational products, Implication operator, Local path-planning
41Mingyu Xiao 0001 An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-Way Cut, Graph Algorithm, Divide-and-Conquer
41Anand Bhalgat, Tanmoy Chakraborty 0001, Sanjeev Khanna Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. Search on Bibsonomy EC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms
41Dong Liu 0022, Weiyan Xing, Chunyuan Zhang, Rui Li 0051, Haiyan Li Cut Sequence Set Generation for Fault Tree Analysis. Search on Bibsonomy ICESS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cut sequence set, sequential failure expression, fault tree analysis
41Xujia Qin, Xinhua Yang, Hongbo Zheng Implicit Surface Boolean Operations Based Cut-and-Paste Algorithm for Mesh Models. Search on Bibsonomy ICAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF mesh models, point models, implicit surface, Boolean operations, Cut-and-paste
41Francesco Belardinelli, Peter Jipsen, Hiroakira Ono Algebraic Aspects of Cut Elimination. Search on Bibsonomy Stud Logica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Algebraic Gentzen systems, finite model property, residuated lattices, cut elimination, substructural logics
41Dvir Steiner, Anath Fischer Finding and defining the generators of genus-n objects for constructing topological and cut graphs. Search on Bibsonomy Vis. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Cut graph, Longitude, Meridian, Topological graph, Shape classification
41Francisco Gutiérrez, Blas C. Ruiz Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF pure type systems, expansion postponement, Track: B, cut elimination, sequent calculi
41Christian Urban Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. Search on Bibsonomy TLCA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Recursive Path Ordering, Cut-Elimination, Explicit Substitution, Classical Logic
41Wai-Kei Mak Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead. Search on Bibsonomy ISPD The full citation details ... 2001 DBLP  DOI  BibTeX  RDF minimum cut, circuit partitioning, logic replication
41Joseph Naor, Leonid Zosin A 2-Approximation Algorithm for the Directed Multiway Cut Problem. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor
41Saumya K. Debray, David Scott Warren Towards Banishing the Cut from Prolog. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF impure language features, impure features, Prolog source programs, firstof, oneof, declarative readings, parallel evaluation strategies, purer programming style, logic programs, logic programming, static analysis, PROLOG, program transformations, nondeterminism, cut, language constructs, compile time
40Nathan W. Brixius, Kurt M. Anstreicher The Steinberg Wiring Problem. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Günter M. Ziegler Typical and Extremal Linear Programs. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Denis Naddef The Domino Inequalities for the Symmetric Traveling Salesman Problem. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli Bicolorings and Equitable Bicolorings of Matrices. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Jean Fonlupt The Clique-Rank of 3-Chromatic Perfect Graphs. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Laurence A. Wolsey Time for Old and New Faces. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling Mixed-Integer Programming: A Progress Report. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel On the Way to Perfection: Primal Operations for Stable Sets in Graphs. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Ralf Borndörfer Combinatorial Packing Problems. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Martin Grötschel Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Petra Mutzel, Michael Jünger Graph Drawing: Exact Optimization Helps! Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Annegret Katrin Wagler Relaxing Perfectness: Which Graphs Are "Almost" Perfect? Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Volker Kaibel On the Expansion of Graphs of 0/1-Polytopes. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Christoph Helmberg A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Marcus Oswald, Gerhard Reinelt Computing Optimal Consecutive Ones Matrices. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan Protein Folding on Lattices: An Integer Programming Approach. Search on Bibsonomy The Sharpest Cut The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
39Ye Hou, Bao-Long Guo, Jeng-Shyang Pan 0001 The Application and Study of Graph Cut in Motion Segmentation. Search on Bibsonomy IAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
39Marcelo Finger, Dov M. Gabbay Cut and Pay. Search on Bibsonomy J. Log. Lang. Inf. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Agata Ciabattoni, Kazushige Terui Modular Cut-Elimination: Finding Proofs or Counterexamples. Search on Bibsonomy LPAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Grigori Mints Unwinding a Non-effective Cut Elimination Proof. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Roee Engelberg, Jochen Könemann, Stefano Leonardi 0001, Joseph Naor Cut Problems in Graphs with a Budget Constraint. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Irith Pomeranz, Sudhakar M. Reddy The Cut Delay Fault Model for Guiding the Generation of n-Detection Test Sets for Transition Faults. Search on Bibsonomy VLSI Design The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Reuven Y. Rubinstein Cross-entropy and rare events for maximal cut and partition problems. Search on Bibsonomy ACM Trans. Model. Comput. Simul. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Combinatorial optimization, importance sampling, cross-entropy, rare event simulation
39Sanjiv Kapoor On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees. Search on Bibsonomy IPCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
39Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis All-Pairs Min-Cut in Sparse Networks. Search on Bibsonomy FSTTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
39Halimin Herjanto, Muslim Amin, Cut Erika Fatimah Does knowledge collecting and donating enhance a bank's salesperson performance? Search on Bibsonomy Bus. Process. Manag. J. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
39Cut Alna Fadhilla, Muhammad Dany Alfikri, Rafael Kaliski Lightweight Meta-Learning BotNet Attack Detection. Search on Bibsonomy IEEE Internet Things J. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
39Zamzami Zainuddin, Ratna Farida, Cut Muftia Keumala, Rudi Kurniawan, Hadi Iskandar Synchronous online flip learning with formative gamification quiz: instruction during COVID-19. Search on Bibsonomy Interact. Technol. Smart Educ. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
39Kharis Kharis, Cut Nyak Dameria, Martin Ebner Perception and Acceptance of Padlet as a Microblogging Platform for Writing Skills. Search on Bibsonomy Int. J. Interact. Mob. Technol. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
39Zamzami Zainuddin, Yin Zhang, Xiuhan Li, Samuel Kai-Wah Chu, Saifullah Idris, Cut Muftia Keumala Research trends in flipped classroom empirical evidence from 2017 to 2018. Search on Bibsonomy Interact. Technol. Smart Educ. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
39Cut Maisyarah Karyati, Aries Muslim, Daryl Diningrat 3D Saliva Ferning Images to Determine The Women's Fertility Rates. Search on Bibsonomy ICVIP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
39Amin Subandi, Rini Meiyanti, Cut Lika Mestika Sandy, Rahmat Widia Sembiring Three-Pass Protocol Implementation in Vigenere Cipher Classic Cryptography Algorithm with Keystream Generator Modification. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
39Chenghao Li 0004, Yuan Zhou 0006, Bo Cut, Chunping Hou Depth-weighted correlation method for visual tracking with occlusion detection. Search on Bibsonomy ICIP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Aries Muslim, A. B. Mutiara 0001, Cut Maisyarah Karyati, Purnawarman Musa An Algorithm for Index Multimedia Data (Video) using the Movement Oriented Method for Real-time Online Services Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
38Jue Wang 0001, Pravin Bhat, Alex Colburn, Maneesh Agrawala, Michael F. Cohen Interactive video cutout. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF alpha matting, interactive video processing, mean-shift segmentation, graph-cut, min-cut
38Jin-Tai Yan Connection-oriented net model and fuzzy clustering techniques for K-way circuit partitioning. Search on Bibsonomy ICCD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF fuzzy neural nets, connection-oriented net model, fuzzy clustering techniques, K-way circuit partitioning, chain net model, cut analysis, multiple-pin net, edge-weighted graph, MCNC circuit benchmarks, partitioning balance, partitioning cut, computational complexity, complexity, fuzzy logic, high level synthesis, circuit analysis computing, hypergraph, fuzzy c-means clustering, mapped graph, fuzzy memberships
37Hongwei Liu 0001, Sanyang Liu, Fengmin Xu A Tight Semidefinite Relaxation of the MAX CUT Problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem
Displaying result #1 - #100 of 8499 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license