|
|
|
| Αλγόριθμοι | ||
|
 |
Δημοσιεύσεις
Δημοσιεύσεις σε ΠεριοδικάI.Z. Emiris and E. Fritzilas and D. Manocha,Algebraic algorithms for conformational analysis and docking Intern. J. Quantum Chemistry, Special Issue on Symbolic algebra in computational chemistry, Wiley , 2006 I.Z. Emiris and T.G. Nikitopoulos, Molecular conformation search by distance matrix perturbations J. Math. Chemistry. Kluwer. , vol 37.3 , pages 233-253 , 2005 I.Z. Emiris and V.Y. Pan, Improved algorithms for computing determinants and resultants J. Complexity. Elsevier. , vol 21.1 , pages 43-71 , 2005 O. Telelis,V. Zissimopoulos, Absolute o(log m) Error in Approximating Random Set Covering: An average Case Analysis Information Processing Letters , vol 94.4 , pages 171-177 , 2005 N. Laoutaris, V. Zissimopoulos, I. Stavrakakis, On the Optimization of Storage Capacity Allocation for Content Distribution Computer Networks , vol 47.3 , pages 409-428 , 2005 I.Z. Emiris and M.I. Karavelas, The predicates of the Apollonius diagram: algorithmic analysis and implementation Comp. Geom.: Theory & Appl., Spec. Issue, , 2005 S. G. Kolliopoulos and C. Stein, Approximating Disjoint-Path Problems using Packing Integer Programs Mathematical Programming , vol 99.A , pages 63-87 , 2004 N. Lautaris, V. Zissimopoulos, I. Stayrakakis, Joint object placement and node dimensioning for Internet content distribution Information Processing Letters , vol 89.6 , pages 273 -279 , 2004 M. Hifi, V. Th. Paschos and V. Zissimopoulos, The circular cutting problem: A simulated annealing approach European Journal of Operations Research 159 , pages 430-448 , 2004 S. A. Paschos, V. Th. Paschos, V. Zissimopoulos, The antennas pre-assignment problem Chaos, Solitons and Fractals 22 , 2004 D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma and J. Wein, Techniques for Scheduling with Rejection J. of Algorithms 49 , pages 175-191 , 2003 S. G. Kolliopoulos, Approximation Algorithms for Covering Integer Programs with Multiplicity Constraints Discrete Applied Mathematics 129 , pages 461-473 , 2003 S. Tsitmidelis, M.V. Koutras, V. Zissimopoulos, Evaluation of reliability bounds by set covering models Statistics and probability letters 61 , pages 163-175 , 2003 A. Dickenstein and I.Z. Emiris, Multihomogeneous resultant formulae via complexes J. Symbolic Computation, Special Issue , vol 36.3-4 , pages 317-342 , 2003 C. D\'Andrea and I.Z. Emiris, Hybrid sparse resultant matrices for bivariate polynomials J. Symbolic Computation , vol 33.5 , pages 587-608 , 2002 D. Daney and I.Z. Emiris, Variable elimination for reliable parallel robot calibration Electr. J. Computat. Kinematics , vol 1.1 , 2002 I.Z. Emiris, Enumerating a subset of the integer points inside a Minkowski sum Comp. Geom: Theory & Applic., Special Issue , vol 22.1-3 , pages 143-166 , 2002 V. Drakopoulos and N. Nikolaou, Efficient computation of several metrics between digitized monochrome images ), Order and Chaos in Nonlinear Dynamical Systems VII , pages 259-274 , 2002 S. G. Kolliopoulos and C. Stein, Approximation Algorithms for Single-Source Unsplittable Flow SIAM J. Computing 31 , pages 919-946 , 2002 E. Angel and V. Zissimopoulos, On the hardness of the Quadratic Assignment problem with meta-heuristics Journal of Heuristics , vol 8.4 , pages 399-414 , 2002 I.Z. Emiris and V.Y. Pan, Symbolic and numeric methods for exploiting structure in constructing resultant matrices J. Symbolic Computation,Elsevier 33 , pages 393-413 , 2002 E. Angel and V. Zissimopoulos, On the landscape ruggedness of the Quadratic Assignment problem Journal of Theoretical Computer Science , vol 263.1-2 , pages 159-172 , 2001 E. Angel and V. Zissimopoulos, On the classification of NP-complete problems in terms of their correlation coefficient DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 99 , pages 261-277 , 2000 M. Hifi, V. Paschos and V. Zissimopoulos, A Boltzmann Machine approach of the set covering problem Chaos, Solitons and Fractals 11 , pages 2079-2089 , 2000 E. Koutsoupias and C. Papadimitriou, Beyond competitive analysis SIAM Journal on Computing , vol 30.1 , pages 300-317 , 2000 J.F. Canny and I.Z. Emiris, A subdivision-based algorithm for the sparse resultant J.ACM , vol 47.3 , pages 417-451 , 2000 A. Le Gall and V. Zissimopoulos, Extended Hopfield models for combinatorial optimization IEEE Transactions on Neural Networks , vol 10.1 , pages 72-80 , 1999 X. Deng, E. Koutsoupias, and P. MacKenzie, Competitive implementation of parallel programs Algorithmica , vol 23.1 , pages 14-30 , 1999 E. Gafni and E. Koutsoupias, Three-processor tasks are undecidable SIAM Journal on Computing , vol 28.3 , pages 970-983 , 1999 H. Brönnimann, I.Z. Emiris, V. Pan, and S. Pion, Sign determination in Residue Number Systems Theoretical Computer Science, Special Issue on Real Numbers and Computers , vol 210.1 , pages 173-197 , 1999 I.Z. Emiris and B. Mourrain, Computer algebra methods for studying and computing molecular conformations Algorithmica, Special Issue on Algorithms for Computational Biology 25 , pages 372-402 , 1999 I.Z. Emiris and B. Mourrain, Matrices in elimination theory J. Symbolic Computation, Special Issue on Variable Elimination 28 , pages 3-44 , 1999 I.Z. Emiris and J. Verschelde, How to count efficiently all affine roots of a polynomial system Discrete Math. And Applications, Special Issue on Computational Geometry , vol 93.1 , pages 21-32 , 1999 E. Angel et V. Zissimopoulos, On the quality of local search for the quadratic assignment problem DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 82 , pages 15-25 , 1998 E. Angel and V. Zissimopoulos, Autocorrelation coefficient for the graph bipartitioning problem with applications to local search Theoretical Computer Science 191 , pages 229-243 , 1998 W. Fernandez de la Vega et V. Zissimopoulos, An Approximation scheme For Strip-Packing of Rectangles With Bounded Dimensions DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 82 , pages 93-101 , 1998 D. Fayard, M. Hifi et V. Zissimopoulos, A general efficient approach for large-scale two-dimensional cutting stock problems Journal of the Operational Research Society , vol 49.12 , pages 1270-1280 , 1998 Modular arithmetic for linear algebra computations in the real field, I.Z. Emiris, V.Y. Pan, and Y. Yu J. Symbolic Computation , vol 26.1 , pages 71-87 , 1998 I.Z. Emiris, A complete implementation for computing general dimensional convex hulls Intern. J. Computational Geometry & Applications, Special Issue on Geometric Software , vol 8.2 , 1998 S. G. Kolliopoulos and C. Stein, Finding Real-Valued Single-Source Shortest Paths in o(n^3) Expected Time J. of Algorithms 28 , pages 125-141 , 1998 Y. Kopidakis et V. Zissimopoulos, An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension Theoretical Computer Science 178 , pages 265-273 , 1997 Y. Kopidakis, M. Lamari and V. Zissimopoulos, On the task assignment problem: two new efficient heuristic algorithms Journal of Parallel and Distributed Computing 42 , pages 21-29 , 1997 M. Hifi et V. Zissimopoulos, Constrained two-dimensional cutting: An improvement of Christofides and Whitlock\'s exact algorithm Journal of the Operational Research Society 48 , pages 324-331 , 1997 I.Z. Emiris, A. Galligo, and H. Lombardi, Certified approximate univariate GCDs J. Pure Applied Algebra, Special Issue on Algorithms for Algebra 117-118 , pages 229-251 , 1997 I.Z. Emiris, J.F. Canny, and R. Seidel, Efficient perturbations for handling geometric degeneracies Algorithmica, Special Issue on Computational Geometry in Manufacturing , vol 19.1/2 , pages 219-242 , 1997 M. Hifi et V. Zissimopoulos, A recursive exact algorithm for weighted two-dimensional cutting European Journal of Operations Research 91 , pages 553-564 , 1996 A. Le Gall and V. Zissimopoulos, A competitive activation neural network model for the weighted minimum vertex covering International Journal of Neural Systems , vol 7.5 , pages 607-616 , 1996 E. Koutsoupias and C. Papadimitriou, The 2-evader problem Information Processing Letters , vol 57.5 , pages 249-252 , 1996 I.Z. Emiris, A. Galligo, and H. Lombardi, Numerical univariate polynomial GCD The Mathematics of Numerical Analysis 32 , pages 323-343 , 1996 I.Z. Emiris, On the complexity of sparse elimination J. Complexity 12 , pages 134-166 , 1996 D. Fayard et V. Zissimopoulos, An approximation Algorithm For Solving Unconstrained Two-Space Knapsack problems European Journal of Operations Research 84 , pages 618-632 , 1995 V. Zissimopoulos, On the performance guarantee of neural networks for NP-hard optimization problems Information Processing Letters 54 , pages 317-322 , 1995 M. Hifi et V. Zissimopoulos, Une Amelioration de lAlgorithme Recursif de Herz pour le Probleme de Decoupe a Deux Dimensions RAIRO, Recherche Operationnelle , vol 30.2 , pages 111-125 , 1995 M. Afif, M. Hifi, V. Paschos et V. Zissimopoulos, A new efficient heuristic for minimum set covering problem Journal of the Operational Research Society 46 , pages 1260-1268 , 1995 E. Koutsoupias and C. Papadimitriou, On the k-server conjecture Journal of the ACM , vol 42.5 , pages 971-983 , 1995 I.Z. Emiris and J.F. Canny, Efficient incremental algorithms for the sparse resultant and the mixed volume J. Symbolic Computation , vol 20.2 , pages 117-149 , 1995 I.Z. Emiris and J.F. Canny, A general approach to removing degeneracies SIAM J. Computing , vol 24.3 , pages 650-664 , 1995 V. Paschos, F. Pekergin et V. Zissimopoulos, Approximating the Optimal Solutions of some Hard Graph Problems by a Boltzmann Machine Belgian Journal of Operations Research, , vol 33.2 , pages 119-132 , 1994 E. Koutsoupias, Improvements on Khrapchenko\'s theorem Theoretical Computer Science , vol 116.2 , pages 399-402 , 1993 V. Zissimopoulos et G. Karagiorgos, Performance Study of a Neural Network Method with Set Partitioning Journal of Chaos, Soliton and Fractals , vol 2.4 , pages 421-435 , 1992 E. Koutsoupias, C. H. Papadimitriou, and M. Sideri, On the optimal bisection of a polygon ORSA Journal on Computing , vol 4.4 , pages 435-438 , 1992 E. Koutsoupias and C. H. Papadimitriou, On the greedy algorithm for satisfiability Information Processing Letters , vol 43.1 , pages 53-55 , 1992 V. Zissimopoulos, V. Paschos et F. Pekergin, On the Approximation of NP-complete Problems by Using Boltzmann Machine Method: The Cases of Some Covering and Packing Problems IEEE Transactions on Computers , vol 40.12 , pages 1413-1419 , 1991 V. Zissimopoulos, Heuristic Methods For Solving (Un)Constrained two Dimensional Cutting Stock Problems Methods of Operations Research 49 , pages 345-357 , 1984 Δημοσιεύσεις που περιλαμβάνονται σε Πρακτικά ΣυνεδρίωνF. Anton, I.Z. Emiris, B. Mourrain, M. Teillaud,The offset to an algebraic curve and an application to conics In Proc. Intern. Conf. Computational Science & Applications (Intern. Workshop Comp. Geometry & Appl.) , pages 683-696 Springer , 2005 Emiris, I.Z. and Tsigaridas, E.P., Real solving of bivariate polynomial systems Proc. Computer Algebra in Scientific Computing (CASC), LNCS , pages 150-161 Springer Verlag , 2005 I.Z. Emiris and K. Zervoudakis, Successive Linear Programs for Computing all Integral Points in a Minkowski Sum Pan-Hellenic Conf. Informatics, LNCS Springer , 2005 S. G. Kolliopoulos and G. Steiner, On minimizing the total weighted tardiness on a single machine Proc. 21st Int. Symposium on Theoretical Aspects of Computer Science (STACS) , pages 176-186 Springer-Verlag LNCS 2996 , 2004 G. Karakostas and S. G. Kolliopoulos, Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users Proc. 45th IEEE Symposium on Foundations of Computer Science (FOCS) , pages 268-276 , 2004 J. Du and S. G. Kolliopoulos, Implementing Approximation Algorithms for Single-Source Unsplittable Flow Proc. 3rd Int. Workshop on Efficient and Experimental Algorithms (WEA) Springer-Verlag LNCS 3059 , pages 213-227 , 2004 D. Daney and I.Z. Emiris, Algebraic elimination for parallel robot calibration. In Proc. 11th IFToMM World Congress on Mechanism & Mach. Science, Tianjin, China , 2004 I.Z. Emiris, A.V. Kakargias, M. Teillaud, E.P. Tsigaridas, and S. Pion, Towards an open curved kernel In Proc. Annual ACM Symp. on Computational Geometry, New York , pages 438-446 ACM Press , 2004 Computing with real algebraic numbers of small degree, I.Z. Emiris and E.P. Tsigaridas In Proc. Europ. Symp. on Algorithms (ESA), LNCS , pages 652-663 Springer Verlag , 2004 M.I. Karavelas and I.Z. Emiris, Root comparison techniques applied to the planar additively weighted Voronoi diagram In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA-03) , pages 320-329 , 2003 I.Z. Emiris and I. Kotsireas, Implicitization with Polynomial Supports Optimized for Sparseness In Proc. Intern. Conf. Computational Science & Applications 2003, (Intern. Workshop Comp. Graphics & Geom. Modelling), Montreal, Canada , pages 397-406 , 2003 A. Dickenstein and I.Z. Emiris, Multihomogeneous resultant matrices In Proc. Annual ACM Intern. Symp. on Symbolic and Algebraic Computation , pages 46-54 ACM Press , 2002 Partially-ordered Knapsack and Applications to Scheduling, S. G. Kolliopoulos and G. Steiner Proc. 10th European Symposium on Algorithms (ESA) , pages 612-624 Springer-Verlag LNCS 2461 , 2002 S. Tsitmidelis, M.V. Koutras, V. Zissimopoulos, An application of the set covering problem to fault tree analysis EUROGEN: Evolutionary Methods for Design, Optimization, and Control with Applications to Industrial Problems , 2001 S. Tsitmidelis, M.V. Koutras, V. Zissimopoulos, Evaluation of reliability bounds by the aid of set covering problem algorith HERCMA: 5th Hellenic European conference on computer mathematics and its applications , 2001 M. Ben Dhaou, D. Fayard and V. Zissimopoulos, Placement de taches communicantes sur des processeurs heterogenes avec minimisation du temps de completu Actes JNPC , pages 953-964 , 2001 C. D\'Andrea and I.Z. Emiris, Computing sparse projection operators In Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering Contemporary Mathematics , pages 121-139 , 2001 D. Daney and I.Z. Emiris, Robust parallel robot calibration with partial information In Proc. IEEE Intern. Conf. Robotics Automation , pages 3262-3267 , 2001 D. Daney and I.Z. Emiris, Variable elimination for reliable parallel robot calibration In 2nd Intern. Workshop on Computational Kinematics , pages 133-144 , 2001 C. D\'Andrea and I.Z. Emiris, Hybrid resultant matrices of bivariate polynomials In Proc. Annual ACM Intern. Symp. on Symbolic and Algebraic Computation , pages 24-31 ACM Press , 2001 K. Zervoudakis and I.Z. Emiris, A comparative application of convex hull algorithms in two and three dimensions In Hellenic-European Conf. Computer Math. & Appl. , pages 494-495 , 2001 S. G. Kolliopoulos and N. E. Young, Tight Approximation Results for General Covering Integer Programs Proc. 42nd IEEE Symp. on Foundations of Computer Science (FOCS) , pages 522-528 , 2001 R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker, Combinatorial optimization in congestion control In Proceedings of the 41th Annual Symposium on Foundations of Computer Science , pages 66-74 , 2000 E. Koutsoupias and D. S. Taylor, The CNN problem and other k-server variants In 17th Annual Symposium on Theoretical Aspects of Computer Science , pages 581-592 , 2000 Y. Bartal and E. Koutsoupias, On the competitive ratio of the work function algorithm for the k-server problem In 17th Annual Symposium on Theoretical Aspects of Computer Science , pages 605-613 , 2000 I.Z. Emiris, Computing integer points in Minkowski sums Proc. ACM Symp. Comp. Geom. , pages 29-36 , 2000 M. W. Goudreau, S. G. Kolliopoulos and S. Rao, Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation Proc. IEEE INFOCOM , pages 1634-1643 , 2000 E. Koutsoupias, Weak adversaries for the k-server problem In Proceedings of the 40th Annual Symposium on Foundations of Computer Science , pages 444-449 , 1999 E. Koutsoupias and C. Papadimitriou, Worst-case equilibria In 16th Annual Symposium on Theoretical Aspects of Computer Science , pages 404-413 , 1999 E. Koutsoupias and D. S. Taylor, Indexing schemes for random points In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 596-602 , 1999 S. G. Kolliopoulos and S. Rao, A Nearly Linear-time Approximation Scheme for the Euclidean k-median problem Proc. 7th European Symposium on Algorithms (ESA) Verlag LNCS 1643 , pages 378-389 Springer-Verlag LNCS , 1999 S. G. Kolliopoulos and C. Stein, Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow Proc. 7th Integer Programming and Combinatorial Optimization (IPCO) Conf. 99 , pages 153-168 , 1999 E. Angel et V. Zissimopoulos, On the ruggedness of the graph bipartitioning problem International Symposium on Combinatorial Optimization (CO98) , 1998 A. Le Gall and V. Zissimopoulos, Adaptability of neural networks for combinatorial optimization International Conference on Intelligent Systems (ICIS-98) , pages 102-105 , 1998 E. Angel et V. Zissimopoulos, On the hardness of some combinatorial optimization problems with local search European Symposium on Operations Research, EURO XVI , 1998 A. Le Gall et V. Zissimopoulos, Solving incrementally task allocation problems European Symposium on Operations Research, EURO XVI , 1998 E. Angel et V. Zissimopoulos, Sur la difficulte du probleme de l affectation quadratique pour les metaheuristiques Premier Congres Franc cais de Recherche Operationnelle , 1998 A. Le Gall et V. Zissimopoulos, Updating incrementaly arborescences in evolutive graphs 4emes Journees sur la resolution Pratique de Problemes NP-complets , pages 27-29 , 1998 E. Angel et V. Zissimopoulos, Une evaluation polynomiale et a priori de la performance des meta-heuristiques pour certains problemes d optimisation combinatoi Sixiemes Journees Du Groupe MODE: Mathematiques de l optimisation et de la decision , 1998 A. Le Gall et V. Zissimopoulos, Resolution incrementale du probleme de placement de taches 2emes Journees de Recherche sur Le Placement Dynamique et la Repartition de Charge (JRPRC) , 1998 E. Koutsoupias and D. S. Taylor, Tight bounds for 2-dimensional indexing schemes In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems , 1998 A. Wallack, I.Z. Emiris, and D. Manocha, MARS: A Maple/Matlab/C resultant-based solver In Proc. ACM Intern. Symp. on Symbolic and Algebraic Computation , pages 244-251 , 1998 E. Angel et V. Zissimopoulos, Towards a classification of combinatorial optimization problems relatively to their difficulty for generalized local search algorithms 5th TWENTE Workshop on graphs and combinatorial optimization , 1997 E. Angel et V. Zissimopoulos, On the landscape ruggedness and local search solvability of quadratic assignment problem International Workshop on Combinatorics and Computer science, LIX-CNR , 1997 On the quality of local search for the quadratic assignment problem, E. Angel et V. Zissimopoulos International Symposium on Mathematical Programming , 1997 E. Angel et V. Zissimopoulos, Recherche locale pour l affectation quadratique Cinquiemes Journees Du Groupe MODE: Mathematiques de l optimisation et de la decision , 1997 J. M. Hellerstein, E. Koutsoupias, and C. H. Papadimitriou, On the Analysis of Indexing Schemes In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems , pages 249-256 , 1997 H. Brönnimann, I.Z. Emiris, V. Pan, and S. Pion, Computing exact geometric predicates using modular arithmetic with single precision In Proc. ACM Symp. on Computational Geometry , pages 174-182 , 1997 I.Z. Emiris and V.Y. Pan, The structure of sparse resultant matrices. In Proc. ACM Intern. Symp. on Symbolic and Algebraic Computation, Maui, Hawaii , pages 189-196 , 1997 Y. Kopidakis, D. Fayard and V. Zissimopoulos, Linear time approximation schemes for parallel processor scheduling Eighth IEEE Symposium on Parallel and Distributed Processing (SPDP\'96) , pages 482-485 , 1996 Y. Kopidakis et V. Zissimopoulos, An approximation scheme for scheduling on the hypercube using the strip-packing model International Symposium on Combinatorial Optimization (CO96) , 1996 Y. Kopidakis et V. Zissimopoulos, Task allocation for load balancing in heterogeneous distributed systems IFORS , 1996 E. Koutsoupias, C. Papadimitriou, and M. Yannakakis, Searching a fixed graph In International Colloquium on Automata, Languages, and Programming , pages 280-289 , 1996 A. Le Gall et V. Zissimopoulos, Resolution de probemes d Optimisation combinatoire par une methode neuronale d activation competitive FRANCORO , 1995 Y. Kopidakis, M. Lamari et V. Zissimopoulos, Heuristiques pour le probleme d allocation de taches dans les systemes distribues: une etude comparative FRANCORO , 1995 M. Grigni, E. Koutsoupias, and C. Papadimitriou, An approximation scheme for planar graph TSP In Proceedings of the 36th Annual Symposium on Foundations of Computer Science , pages 640-645 , 1995 Massively Parallel Algorithms for Combinatorial Optimization Problems , D. Fayard et V. Zissimopoulos EURO XIII/OR 36 , 1994 R. Charpentier, M. Lamari et V. Zissimopoulos, Genetic and Neural Network Algorithms for the 3-Satisfiability Problem EURO XIII/OR 36 , 1994 I.Z. Emiris and A. Rege, Monomial bases and polynomial system solving In Proc. ACM Inern. Symp. on Symbolic and Algebraic Computation , pages 114-122 Oxford , 1994 V. Zissimopoulos, Methodes Neuronales pour des problemes d Optimisation Combinatoire Journee d Enseignement de la Recherche Operationnelle,AFCET , 1993 J. Canny and I. Emiris, An efficient algorithm for the sparse mixed resultant Proc. Intern. Symp. on Applied Algebra, Algebraic Algor. and Error-Corr. Codes Lect. Notes in Comp. Science , pages 89-104 Springer , 1993 Ι.Ζ. Emiris and J. Canny, A practical method for the sparse resultant Proc. ACM Intern. Symp. on Symbolic and Algebraic Computation , pages 183-192 , 1993 D. Fayard et V. Zissimopoulos, An approximation Algorithm For Solving Unconstrained Two-Space Knapsack problems Joint Intern. Conf. Opern. Res. and Manag. Sci. EURO XII/TIMS XXXI , 1992 V. Paschos, F. Pekergin et V. Zissimopoulos, Solving Vertex Cover and Independent Set Problem by a Boltzmann Machine European Joint Conference on Engineering Systems Design and Analysis(ESDA) , 1992 I.Emiris and J. Canny, An efficient approach to removing geometric degeneracies In Proc. ACM Symp. on Computational Geometry , pages 74-82 , 1992 V. Zissimopoulos, V. Paschos et F. Pekergin, On the Approximation of NP-complete Problems by Using Boltzmann Machine Method. The Cases of Some Covering and Packing Problems Intern. Conf. on Novel Methods In Optimization , 1991 V. Zissimopoulos et G. Karagiorgos, A Neural Network Approach for Solving Set Partitioning Problems 3rd Symposium of Computer Sciences , pages 352-368 , 1991 I.Z. Emiris and J.F. Canny, A general approach to removing degeneracies In Proc. 32nd IEEE Symp. on Foundations of Comp. Sci. , pages 405-413 , 1991 A. Stafilopatis et V. Zissimopoulos, On Discrete Nonlinear Associative Memories Proc. of 4th International Symposium on Computer and Information Sciences, ISC , pages 625-634 , 1989 V. Zissimopoulos, Heuristic Methods For Solving (Un)Constrained two Dimensional Cutting Stock Problems 9th Symposium of Operations Research , 1984 Δημοσίευση ΒιβλίωνΑ. Dickenstein and I.Z. Emiris,Solving Polynomial Equations: Foundations, Algorithms and Applications, volume 14 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin , 2005 I.Z. Emiris, B. Mourrain, and V. Pan, Special Issue on Algebraic and Numerical Algorithms, volume 315(2-3):307-672 Elsevier , 2004 Δημοσιεύσεις που περιλαμβάνονται σε ΒιβλίαI.Z. Emiris,Sparse resultant and applications to geometric modelling In A. Dickenstein and I.Z. Emiris, editors, Solving Polynomial Equations: Foundations, Algorithms and Applications volume 14 of Algorithms and Computation in Mathematics, Springer-Verlag, Berlin , 2005 Emiris, I.Z. and Tsigaridas, E.P., Minkowski decomposition of convex lattice polygons Algebraic geometry and geometric modeling, M. Elkadi and B. Mourrain and R. Piene, eds. Springer-Verlag , 2005 I.Z. Emiris and I.S. Kotsireas, Implicitization exploiting Sparseness In: Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, R. Janardan, M. Smid and D. Dutta, eds 67 AMS/DIMACS series , 2005 E. Angel, P. Christopoulos, V. Zissimopoulos, La Recherche Locale Optimisation Combinatoire: Concepts fondamentaux 17 HERMES , 2005 I.Z. Emiris, Discrete geometry for algebraic elimination M. Joswig and N. Takayama, editors, Algebra, Geometry, and Software System, Mathematics and Visualization Springer-Verlag, Berlin , 2002 C. D'Andrea and I.Z. Emiris, Sparse resultant perturbations M. Joswig and N. Takayama, editors, Algebra, Geometry, and Software Systems Mathematics and Visualization. Springer-Verlag , 2002 S. Tsitmidelis, M.V. Koutras, V. Zissimopoulos, Fault Tree Analysis via Set Cover Model CIMNE: A Series of Handbooks on Theory and Engineering Applications of Computational Methods . . , 2002 I.Z. Emiris, Matrix methods for solving algebraic systems G. Alefeld, J. Rohn, S. Rump, and T. Yamamoto, eds. Symbolic algebraic methods and verification methods Springer, Wien , 2001 I.Z. Emiris and V.Y. Pan., Applications of FFT M. Atallah, editor, Handbook of Algorithms and Theory of Computation 17 CRC Press, Boca Raton, Florida , 1999 A. Díaz, I.Z. Emiris, E. Kaltofen, and V.Y. Pan, Algebraic algorithms M. Atallah, editor, Handbook of Algorithms and Theory of Computation 16 CRC Press, Boca Raton, Florida , 1999 I.Z. Emiris, Symbolic-numeric algebra for polynomials A. Kent and J.G. Williams, executive editors, Encyclopedia of Computer Science and Technology, volume 39, supplement 24 Marcel Dekker, New York , 1998
|
||||||
|
|||||||
![]](../images/rdcorner.gif){kind=small}