Results
Found 398 publication records. Showing 398 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
191 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 789-798, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
150 | Hannah Honghua Yang, D. F. Wong 0001 |
New algorithms for min-cut replication in partitioned circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 216-222, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
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 |
141 | Hannah Honghua Yang, Martin D. F. Wong |
Optimal min-area min-cut replication in partitioned circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(11), pp. 1175-1183, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
101 | Kazuhiro 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](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1994, San Jose, California, USA, November 6-10, 1994, pp. 428-431, 1994, IEEE Computer Society / ACM, 0-89791-690-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
91 | Teofilo F. Gonzalez, Toshio Murayama |
Alhorithms for a Class of Min-Cut and Max-Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 97-105, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
90 | Wai-Kei Mak, D. F. Wong 0001 |
Minimum replication min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996, pp. 205-210, 1996, IEEE Computer Society / ACM, 0-8186-7597-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
min-cut partitioning, circuit partitioning, logic replication |
89 | Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis |
All-Pairs Min-Cut in Sparse Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 363-376, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
71 | Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato |
Min-cut placement with global objective functions for large scale sea-of-gates arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(4), pp. 434-446, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
71 | Inderpal S. Bhandari, Mark Hirsch, Daniel P. Siewiorek |
The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 25th ACM/IEEE Conference on Design Automation, DAC '88, Anaheim, CA, USA, June 12-15, 1988., pp. 681-685, 1988, ACM. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP BibTeX RDF |
|
66 | Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykumar |
Min-cut program decomposition for thread-level speculation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pp. 59-70, 2004, ACM, 1-58113-807-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
partitioning, chip multiprocessor, thread-level speculation, min-cut, program decomposition |
66 | Wai-Kei Mak, Martin D. F. Wong |
Minimum replication min-cut partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(10), pp. 1221-1227, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
65 | Andrew B. Kahng, Sherief Reda |
Placement feedback: a concept and method for better min-cut placements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 41th Design Automation Conference, DAC 2004, San Diego, CA, USA, June 7-11, 2004, pp. 357-362, 2004, ACM, 1-58113-828-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
min-cut placement, terminal propagation, feedback |
61 | Jianmin Li, John Lillis, Chung-Kuan Cheng |
Linear decomposition algorithm for VLSI design applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 223-228, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
linear placement, max-flow min-cut, eigenvector, circuit partitioning |
61 | Frank Vahid |
Modifying Min-Cut for Hardware and Software Functional Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES ![In: Proceedings of the Fifth International Workshop on Hardware/Software Codesign, CODES/CASHE 1997, March 24-26, 1997, Braunschweig, Germany, pp. 43-48, 1997, IEEE Computer Society, 0-8186-7895-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Kernighan/Lin, min-cut, Functional partitioning |
57 | Jue Wang 0001, Pravin Bhat, Alex Colburn, Maneesh Agrawala, Michael F. Cohen |
Interactive video cutout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 24(3), pp. 585-594, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
alpha matting, interactive video processing, mean-shift segmentation, graph-cut, min-cut |
56 | Xijin Yan, Jun Yang, Zhen Zhang 0010 |
An outer bound for multisource multisink network coding with minimum cost consideration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2373-2385, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information |
56 | Yuri Boykov, Vladimir Kolmogorov |
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(9), pp. 1124-1137, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
56 | L. James Hwang, Abbas El Gamal |
Min-cut replication in partitioned networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(1), pp. 96-106, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
56 | Md. Altaf-Ul-Amin, Toshihiro Koma, Ken Kurokawa, Shigehiko Kanaya |
Prediction of Protein Functions Based on Protein-Protein Interaction Networks: A Min-Cut Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE Workshops ![In: Proceedings of the 21st International Conference on Data Engineering Workshops, ICDE 2005, 5-8 April 2005, Tokyo, Japan, pp. 1156, 2005, IEEE Computer Society, 0-7695-2657-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
heuristic method, min-cut, protein function prediction, protein-protein interaction network |
56 | Mikkel Thorup |
Fully-dynamic min-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 224-230, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
53 | Mark R. Hartoog |
Analysis of placement procedures for VLSI standard cell layout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, NV, USA, June, 1986., pp. 314-319, 1986, IEEE Computer Society Press. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
51 | Jarrod A. Roy, Saurabh N. Adya, David A. Papa, Igor L. Markov |
Min-cut floorplacement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(7), pp. 1313-1326, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 206-217, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Wai-Kei Mak |
Min-cut partitioning with functional replication fortechnology-mapped circuits using minimum area overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(4), pp. 491-497, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Wai-Kei Mak |
Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2001 International Symposium on Physical Design, ISPD 2001, Sonoma County, CA, USA, April 1-4, 2001, pp. 100-105, 2001, ACM, 1-58113-347-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
minimum cut, circuit partitioning, logic replication |
46 | Yuri Boykov, Vladimir Kolmogorov |
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, Sophia Antipolis, France, September 3-5, 2001, Proceedings, pp. 359-374, 2001, Springer, 3-540-42523-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
45 | Anil Raj, Chris H. Wiggins 0001 |
An Information-Theoretic Derivation of Min-Cut-Based Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 32(6), pp. 988-995, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
graph diffusion, clustering, Graphs, information theory, min-cut, Information Bottleneck |
45 | Mechthild Stoer, Frank Wagner 0001 |
A simple min-cut algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(4), pp. 585-591, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
min-cut |
44 | Gopalakrishnan Vijayan |
Generalization of Min-Cut Partitioning to Tree Structures and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(3), pp. 307-314, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins |
44 | Frank Thomson Leighton, Satish Rao |
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 422-431, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation |
41 | Andrew B. Kahng, Sherief Reda |
Wirelength minimization for min-cut placements via placement feedback. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(7), pp. 1301-1312, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Mala L. Radhakrishnan, Sara L. Su |
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2006, October 8-11, Atlanta, Georgia, USA, pp. 2429-2432, 2006, IEEE, 1-4244-0480-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
41 | José M. Bioucas-Dias, Gonçalo Valadão |
Phase unwrapping: a new max-flow/min-cut based approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings of the 2005 International Conference on Image Processing, ICIP 2005, Genoa, Italy, September 11-14, 2005, pp. 77-80, 2005, IEEE, 0-7803-9134-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Andrew B. Kahng, Igor L. Markov, Sherief Reda |
Boosting: Min-Cut Placement with Improved Signal Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2004 Design, Automation and Test in Europe Conference and Exposition (DATE 2004), 16-20 February 2004, Paris, France, pp. 1098-1103, 2004, IEEE Computer Society, 0-7695-2085-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
41 | Honghua Yang, D. F. Wong 0001 |
Efficient network flow based min-cut balanced partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1994, San Jose, California, USA, November 6-10, 1994, pp. 50-55, 1994, IEEE Computer Society / ACM, 0-89791-690-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
41 | Burkhard Monien, Ivan Hal Sudborough |
Min Cut is NP-Complete for Edge Weigthed Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings, pp. 265-274, 1986, Springer, 3-540-16761-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
40 | Andrew B. Kahng, Igor L. Markov, Sherief Reda |
On legalization of row-based placements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, Boston, MA, USA, April 26-28, 2004, pp. 214-219, 2004, ACM, 1-58113-853-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
min-cut placement, legalization, detailed placement |
40 | Mikkel Thorup |
Fully-Dynamic Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(1), pp. 91-127, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10 |
40 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 54-66, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Hannah Honghua Yang, Martin D. F. Wong |
Balanced partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12), pp. 1533-1540, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Stanislav Zivný, David A. Cohen, Peter G. Jeavons |
The Expressive Power of Binary Submodular Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 744-757, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Decomposition of submodular functions, Pseudo-Boolean optimisation, Submodular function minimisation, Min-Cut |
36 | Ming Leng, Songnian Yu, Yang Chen |
An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROLAMAT ![In: Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management, Proceedings of PROLAMAT 2006, IFIP TC5 International Conference, June 15-17, 2006, Shanghai, China, pp. 294-303, 2006, Springer, 0-387-34402-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
multilevel paradigm, Tabu search, min-cut, graph bipartitioning |
35 | Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001 |
Video retargeting with multi-scale trajectory optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multimedia Information Retrieval ![In: Proceedings of the 11th ACM SIGMM International Conference on Multimedia Information Retrieval, MIR 2010, Philadelphia, Pennsylvania, USA, March 29-31, 2010, pp. 45-54, 2010, ACM, 978-1-60558-815-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting |
35 | Dietmar Ebner, Bernhard Scholz, Andreas Krall |
Progressive spill code placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2009, Grenoble, France, October 11-16, 2009, pp. 77-86, 2009, ACM. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constrained min-cut, spilling, register allocation, SSA form |
35 | Guilherme Ottoni, David I. August |
Communication optimizations for global multi-threaded instruction scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASPLOS ![In: Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2008, Seattle, WA, USA, March 1-5, 2008, pp. 222-232, 2008, ACM, 978-1-59593-958-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
graph min-cut, communication, synchronization, data-flow analysis, multi-threading, instruction scheduling |
35 | Tung-Chieh Chen, Yi-Lin Chuang, Yao-Wen Chang |
X-architecture placement based on effective wire models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2007 International Symposium on Physical Design, ISPD 2007, Austin, Texas, USA, March 18-21, 2007, pp. 87-94, 2007, ACM, 978-1-59593-613-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
X architecture, partitioning, placement, physical design, Steiner tree, min cut, net weighting |
35 | Xue-Bin Liang |
Matrix games in the multicast networks: maximum information flows with network switching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2433-2466, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems |
35 | Timothy Gatzke, Cindy Grimm |
Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 578-584, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Maren Martens, S. Thomas McCormick |
A Polynomial Algorithm for Weighted Abstract Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 97-111, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Saurabh N. Adya, S. Chaturvedi, Jarrod A. Roy, David A. Papa, Igor L. Markov |
Unification of partitioning, placement and floorplanning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2004 International Conference on Computer-Aided Design, ICCAD 2004, San Jose, CA, USA, November 7-11, 2004, pp. 550-557, 2004, IEEE Computer Society / ACM, 0-7803-8702-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Ghazi Al-Rawi, John M. Cioffi, Mark Horowitz |
Optimizing the Mapping of Low-Density Parity Check Codes on Parallel Decoding Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2001 International Symposium on Information Technology (ITCC 2001), 2-4 April 2001, Las Vegas, NV, USA, pp. 578-, 2001, IEEE Computer Society, 0-7695-1062-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Efficient algorithms for computing all low s-t edge connectivities and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 127-136, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
30 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman |
Single source multiroute flows and cuts on uniform capacity networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 855-863, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
30 | Nawal Houhou, Xavier Bresson, Arthur Szlam, Tony F. Chan, Jean-Philippe Thiran |
Semi-supervised Segmentation Based on Non-local Continuous Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSVM ![In: Scale Space and Variational Methods in Computer Vision, Second International Conference, SSVM 2009, Voss, Norway, June 1-5, 2009. Proceedings, pp. 112-123, 2009, Springer, 978-3-642-02255-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | 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) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 188-193, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Volker Elling, Karsten Schwan |
Min-Cut Methods for Mapping Dataflow Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31 - September 3, 1999, Proceedings, pp. 203-212, 1999, Springer, 3-540-66443-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Dorothea Wagner, Frank Wagner 0001 |
Between Min Cut and Graph Bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 744-750, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Masayuki Terai, Kazuhiro Takahashi, Koji Sato |
A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 27th ACM/IEEE Design Automation Conference. Orlando, Florida, USA, June 24-28, 1990., pp. 96-102, 1990, IEEE Computer Society Press, 0-89791-363-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
30 | Song Guo 0001, Victor C. M. Leung |
A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 18(4), pp. 1067-1076, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
30 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the min-max (regret) versions of min cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 5(1), pp. 66-73, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | David R. Karger |
Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA., pp. 21-30, 1993, ACM/SIAM, 0-89791-562-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Sudhanshu Chanpuriya, Cameron Musco |
Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.06448, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
Cut-Equivalent Trees are Optimal for Min-Cut Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.06090, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
29 | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
Cut-Equivalent Trees are Optimal for Min-Cut Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 105-118, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
29 | Sagnik Mukhopadhyay, Danupon Nanongkai |
Weighted min-cut: sequential, cut-query, and streaming algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pp. 496-509, 2020, ACM, 978-1-4503-6979-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
29 | Sagnik Mukhopadhyay, Danupon Nanongkai |
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.01651, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
29 | Vladimir A. Bondarenko, Andrei V. Nikolaev |
On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Math. Sci. ![In: Int. J. Math. Math. Sci. 2016, pp. 7863650:1-7863650:6, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | David R. Karger, Debmalya Panigrahi |
A near-linear time algorithm for constructing a cactus representation of minimum cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 246-255, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov |
Can recursive bisection alone produce routable placements? ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 37th Conference on Design Automation, Los Angeles, CA, USA, June 5-9, 2000., pp. 477-482, 2000, ACM. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Joseph S. B. Mitchell |
On Maximum Flows in Polyhedral Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 341-351, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
26 | Aurore Amaudruz, Christina Fragouli |
Combinatorial algorithms for wireless information flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 555-564, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Sagi Snir, Satish Rao |
Using Max Cut to Enhance Rooted Trees Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 323-333, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rooted triplets, semidefinite programming, Phylogenetic trees, supertrees |
26 | Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huang, Igor L. Markov, Kenneth Yan |
Quadratic Placement Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 34st Conference on Design Automation, Anaheim, California, USA, Anaheim Convention Center, June 9-13, 1997., pp. 752-757, 1997, ACM Press, 0-89791-920-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Timo Kötzing, Per Kristian Lehre, Frank Neumann 0001, Pietro S. Oliveto |
Ant colony optimization and the minimum cut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 1393-1400, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
ant colony optimization, min-cut |
26 | David R. Karger |
Minimum cuts in near-linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(1), pp. 46-76, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
tree packing, optimization, connectivity, min-cut, Monte Carlo algorithm |
25 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
A general approach to online network optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 640-660, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding |
25 | Ishai Menache, Shie Mannor, Nahum Shimkin |
Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2002, 13th European Conference on Machine Learning, Helsinki, Finland, August 19-23, 2002, Proceedings, pp. 295-306, 2002, Springer, 3-540-44036-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin |
Maximum Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2009-2020, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem |
25 | Antonin Chambolle, Jérôme Darbon |
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 84(3), pp. 288-307, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Crystalline and anisotropic mean curvature flow, Max-flow/min-cut, Parametric max-flow algorithms, Total variation, Submodular functions, Variational approaches |
25 | Vladimir Kolmogorov, Carsten Rother |
Minimizing Nonsubmodular Functions with Graph Cuts-A Review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(7), pp. 1274-1279, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
quadratic pseudo-Boolean optimization, min cut/max flow, texture restoration, Markov Random Fields, Energy minimization |
25 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 605-614, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
25 | Liang-Liang Xie, Panganamala R. Kumar |
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2313-2328, 2006. The full citation details ...](Pics/full.jpeg) |
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 |
25 | Christina Fragouli, Tarik Tabet |
On conditions for constant throughput in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Sens. Networks ![In: ACM Trans. Sens. Networks 2(3), pp. 359-379, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Foundations of sensor and ad hoc networks, constant throughput, min cut bounds, sensor networks throughput, mobility, wireless networks, mobility model, multicommodity flow |
25 | Jingtao Yu, Pingyi Fan, Kai Cai |
Capacity analysis of maximal flow in ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 1225-1228, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
max-flow min-cut, routing, network coding, random graph, network capacity |
25 | Georg Baier, Ekkehard Köhler, Martin Skutella |
The k-Splittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 231-248, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow |
25 | Palash Sarkar 0001, Paul J. Schellenberg |
Construction of Symmetric Balanced Squares with Blocksize More than One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(3), pp. 235-280, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
symmetric Latin square, symmetric balanced square, min cut-max flow theorem, combinatorial design |
25 | Ioannis C. Avramopoulos, Miltiades E. Anagnostou |
Optimal Component Configuration and Component Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 1(4), pp. 303-312, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
component allocation, component mobility, multiterminal cuts, max flow—min cut, mixed binary integer programming, Mobile agents, reconfiguration, NP-hard problems |
25 | Jon M. Kleinberg |
Single-Source Unsplittable Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 68-77, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints |
25 | Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao |
Approximation through Multicommodity Flow ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 726-737, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow |
22 | Gopalakrishnan Vijayan |
Partitioning logic on graph structures to minimize routing cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(12), pp. 1326-1334, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | L. Darrell Whitley, Andrew M. Sutton |
Partial neighborhoods of elementary landscapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 381-388, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
elementary landscapes, fitness landscapes |
21 | Stanislav Zivný, Peter G. Jeavons |
The Complexity of Valued Constraint Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, pp. 833-841, 2009, Springer, 978-3-642-04243-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Yung-Chuan Jiang, Jhing-Fa Wang |
Temporal Partitioning Data Flow Graphs for Dynamically Reconfigurable Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 15(12), pp. 1351-1361, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lixia Zhang 0001 |
Inferring the Origin of Routing Changes using Link Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Proceedings of the IEEE International Conference on Network Protocols, ICNP 2007, October 16-19, 2007, Beijing, China, pp. 93-102, 2007, IEEE Computer Society, 1-4244-1588-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Sidharth Jaggi, Peter Sanders 0001, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen |
Polynomial time algorithms for multicast network code construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(6), pp. 1973-1982, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Aseem Agarwala, Ke Colin Zheng, Chris Pal, Maneesh Agrawala, Michael F. Cohen, Brian Curless, David Salesin, Richard Szeliski |
Panoramic video textures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 24(3), pp. 821-827, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
panoramas, video-based rendering, video textures |
21 | Indra Geys, Thomas P. Koninckx, Luc Van Gool |
Fast Interpolated Cameras by Combining a GPU based Plane Sweep with a Max-Flow Regularisation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
3DPVT ![In: 2nd International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT 2004), 6-9 September 2004, Thessaloniki, Greece, pp. 534-541, 2004, IEEE Computer Society, 0-7695-2223-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Jittat Fakcharoenphol, Kunal Talwar |
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 36-46, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen |
Polynomial time algorithms for network information flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 286-294, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory |
21 | Chris Buehler, Steven J. Gortler, Michael F. Cohen, Leonard McMillan |
Minimal Surfaces for Stereo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (3) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part III, pp. 885-899, 2002, Springer, 3-540-43746-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 398 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ >>] |