iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.dagstuhl.de/pid/32/4289.bib
@article{DBLP:journals/algorithmica/BattitiP01, author = {Roberto Battiti and Marco Protasi}, title = {Reactive Local Search for the Maximum Clique Problem}, journal = {Algorithmica}, volume = {29}, number = {4}, pages = {610--637}, year = {2001}, url = {https://doi.org/10.1007/s004530010074}, doi = {10.1007/S004530010074}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BattitiP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @book{DBLP:books/lib/Ausiello99, author = {Giorgio Ausiello and Alberto Marchetti{-}Spaccamela and Pierluigi Crescenzi and Giorgio Gambosi and Marco Protasi and Viggo Kann}, title = {Complexity and approximation: combinatorial optimization problems and their approximability properties}, publisher = {Springer}, year = {1999}, url = {https://link.springer.com/book/10.1007/978-3-642-58412-1}, doi = {10.1007/978-3-642-58412-1}, isbn = {3540654313}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/lib/Ausiello99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/dam/BattitiP99, author = {Roberto Battiti and Marco Protasi}, title = {Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {3--27}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00030-X}, doi = {10.1016/S0166-218X(99)00030-X}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BattitiP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/dam/GambosiPT97, author = {Giorgio Gambosi and Marco Protasi and Maurizio Talamo}, title = {Preserving Approximation in the Min-Weighted Set Cover Problem}, journal = {Discret. Appl. Math.}, volume = {73}, number = {1}, pages = {13--22}, year = {1997}, url = {https://doi.org/10.1016/S0166-218X(96)00047-9}, doi = {10.1016/S0166-218X(96)00047-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GambosiPT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/jea/BattitiP97, author = {Roberto Battiti and Marco Protasi}, title = {Reactive Search, a History-Sensitive Heuristic for {MAX-SAT}}, journal = {{ACM} J. Exp. Algorithmics}, volume = {2}, pages = {2}, year = {1997}, url = {https://doi.org/10.1145/264216.264220}, doi = {10.1145/264216.264220}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BattitiP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icnn/FrasconiGFP97, author = {Paolo Frasconi and Marco Gori and Stefano Fanelli and Marco Protasi}, title = {Suspiciousness of loading problems}, booktitle = {Proceedings of International Conference on Neural Networks (ICNN'97), Houston, TX, USA, June 9-12, 1997}, pages = {1240--1245}, publisher = {{IEEE}}, year = {1997}, url = {https://doi.org/10.1109/ICNN.1997.616211}, doi = {10.1109/ICNN.1997.616211}, timestamp = {Fri, 16 Aug 2019 17:38:27 +0200}, biburl = {https://dblp.org/rec/conf/icnn/FrasconiGFP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/iconip/BianchiniFGP97, author = {Monica Bianchini and Stefano Fanelli and Marco Gori and Marco Protasi}, editor = {Nikola K. Kasabov and Robert Kozma and Kitty Ko and Robert O'Shea and George G. Coghill and Tom Gedeon}, title = {Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent}, booktitle = {Progress in Connectionist-Based Information Systems: Proceedings of the 1997 International Conference on Neural Information Processing and Intelligent Information Systems, {ICONIP} 1997, Volume I, Dunedin, New Zealand, 24-28 November, 1997}, pages = {531--534}, publisher = {Springer}, year = {1997}, timestamp = {Tue, 25 Aug 2020 09:34:51 +0200}, biburl = {https://dblp.org/rec/conf/iconip/BianchiniFGP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/wae/BattitiP97, author = {Roberto Battiti and Marco Protasi}, editor = {Giuseppe F. Italiano and Salvatore Orlando}, title = {Reactive Local Search for Maximum Clique}, booktitle = {Workshop on Algorithm Engineering, {WAE} '97, Venezia, Italy, September 11-13, 1997. Proceedings}, pages = {74--83}, publisher = {Universit{\`{a}} Ca' Foscari di Venezia}, year = {1997}, timestamp = {Mon, 10 May 2021 14:20:29 +0200}, biburl = {https://dblp.org/rec/conf/wae/BattitiP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tnn/MartinoFP96, author = {M. Di Martino and Stefano Fanelli and Marco Protasi}, title = {Exploring and comparing the best "direct methods" for the efficient training of MLP-networks}, journal = {{IEEE} Trans. Neural Networks}, volume = {7}, number = {6}, pages = {1497--1502}, year = {1996}, url = {https://doi.org/10.1109/72.548177}, doi = {10.1109/72.548177}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tnn/MartinoFP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/dimacs/BattitiP96, author = {Roberto Battiti and Marco Protasi}, editor = {Ding{-}Zhu Du and Jun Gu and Panos M. Pardalos}, title = {Solving {MAX-SAT} with non-oblivious functions and history-based heuristics}, booktitle = {Satisfiability Problem: Theory and Applications, Proceedings of a {DIMACS} Workshop, Piscataway, New Jersey, USA, March 11-13, 1996}, series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science}, volume = {35}, pages = {649--667}, publisher = {{DIMACS/AMS}}, year = {1996}, url = {https://doi.org/10.1090/dimacs/035/19}, doi = {10.1090/DIMACS/035/19}, timestamp = {Mon, 22 May 2023 16:07:35 +0200}, biburl = {https://dblp.org/rec/conf/dimacs/BattitiP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ipl/AusielloP95, author = {Giorgio Ausiello and Marco Protasi}, title = {Local Search, Reducibility and Approximability of NP-Optimization Problems}, journal = {Inf. Process. Lett.}, volume = {54}, number = {2}, pages = {73--79}, year = {1995}, url = {https://doi.org/10.1016/0020-0190(95)00006-X}, doi = {10.1016/0020-0190(95)00006-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AusielloP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tcs/AusielloCP95, author = {Giorgio Ausiello and Pierluigi Crescenzi and Marco Protasi}, title = {Approximate Solution of {NP} Optimization Problems}, journal = {Theor. Comput. Sci.}, volume = {150}, number = {1}, pages = {1--55}, year = {1995}, url = {https://doi.org/10.1016/0304-3975(94)00291-P}, doi = {10.1016/0304-3975(94)00291-P}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AusielloCP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/iandc/KuceraMP94, author = {Ludek Kucera and Alberto Marchetti{-}Spaccamela and Marco Protasi}, title = {On Learning Monotone {DNF} Formulae under Uniform Distributions}, journal = {Inf. Comput.}, volume = {110}, number = {1}, pages = {84--95}, year = {1994}, url = {https://doi.org/10.1006/inco.1994.1024}, doi = {10.1006/INCO.1994.1024}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/KuceraMP94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/bit/GambosiPT93, author = {Giorgio Gambosi and Marco Protasi and Maurizio Talamo}, title = {An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets}, journal = {{BIT}}, volume = {33}, number = {1}, pages = {29--45}, year = {1993}, url = {https://doi.org/10.1007/BF01990341}, doi = {10.1007/BF01990341}, timestamp = {Tue, 22 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bit/GambosiPT93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ita/AngelaccioP93, author = {Michele Angelaccio and Marco Protasi}, title = {Limiting Characterizations of Low Level Space Complexity Classes}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {27}, number = {3}, pages = {175--182}, year = {1993}, url = {https://doi.org/10.1051/ita/1993270301751}, doi = {10.1051/ITA/1993270301751}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/AngelaccioP93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icnn/FanelliMP93, author = {S. Fanelli and M. Di Martino and Marco Protasi}, title = {An efficient algorithm for the binary classification of patterns using MLP-networks}, booktitle = {Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28 - April 1, 1993}, pages = {936--943}, publisher = {{IEEE}}, year = {1993}, url = {https://doi.org/10.1109/ICNN.1993.298683}, doi = {10.1109/ICNN.1993.298683}, timestamp = {Wed, 04 Sep 2019 08:33:25 +0200}, biburl = {https://dblp.org/rec/conf/icnn/FanelliMP93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ijfcs/AusielloP90, author = {Giorgio Ausiello and Marco Protasi}, title = {Limiting Polynomial Approximation of Complexity Classes}, journal = {Int. J. Found. Comput. Sci.}, volume = {1}, number = {2}, pages = {111--122}, year = {1990}, url = {https://doi.org/10.1142/S0129054190000096}, doi = {10.1142/S0129054190000096}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/AusielloP90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tcs/ProtasiT89, author = {Marco Protasi and Maurizio Talamo}, title = {On the Number of Arithmetical Operations for Finding Fibonacci Numbers}, journal = {Theor. Comput. Sci.}, volume = {64}, number = {1}, pages = {119--124}, year = {1989}, url = {https://doi.org/10.1016/0304-3975(89)90102-3}, doi = {10.1016/0304-3975(89)90102-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ProtasiT89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/fct/Marchetti-SpaccamelaP89, author = {Alberto Marchetti{-}Spaccamela and Marco Protasi}, editor = {J{\'{a}}nos Csirik and J{\'{a}}nos Demetrovics and Ferenc G{\'{e}}cseg}, title = {Learning Under Uniform Distribution}, booktitle = {Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {380}, pages = {327--338}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/3-540-51498-8\_32}, doi = {10.1007/3-540-51498-8\_32}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/Marchetti-SpaccamelaP89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/fsttcs/GambosiPT89, author = {Giorgio Gambosi and Marco Protasi and Maurizio Talamo}, editor = {C. E. Veni Madhavan}, title = {An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {405}, pages = {252--266}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/3-540-52048-1\_48}, doi = {10.1007/3-540-52048-1\_48}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/GambosiPT89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icalp/KuceraMP88, author = {Ludek Kucera and Alberto Marchetti{-}Spaccamela and Marco Protasi}, editor = {Timo Lepist{\"{o}} and Arto Salomaa}, title = {On the Learnability of {DNF} Formulae}, booktitle = {Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {317}, pages = {347--361}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-19488-6\_127}, doi = {10.1007/3-540-19488-6\_127}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KuceraMP88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ita/ProtasiT86, author = {Marco Protasi and Maurizio Talamo}, title = {A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {20}, number = {3}, pages = {211--219}, year = {1986}, url = {https://doi.org/10.1051/ita/1986200302111}, doi = {10.1051/ITA/1986200302111}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/ProtasiT86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/mfcs/KuceraMPT86, author = {Ludek Kucera and Alberto Marchetti{-}Spaccamela and Marco Protasi and Maurizio Talamo}, editor = {Jozef Gruska and Branislav Rovan and Juraj Wiedermann}, title = {Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs}, booktitle = {Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {233}, pages = {501--511}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/BFb0016276}, doi = {10.1007/BFB0016276}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/KuceraMPT86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/tapsoft/ProtasiT85, author = {Marco Protasi and Maurizio Talamo}, editor = {Hartmut Ehrig and Christiane Floyd and Maurice Nivat and James W. Thatcher}, title = {On the Maximum Size of Random Trees}, booktitle = {Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Germany, March 25-29, 1985, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85)}, series = {Lecture Notes in Computer Science}, volume = {185}, pages = {139--144}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/3-540-15198-2\_8}, doi = {10.1007/3-540-15198-2\_8}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/ProtasiT85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tcs/Marchetti-SpaccamelaP83, author = {Alberto Marchetti{-}Spaccamela and Marco Protasi}, title = {The Largest Tree in a Random Graph}, journal = {Theor. Comput. Sci.}, volume = {23}, pages = {273--286}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90034-8}, doi = {10.1016/0304-3975(83)90034-8}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Marchetti-SpaccamelaP83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/fct/ProtasiT83, author = {Marco Protasi and Maurizio Talamo}, editor = {Marek Karpinski}, title = {A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems}, booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983}, series = {Lecture Notes in Computer Science}, volume = {158}, pages = {360--367}, publisher = {Springer}, year = {1983}, url = {https://doi.org/10.1007/3-540-12689-9\_118}, doi = {10.1007/3-540-12689-9\_118}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/ProtasiT83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/wg/AusielloPT83, author = {Giorgio Ausiello and Marco Protasi and Maurizio Talamo}, editor = {Manfred Nagl and J{\"{u}}rgen Perl}, title = {Probabilistic Models for Database Schemes and Random Hypergraphs}, booktitle = {Proceedings of the {WG} '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near Osnabr{\"{u}}ck, Germany}, pages = {5--16}, publisher = {Universit{\"{a}}tsverlag Rudolf Trauner, Linz}, year = {1983}, timestamp = {Thu, 12 Mar 2020 11:37:19 +0100}, biburl = {https://dblp.org/rec/conf/wg/AusielloPT83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @proceedings{DBLP:conf/caap/1983, editor = {Giorgio Ausiello and Marco Protasi}, title = {CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {159}, publisher = {Springer}, year = {1983}, url = {https://doi.org/10.1007/3-540-12727-5}, doi = {10.1007/3-540-12727-5}, isbn = {3-540-12727-5}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/1983.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/fuin/AusielloDP81, author = {Giorgio Ausiello and Alessandro D'Atri and Marco Protasi}, title = {Lattice theoretic ordering properties for NP-complete optimization problems}, journal = {Fundam. Informaticae}, volume = {4}, number = {1}, pages = {83--94}, year = {1981}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/AusielloDP81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/caap/AusielloMP81, author = {Giorgio Ausiello and Alberto Marchetti{-}Spaccamela and Marco Protasi}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Full Approximatibility of a Class of Problems over Power Sets}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {76--87}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_55}, doi = {10.1007/3-540-10828-9\_55}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/AusielloMP81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/fct/AusielloMP81, author = {Giorgio Ausiello and Alberto Marchetti{-}Spaccamela and Marco Protasi}, editor = {Ferenc G{\'{e}}cseg}, title = {Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems}, booktitle = {Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981}, series = {Lecture Notes in Computer Science}, volume = {117}, pages = {24--33}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10854-8\_3}, doi = {10.1007/3-540-10854-8\_3}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/AusielloMP81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/jcss/AusielloDP80, author = {Giorgio Ausiello and Alessandro D'Atri and Marco Protasi}, title = {Structure Preserving Reductions among Convex Optimization Problems}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {136--153}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90046-X}, doi = {10.1016/0022-0000(80)90046-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AusielloDP80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tcs/AusielloMP80, author = {Giorgio Ausiello and Alberto Marchetti{-}Spaccamela and Marco Protasi}, title = {Toward a Unified Approach for the Classification of NP-Complete Optimization Problems}, journal = {Theor. Comput. Sci.}, volume = {12}, pages = {83--96}, year = {1980}, url = {https://doi.org/10.1016/0304-3975(80)90006-7}, doi = {10.1016/0304-3975(80)90006-7}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AusielloMP80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icalp/AusielloDP77, author = {Giorgio Ausiello and Alessandro D'Atri and Marco Protasi}, editor = {Arto Salomaa and Magnus Steinby}, title = {On the Structure of Combinatorial Problems and Structure Preserving Reductions}, booktitle = {Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {52}, pages = {45--60}, publisher = {Springer}, year = {1977}, url = {https://doi.org/10.1007/3-540-08342-1\_4}, doi = {10.1007/3-540-08342-1\_4}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AusielloDP77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/mfcs/AusielloDGP77, author = {Giorgio Ausiello and Alessandro D'Atri and Marco Gaudiano and Marco Protasi}, editor = {Jozef Gruska}, title = {Classes of Structurally Isomorphic \{NP\}-Optimization Problems}, booktitle = {Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {53}, pages = {222--230}, publisher = {Springer}, year = {1977}, url = {https://doi.org/10.1007/3-540-08353-7\_139}, doi = {10.1007/3-540-08353-7\_139}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AusielloDGP77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/mfcs/AusielloP75, author = {Giorgio Ausiello and Marco Protasi}, editor = {Jir{\'{\i}} Becv{\'{a}}r}, title = {On the Comparison of Notions of Approximation}, booktitle = {Mathematical Foundations of Computer Science 1975, 4th Symposium, Mari{\'{a}}nsk{\'{e}} L{\'{a}}zne, Czechoslovakia, September 1-5, 1975, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {32}, pages = {172--178}, publisher = {Springer}, year = {1975}, url = {https://doi.org/10.1007/3-540-07389-2\_192}, doi = {10.1007/3-540-07389-2\_192}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AusielloP75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }