Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,792 papers from all fields of science
Search
Sign In
Create Free Account
Iterative compression
In computer science, iterative compression is an algorithmic technique for the design of fixed-parameter tractable algorithms, in which one element…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Algorithmic paradigm
Computer science
Exponential search
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Live Prototyping
Willem Horst
,
Ben Matthews
Conference on Designing Interactive Systems
2016
Corpus ID: 13916123
The technical skills required to effect functional and material changes to high fidelity prototypes can create barriers to the…
Expand
2014
2014
ROCKAFELLAR'S PROXIMAL POINT ALGORITHM FOR A FINITE FAMILY OF MONOTONE OPERATORS
M. Eslamian
2014
Corpus ID: 14129616
In this paper, we consider Rockafellar’s proximal point algorithm with viscosity method for a finite family of monotone operators…
Expand
2013
2013
Assessing the quality of multilevel graph clustering
François Queyroi
,
M. Delest
,
J. Fedou
,
G. Melançon
Data mining and knowledge discovery
2013
Corpus ID: 14656719
“Lifting up” a non-hierarchical approach to handle hierarchical clustering by iteratively applying the approach to hierarchically…
Expand
Review
2009
Review
2009
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Jiong Guo
,
Hannes Moser
,
R. Niedermeier
Algorithmics of Large and Complex Networks
2009
Corpus ID: 1489935
We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed…
Expand
2005
2005
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Jiong Guo
,
J. Gramm
,
Falk Hüffner
,
R. Niedermeier
,
S. Wernicke
Workshop on Algorithms and Data Structures
2005
Corpus ID: 16182314
Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O…
Expand
Highly Cited
2004
Highly Cited
2004
Parameterized coloring problems on chordal graphs
D. Marx
Theoretical Computer Science
2004
Corpus ID: 17632204
Highly Cited
2004
Highly Cited
2004
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
F. Dehne
,
M. Fellows
,
Frances A. Rosamond
,
Peter Shaw
IWPEC
2004
Corpus ID: 3957716
The two objectives of this paper are: (1) to articulate three new general techniques for designing FPT algorithms, and (2) to…
Expand
2004
2004
Preconditioned multi-zone boundary element analysis for fast 3D electric simulation
Wenjian Yu
,
Zeyi Wang
,
Xianlong Hong
2004
Corpus ID: 67799272
Highly Cited
1999
Highly Cited
1999
Effective iterative techniques for fingerprinting design IP
A. Caldwell
,
Hyun-Jin Choi
,
+4 authors
J. Wong
IEEE Transactions on Computer-Aided Design of…
1999
Corpus ID: 7144703
Fingerprinting is an approach that assigns a unique and invisible ID to each sold instance of the intellectual property (IP). One…
Expand
Highly Cited
1999
Highly Cited
1999
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
R. Battiti
,
A. Bertossi
IEEE Trans. Computers
1999
Corpus ID: 14283130
New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction scheme with an appropriate tie…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE