Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. P. Alimonti, Non-Oblivious Local Search for Graph and Hypergraph Coloring Problems, 21st International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1017, Springer Verlag, 167–180, 1995.
2. P. Alimonti, New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. Information Processing Letters 57, 151–158, 1996.
3. P. Alimonti, and R. Ferroni, Algorithms for the Maximum Generalized Satisfiability Problem, Rapporto Tecnico, RAP 01.93, Dipartimento di Informatica e Sistemistica, Università degli Studi di Roma “la Sapienza”, 1993.
4. P. Alimonti, S. Leonardi, A. Marchetti Spaccamela, Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs, RAIRO Journal on Theoretical Informatics and Applications 30, 4, 305–318, 1996.
5. G. Ausiello, and G.F. Italiano, On-Line Algorithms for Polynomially Solvable Satisfiability Problems, Journal of Logic Programming, 10, 69–90, 1991.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献