|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 238 occurrences of 179 keywords
|
|
|
Results
Found 398 publication records. Showing 398 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
20 | Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel |
The Max-Flow Min-Cut theorem for countable networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 101(1), pp. 1-17, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robert W. Robinson, Jack C. Yu, Tianming Liu 0001 |
Detection of hairline mandibular fracture using max-flow min-cut and Kolmogorov-Smirnov distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: Proceedings of the 8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, ISBI 2011, March 30 - April 2, 2011, Chicago, Illinois, USA, pp. 1962-1965, 2011, IEEE, 978-1-4244-4128-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Maximilien Gadouleau, Søren Riis |
Max-flow min-cut theorem for Rényi entropy in communication networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pp. 603-607, 2011, IEEE, 978-1-4577-0596-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Amir Massoudi, Arcot Sowmya, Katarina Mele, Dimitri Semenovich |
Employing temporal information for cell segmentation using max-flow/min-cut in phase-contrast video microscopy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMBC ![In: 33rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBC 2011, Boston, MA, USA, August 30 - Sept. 3, 2011, pp. 5985-5988, 2011, IEEE, 978-1-4244-4121-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Tao Lin, Sheqin Dong, Song Chen 0001, Yuchun Ma, Ou He, Satoshi Goto |
Novel and efficient min cut based voltage assignment in gate level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISQED ![In: Proceedings of the 12th International Symposium on Quality Electronic Design, ISQED 2011, Santa Clara, California, USA, 14-16 March 2011, pp. 150-155, 2011, IEEE, 978-1-61284-914-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
Improved algorithms for min cut and max flow in undirected planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pp. 313-322, 2011, ACM, 978-1-4503-0691-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | Raquel Fandos, Leyna Sadamori, Abdelhak M. Zoubir |
High quality segmentation of synthetic aperture sonar images using the min-cut/max-flow algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUSIPCO ![In: Proceedings of the 19th European Signal Processing Conference, EUSIPCO 2011, Barcelona, Spain, August 29 - Sept. 2, 2011, pp. 51-55, 2011, IEEE. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
20 | Michel Minoux, Hacene Ouzia |
Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 36, pp. 1217-1224, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | José Martínez-Bernal, Edwin O'Shea, Rafael H. Villarreal |
Ehrhart Clutters: Regularity and Max-Flow Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 17(1), 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Junqiu Wang, Yasushi Yagi |
Tracking and segmentation using min-cut with consecutive shape priors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Paladyn J. Behav. Robotics ![In: Paladyn J. Behav. Robotics 1(1), pp. 73-79, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Eduardo Corel, Florian Pitschi, Burkhard Morgenstern |
A min-cut algorithm for the consistency problem in multiple sequence alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 26(8), pp. 1015-1021, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Maximilien Gadouleau, Søren Riis |
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.5224, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
20 | Ali Ridha Mahjoub, S. Thomas McCormick |
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 124(1-2), pp. 271-284, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari |
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 1209-1226, 2010, SIAM, 978-0-89871-701-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Lennart Gerdes, Mohit Thakur, Ralf Kötter |
On the Dynamic Behavior of the Min-Cut in Random Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2010, Cape Town, South Africa, 23-27 May 2010, pp. 1-6, 2010, IEEE, 978-1-4244-6402-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Viet Quoc Pham, Keita Takahashi 0001, Takeshi Naemura |
Bounding-Box Based Segmentation with Single Min-cut Using Distant Pixel Similarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 20th International Conference on Pattern Recognition, ICPR 2010, Istanbul, Turkey, 23-26 August 2010, pp. 4420-4423, 2010, IEEE Computer Society, 978-0-7695-4109-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Jing Yuan 0001, Egil Bae, Xue-Cheng Tai |
A study on continuous max-flow and min-cut approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: The Twenty-Third IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2010, San Francisco, CA, USA, 13-18 June 2010, pp. 2217-2224, 2010, IEEE Computer Society, 978-1-4244-6984-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Kanemitsu Ootsu, Takeshi Abe, Takashi Yokota, Takanobu Baba |
Loop Performance Improvement for Min-cut Program Decomposition Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC ![In: First International Conference on Networking and Computing, ICNC 2010, Higashi Hiroshima, Japan, November 17-19, 2010. Proceedings, pp. 78-87, 2010, IEEE Computer Society, 978-0-7695-4277-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Moti Freiman, Achia Kronman, Steven J. Esses, Leo Joskowicz, Jacob Sosna |
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICCAI (3) ![In: Medical Image Computing and Computer-Assisted Intervention - MICCAI 2010, 13th International Conference, Beijing, China, September 20-24, 2010, Proceedings, Part III, pp. 73-80, 2010, Springer, 978-3-642-15710-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Nicolas Duflot, Christophe Bérenguer, Laurence Dieulle, Dominique Vasseur |
A min cut-set-wise truncation procedure for importance measures computation in probabilistic safety assessment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Eng. Syst. Saf. ![In: Reliab. Eng. Syst. Saf. 94(11), pp. 1827-1837, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | S. Shine, K. Murali Krishnan 0001 |
Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0912.1200, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
20 | Christian Wulff-Nilsen |
Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0912.1208, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
20 | Aleksey Golovinskiy, Thomas A. Funkhouser |
Min-cut based segmentation of point clouds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV Workshops ![In: 12th IEEE International Conference on Computer Vision Workshops, ICCV Workshops 2009, Kyoto, Japan, September 27 - October 4, 2009, pp. 39-46, 2009, IEEE Computer Society, 978-1-4244-4442-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Hannah Honghua Yang, Martin D. F. Wong |
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2008 Edition, 2008, Springer, 978-0-387-30770-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Yun Zeng, Dimitris Samaras, Wei Chen 0001, Qunsheng Peng 0001 |
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Vis. Image Underst. ![In: Comput. Vis. Image Underst. 112(1), pp. 81-90, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Rui A. Costa, João Barros |
A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0809.1379, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
20 | Masahiro Hachimori, M. Nakamura |
The max-flow min-cut property of two-dimensional affine convex geometries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(9), pp. 1674-1689, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Hakan Topakkaya, Zhengdao Wang |
Effects of delay and links between relays on the min-cut capacity in a wireless relay network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton ![In: 46th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2008, Monticello, IL, USA, September 24-26, 2008, pp. 319-323, 2008, IEEE, 978-1-4244-2925-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Mohit Bansal, Claire Cardie, Lillian Lee |
The Power of Negative Thinking: Exploiting Label Disagreement in the Min-cut Classification Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLING (Posters) ![In: COLING 2008, 22nd International Conference on Computational Linguistics, Posters Proceedings, 18-22 August 2008, Manchester, UK, pp. 15-18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
20 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 21(1), pp. 1-15, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Michael Brinkmeier |
A Simple and Fast Min-Cut Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(2), pp. 369-380, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan |
Visualization of large networks with min-cut plots, A-plots and R-MAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Hum. Comput. Stud. ![In: Int. J. Hum. Comput. Stud. 65(5), pp. 434-445, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Mohammad Taghi Hajiaghayi, Tom Leighton |
On the max-flow min-cut ratio for directed multicommodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 352(1-3), pp. 318-321, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Urs Niesen, Christina Fragouli, Daniela Tuninetti |
Scaling Laws for Line Networks: From Zero-Error to Min-Cut Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006, pp. 1698-1702, 2006, IEEE, 1-4244-0504-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Matthew W. Turek, Daniel Freedman |
Multiscale Modeling and Constraints for Max-flow/Min-cut Problems in Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR Workshops 2006, New York, NY, USA, 17-22 June, 2006, pp. 180, 2006, IEEE Computer Society, 0-7695-2646-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Jarrod A. Roy, David A. Papa, Saurabh N. Adya, Hayward H. Chan, Aaron N. Ng, James F. Lu, Igor L. Markov |
Capo: robust and scalable open-source min-cut floorplacer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2005 International Symposium on Physical Design, ISPD 2005, San Francisco, California, USA, April 3-6, 2005, pp. 224-226, 2005, ACM, 1-59593-021-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
placement, physical design, floorplanning |
20 | Michael Brinkmeier |
A Simple and Fast Min-cut Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 317-328, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Francisco J. Estrada, Allan D. Jepson, Chakra Chennubhotla 0001 |
Spectral Embedding and Min Cut for Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMVC ![In: British Machine Vision Conference, BMVC 2004, Kingston, UK, September 7-9, 2004. Proceedings, pp. 1-10, 2004, BMVA Press, 1-901725-25-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Xianyang Jiang, Xubang Shen, Tianxu Zhang, Huayu Liu |
An improved circuit-partitioning algorithm based on min-cut equivalence relation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Integr. ![In: Integr. 36(1-2), pp. 55-68, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Bertrand Guenin |
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 86(2), pp. 273-279, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Phil Diamond |
A fuzzy max-flow min-cut theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 119(1), pp. 139-148, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Wai-Kei Mak, D. F. Wong 0001 |
A fast hypergraph min-cut algorithm for circuit partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Integr. ![In: Integr. 30(1), pp. 1-11, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
20 | Srinivasa Rao Arikati, Kurt Mehlhorn |
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 70(5), pp. 251-254, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Frank Thomson Leighton, Satish Rao |
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(6), pp. 787-832, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection |
20 | Dimitris Alevras |
Small Min-Cut Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 24(1), pp. 35-49, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis |
All-Pairs Min-Cut in Sparse Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 29(1), pp. 82-110, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Yonatan Aumann, Yuval Rabani |
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 27(1), pp. 291-301, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Manfred Padberg, Ting-Yi Sung |
An analytic symmetrization of max flow-min cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 165-166, pp. 531-545, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
20 | Youssef Saab |
A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: VLSI Design 5(1), pp. 37-48, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Spyros Tragoudas |
Min-Cut Partitioning on Underlying Tree and Graph Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 45(4), pp. 470-474, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Circuit and network partitioning, NP-hard, iterative improvement |
20 | Raymond Lo, Sun Chan, James C. Dehnert, Ross A. Towle |
Aggregate Operation Movement: A Min-Cut Approach to Global Code Motion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. II ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II, pp. 801-814, 1996, Springer, 3-540-61627-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
global code motion, software pipelining, network flow, superscalar, minimum cut, global scheduling |
20 | Gavril Godza, Maurizio Rebaudengo, Matteo Sonza Reorda |
Using Parallel Genetic Algorithms for Solving the Min-Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCN ![In: High-Performance Computing and Networking, International Conference and Exhibition, HPCN Europe 1996, Brussels, Belgium, April 15-19, 1996, Proceedings, pp. 985-986, 1996, Springer, 3-540-61142-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
20 | Serge A. Plotkin, Éva Tardos |
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 15(3), pp. 425-434, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi 0001 |
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 15(2), pp. 187-202, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | David Hartvigsen |
Generalizing the all-pairs min cut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 147(1-3), pp. 151-169, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | Katsunori Tani |
A robust min-cut improvement algorithm based on dynamic look-ahead weighting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29 - September 1, 1995, 1995, ACM, 0-89791-766-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | David Hartvigsen, Russell Mardon |
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 7(3), pp. 403-418, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Ryôhei Nozawa |
Examples of max-flow and min-cut problems with duality gaps in continuous networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 63, pp. 213-234, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Mechthild Stoer, Frank Wagner 0001 |
A Simple Min Cut Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 141-147, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Roman Kuznar, Baldomir Zajc, Franc Brglez |
A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURO-DAC ![In: Proceedings EURO-DAC'94, European Design Automation Conference, Grenoble, France, September 19-22, 1994, pp. 271-276, 1994, IEEE Computer Society, 0-89791-685-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Spyros Tragoudas |
An improved algorithm for the generalized min-cut partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: Fourth Great Lakes Symposium on Design Automation of High Performance VLSI Systems, GLSV '94, Notre Dame, IN, USA, March 4-5, 1994, pp. 242-247, 1994, IEEE, 0-8186-5610-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
20 | Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser |
Min-cut clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 62, pp. 133-151, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | Serge A. Plotkin, Éva Tardos |
Improved bounds on the max-flow min-cut ratio for multicommodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 691-697, 1993, ACM, 0-89791-591-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | Monique Laurent, Antonio Sassano |
A characterization of knapsacks with the max-flow- - min-cut property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 11(2), pp. 105-110, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
20 | L. James Hwang, Abbas El Gamal |
Optimal replication for min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 1992 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1992, Santa Clara, CA, USA, November 8-12, 1992. Digest of Technical Papers, pp. 432-435, 1992, IEEE Computer Society / ACM, 0-8186-3010-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
20 | Dan Bienstock |
Some Generalized Max-Flow Min-Cut Problems in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 16(2), pp. 310-333, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Hiroshi Nagamochi, Toshihide Ibaraki |
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 31(6), pp. 279-285, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
20 | Burkhard Monien, Ivan Hal Sudborough |
Min Cut is NP-Complete for Edge Weighted Treees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 58, pp. 209-229, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
20 | Dwight D. Hill |
Alternative strategies for applying min-cut to VLSI placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: Computer Design: VLSI in Computers and Processors, ICCD 1988., Proceedings of the 1988 IEEE International Conference on, Rye Brook, NY, USA, October 3-5, 1988, pp. 440-444, 1988, IEEE, 0-8186-0872-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
20 | Shai Simonson |
A Variation on the Min Cut Linear Arrangement Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 20(4), pp. 235-252, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Klaus Truemper |
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 12(1), pp. 72-96, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Fan T. Tseng, Klaus Truemper |
A decomposition of the matroids with the max-flow min-cut property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 15(2-3), pp. 329-364, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
20 | Mihalis Yannakakis |
A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(4), pp. 950-988, October 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
20 | Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner |
Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 14(1), pp. 158-177, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
20 | Richard G. Ogier |
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1985 |
RDF |
|
20 | Balakrishnan Krishnamurthy |
An Improved Min-Cut Algorithm for Partitioning VLSI Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 33(5), pp. 438-446, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
VLSI layout, Partitioning algorithms |
20 | Mihalis Yannakakis |
A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983, pp. 274-281, 1983, IEEE Computer Society, 0-8186-0508-1. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
20 | Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner |
Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pp. 262-271, 1982, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
20 | Ulrich Lauther |
A min-cut placement algorithm for general cell assemblies based on a graph representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 16th Design Automation Conference, DAC '79, San Diego, California, USA, June 25-27, 1979, pp. 1-10, 1979, ACM. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP BibTeX RDF |
|
20 | Paul D. Seymour |
The matroids with the max-flow min-cut property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 23(2-3), pp. 189-222, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
20 | Melvin A. Breuer |
A class of min-cut placement algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 14th Design Automation Conference, DAC '77, New Orleans, Louisiana, USA, June 20-22, 1977, pp. 284-290, 1977, ACM. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP BibTeX RDF |
|
20 | Alan J. Hoffman |
A generalization of max flow - min cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 6(1), pp. 352-359, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
16 | Song Guo 0001, Oliver W. W. Yang, Victor C. M. Leung |
Improving Scalability for Longest-lived Multicast Using Localized Operations in WANETs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SECON ![In: Proceedings of the Fourth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2007, Merged with IEEE International Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN), June 18-21, 2007, San Diego, California, USA, pp. 243-252, 2007, IEEE, 1-4244-1268-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Wai-Kei Mak, Evangeline F. Y. Young |
Temporal logic replication for dynamically reconfigurable FPGA partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(7), pp. 952-959, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Wai-Kei Mak, Evangeline F. Y. Young |
Temporal logic replication for dynamically reconfigurable FPGA partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of 2002 International Symposium on Physical Design, ISPD 2002, Del Mar, CA, USA, April 7-10, 2002, pp. 190-195, 2002, ACM, 1-58113-460-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Huiqun Liu, Martin D. F. Wong |
Network-flow-based multiway partitioning with area and pin constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(1), pp. 50-59, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Gopalakrishnan Vijayan |
Min-cost Partitioning on a Tree Structure and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 26th ACM/IEEE Design Automation Conference, Las Vegas, Nevada, USA, June 25-29, 1989., pp. 771-774, 1989, ACM Press. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
16 | Jose Joaquin Garcia-Luna-Aceves, Zheng Wang 0006, Hamid R. Sadjadpour, Shirish S. Karande |
Optimal Unicast Capacity of Random Geometric Graphs: Impact of Multipacket Transmission and Reception. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 27(7), pp. 1180-1191, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Jinhui Xu 0001, Lei Xu 0006, Evanthia Papadopoulou |
Computing the Map of Geometric Minimal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 244-254, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Kook Jin Ahn, Sudipto Guha |
Graph Sparsification in the Semi-streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 328-338, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | James R. Lee, Anastasios Sidiropoulos |
On the geometry of graphs with a forbidden minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 245-254, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
forbidden minors, geometry of graphs, embeddings |
16 | José M. Bioucas-Dias, Gonçalo Valadão |
Phase Unwrapping via Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 16(3), pp. 698-709, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven |
Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Olivier Juan, Yuri Boykov |
Capacity Scaling for Graph Cuts in Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Lei Wu, Houqiang Li, Nenghai Yu, Mingjing Li |
Volume Graph Model for 3D Facial Surface Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007, July 2-5, 2007, Beijing, China, pp. 268-271, 2007, IEEE Computer Society, 1-4244-1017-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Branislav Micusík, Tomás Pajdla |
Multi-label image segmentation via max-sum solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 18-23 June 2007, Minneapolis, Minnesota, USA, 2007, IEEE Computer Society, 1-4244-1179-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Wenxian Yang, King Ngi Ngan |
Unsupervised Multiple Object Segmentation of Multiview Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIVS ![In: Advanced Concepts for Intelligent Vision Systems, 9th International Conference, ACIVS 2007, Delft, The Netherlands, August 28-31, 2007, Proceedings, pp. 178-189, 2007, Springer, 978-3-540-74606-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros |
Capacity of wireless erasure networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(3), pp. 789-804, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Songqiao Han, Shensheng Zhang, Yong Zhang 0033 |
A Generic Software Partitioning Algorithm for Pervasive Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, First International Conference, WASA 2006, Xi'an, China, August 15-17, 2006, Proceedings, pp. 57-68, 2006, Springer, 3-540-37189-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Algorithm, Pervasive computing, Software partitioning |
16 | Douglas J. Kennard, William A. Barrett |
Separating Lines of Text in Free-Form Handwritten Historical Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIAL ![In: Second International Workshop on Document Image Analysis for Libraries (DIAL 2006), 27-28 April 2006, Lyon, France, pp. 12-23, 2006, IEEE Computer Society, 0-7695-2531-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 398 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ >>] |
|