|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 14 keywords
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
161 | Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovsky |
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. |
ASP-DAC |
2001 |
DBLP DOI BibTeX RDF |
|
76 | Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar |
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Falk Hüffner |
Algorithm Engineering for Optimal Graph Bipartization. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Hatem Tahri, Mourad Elloumi |
A New Approximation Algorithm for the Minimum Fragment Removal Problem. |
BIRD |
2008 |
DBLP DOI BibTeX RDF |
haplotype assembly, minimum fragment removal, vertex bipartization, algorithms, complexities, Graphs |
46 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. |
Comb. |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85 |
46 | Michel X. Goemans, David P. Williamson |
Primal-Dual Approximation Algorithms for Feedback Problems. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Lan Lin, Yixun Lin |
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design. |
Int. J. Found. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
30 | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. |
SoCG |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Timothy D. Goodrich, Eric Horton, Blair D. Sullivan |
An Updated Experimental Evaluation of Graph Bipartization Methods. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
30 | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Faster Graph bipartization. |
J. Comput. Syst. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization Faster than $$2^k$$ 2 k. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
30 | Mateusz Miotk, Jerzy Topp, Pawel Zylinski |
Bipartization of Graphs. |
Graphs Comb. |
2019 |
DBLP DOI BibTeX RDF |
|
30 | Timothy D. Goodrich, Eric Horton, Blair D. Sullivan |
Practical Graph Bipartization with Applications in Near-Term Quantum Computing. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
30 | Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski |
On bipartization of cubic graphs by removal of an independent set. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
30 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization Faster Than 2^k. |
IPEC |
2016 |
DBLP DOI BibTeX RDF |
|
30 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization faster than 2k. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
30 | Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski |
On bipartization of cubic graphs by removal of an independent set. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
30 | Pierre Fouilhoux, Ali Ridha Mahjoub |
Solving VLSI design and DNA sequencing problems using bipartization of graphs. |
Comput. Optim. Appl. |
2012 |
DBLP DOI BibTeX RDF |
|
30 | |
On Approximating Graph Bipartization via Node Deletion |
CoRR |
2012 |
DBLP BibTeX RDF |
|
30 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Treewidth Reduction for Constrained Separation and Bipartization Problems. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
30 | Falk Hüffner |
Algorithm Engineering for Optimal Graph Bipartization. |
J. Graph Algorithms Appl. |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Treewidth reduction for constrained separation and bipartization problems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
30 | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
Planar graph bipartization in linear time. |
Discret. Appl. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke 0001 |
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
Planar graph bipartization in linear time. |
Electron. Notes Discret. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Heiko Schröder 0001, A. E. May, Imrich Vrto, Ondrej Sýkora |
Approximation Algorithms for the Vertex Bipartization Problem. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Hyeong-Ah Choi, Kazuo Nakajima, Chong S. Rim |
Graph Bipartization and via Minimization. |
SIAM J. Discret. Math. |
1989 |
DBLP DOI BibTeX RDF |
|
29 | Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende |
Feedback Set Problems. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Feedback set problem, Graph bipartization, Combinatorial optimization, Local search, GRASP, FORTRAN subroutines |
29 | Thomas Erlebach, Stamatis Stefanakos |
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Wavelength converter placement, Bipartization, Sufficient set, L-reduction, Graph algorithm, Wavelength assignment, Edge coloring |
29 | Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende |
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. |
ACM Trans. Math. Softw. |
2001 |
DBLP DOI BibTeX RDF |
feedback set problems, graph bipartization, Combinatorial optimization, local search, GRASP, FORTRAN subroutines |
23 | Charles C. Chiang, Andrew B. Kahng, Subarna Sinha, Xu Xu 0001, Alexander Zelikovsky |
Fast and Efficient Bright-Field AAPSM Conflict Detection and Correction. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke 0001 |
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan |
Constraint Satisfaction: The Approximability of Minimization Problems. |
CCC |
1997 |
DBLP DOI BibTeX RDF |
complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization |
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|