@Preamble{ { \newcommand{\bibremark}[1]{\marginpar{\tiny\bf#1}} \newcommand{\biburl}[1]{\url{#1}} } } % % Preamble{ { % \newcommand{\bibremark}[1]{} % \newcommand{\biburl}[1]{\url{#1}} % } } % % Note that the \url command requires the url or the hyperref package. % If none of these packages is available, use one of the the following % lines instead. % \newcommand{\biburl}[1]{\texttt{#1}} % \newcommand{\biburl}[1]{#1} % % Preamble{ {BibTeX file by Michael Dom. } # {\newcommand{\noopsort}[1]{}} } % ---------------------------------------------------------------------- % Rules for this file: % % * Names of conferences, journals, publishers, series, and % institutions (schools) have to be defined as strings. % * If, for any reason, the name of a conference, a journal, a publisher, % a series, or an institution (school) is not defined as a string, but is used % in the field of an entry, it has to be marked with \bibremark{No string.}. % * If an abbreviation of the name of a conference, a journal, a publisher, % a series, or an institution (school) exists, the % long and the abbreviated version both have to be defined as strings. % * Standard abbreviations should be used for the string names of jounals. % * Only use standard abbreviations. No imaginary abbreviations, please! % * Entries without publisher are marked with \bibremark{No publisher.}. % * Wehe dem, der sich nicht an diese Regeln haelt! % * By changing the preamble (above), one can suppress the output of the % command \bibremark{...}. % * Rules for names of persons: see below. % * Keys of entries consist of the initials of the authors and the % year (two digits). If necessary, the first three letters of the % first author that distinguishes two entries are included into the key, % or the abbreviation of the conference/journal/... is appended after % the year. % * If a key is changed, the old key is preserved as a comment above the entry: % "old key: ..." % * The sorting order of the entries is year descending, key ascending. % ---------------------------------------------------------------------- % How to manipulate name fields: % % Lastone{ }Lasttwo, Michael % Result: Last part consisting of one name % Michael Lastone{-}Lasttwo % Result: Last part consisting of one name % Weide, Michael von der ganz hohen % Result: no von part, First part % % consisting of five names % % (this method is not used in this file) % % In this file, the Last part and the von part of every person consist of % at most one name each (due to the usage of { } and {-}, % for example Michael von{ }der{ }ganz{ }hohen Weide). % Entries containing a person whose Last part contains { } or {-} or % whose von part is not empty are marked with a "difficult name" comment. % ---------------------------------------------------------------------- % By the way: Comments do not have to be marked by "%". (The only purpose % of the "%"s here is to support the syntax highlighting of Emacs.) % BibTeX interprets everything without the "at"-symbol that stands outside % an entry as a comment. % The command "#" concatenates two strings. % ---------------------------------------------------------------------- % String definitions: @string{proc-aaim-08-long = {Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM~'08)}} @string{proc-acid-05-long = {Proceedings of the 1st Algorithms and Complexity in Durham (ACiD~'05) Workshop}} @string{proc-acid-06-long = {Proceedings of the 2nd Algorithms and Complexity in Durham (ACiD~'06) Workshop}} @string{proc-acid-07-long = {Proceedings of the 3rd Algorithms and Complexity in Durham (ACiD~'07) Workshop}} @string{proc-adhocnow-04-long = {Proceedings of the 3rd International Conference on AD-HOC Networks~{\&} Wireless (ADHOC-NOW~'04)}} @string{proc-alenex-04-long = {Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX~'04)}} @string{proc-alenex-05-long = {Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX~'05)}} @string{proc-alenex-06-long = {Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX~'06)}} @string{proc-apbc-07-long = {Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC~'07)}} @string{proc-apbc-08-long = {Proceedings of the 6th Asia-Pacific Bioinformatics Conference (APBC~'08)}} @string{proc-approx-98-long = {Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX~'98)}} @string{proc-approx-00-long = {Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX~'00)}} @string{proc-approx-02-long = {Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX~'02)}} @string{proc-approx-04-long = {Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX~'04)}} @string{proc-approx-random-04-long = {Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX~'04) and the 8th International Workshop on Randomization and Approximation Techniques (RANDOM~'04)}} @string{proc-approx-06-long = {Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX~'06)}} @string{proc-atmos-05-long = {Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS~'05)}} @string{proc-aussois-01-long = {Proceedings of the 5th International Workshop on Combinatorial Optimization---``{E}ureka, You Shrink!'' (Aussois~'01)}} @string{proc-cats-08-long = {Proceedings of the 14th Computing: The Australasian Theory Symposium (CATS~'08)}} @string{proc-ccc-03-long = {Proceedings of the 18th IEEE Annual Conference on Computational Complexity (CCC~'03)}} @string{proc-cccg-97-long = {Proceedings of the 9th Canadian Conference on Computational Geometry (CCCG~'97)}} @string{proc-ciac-94-long = {Proceedings of the 2nd Italian Conference on Algorithms and Complexity (CIAC~'94)}} @string{proc-ciac-97-long = {Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC~'97)}} @string{proc-ciac-00-long = {Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC~'00)}} @string{proc-ciac-03-long = {Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC~'03)}} @string{proc-ciac-06-long = {Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC~'06)}} @string{proc-cocoa-08-long = {Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA~'08)}} @string{proc-cocoon-97-long = {Proceedings of the 3rd Annual International Computing and Combinatorics Conference (COCOON~'97)}} @string{proc-cocoon-98-long = {Proceedings of the 4th Annual International Computing and Combinatorics Conference (COCOON~'98)}} @string{proc-cocoon-99-long = {Proceedings of the 5th Annual International Computing and Combinatorics Conference (COCOON~'99)}} @string{proc-cocoon-00-long = {Proceedings of the 6th Annual International Computing and Combinatorics Conference (COCOON~'00)}} @string{proc-cocoon-01-long = {Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON~'01)}} @string{proc-cocoon-02-long = {Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON~'02)}} @string{proc-cocoon-03-long = {Proceedings of the 9th Annual International Computing and Combinatorics Conference (COCOON~'03)}} @string{proc-cocoon-04-long = {Proceedings of the 10th Annual International Computing and Combinatorics Conference (COCOON~'04)}} @string{proc-cocoon-05-long = {Proceedings of the 11th Annual International Computing and Combinatorics Conference (COCOON~'05)}} @string{proc-cocoon-06-long = {Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON~'06)}} @string{proc-cocoon-07-long = {Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON~'07)}} @string{proc-csr-06-long = {Proceedings of the International Computer Science Symposium in Russia (CSR~'06)}} @string{proc-disc-99-long = {Proceedings of the 13th International Symposium on Distributed Computing (DISC~'99)}} @string{proc-disc-04-long = {Proceedings of the 18th International Conference on Distributed Computing (DISC~'04)}} @string{proc-disc-05-long = {Proceedings of the 19th International Symposium on Distributed Computing (DISC~'05)}} @string{proc-disc-06-long = {Proceedings of the 20th International Symposium on Distributed Computing (DISC~'06)}} @string{proc-esa-93-long = {Proceedings of the 1st Annual European Symposium on Algorithms (ESA~'93)}} @string{proc-esa-94-long = {Proceedings of the 2nd Annual European Symposium on Algorithms (ESA~'94)}} @string{proc-esa-95-long = {Proceedings of the 3rd Annual European Symposium on Algorithms (ESA~'95)}} @string{proc-esa-96-long = {Proceedings of the 4th Annual European Symposium on Algorithms (ESA~'96)}} @string{proc-esa-97-long = {Proceedings of the 5th Annual European Symposium on Algorithms (ESA~'97)}} @string{proc-esa-98-long = {Proceedings of the 6th Annual European Symposium on Algorithms (ESA~'98)}} @string{proc-esa-99-long = {Proceedings of the 7th Annual European Symposium on Algorithms (ESA~'99)}} @string{proc-esa-00-long = {Proceedings of the 8th Annual European Symposium on Algorithms (ESA~'00)}} @string{proc-esa-01-long = {Proceedings of the 9th Annual European Symposium on Algorithms (ESA~'01)}} @string{proc-esa-02-long = {Proceedings of the 10th Annual European Symposium on Algorithms (ESA~'02)}} @string{proc-esa-03-long = {Proceedings of the 11th Annual European Symposium on Algorithms (ESA~'03)}} @string{proc-esa-04-long = {Proceedings of the 12th Annual European Symposium on Algorithms (ESA~'04)}} @string{proc-esa-05-long = {Proceedings of the 13th Annual European Symposium on Algorithms (ESA~'05)}} @string{proc-esa-06-long = {Proceedings of the 14th Annual European Symposium on Algorithms (ESA~'06)}} @string{proc-escape-07-long = {Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE~'07)}} @string{proc-eurocg-09-long = {Proceedings of the 25th European Workshop on Computational Geometry (EuroCG~'09)}} @string{proc-faw-07-long = {Proceedings of the 1st International Frontiers of Algorithmics Workshop (FAW~'07)}} @string{proc-faw-08-long = {Proceedings of the 2nd International Frontiers of Algorithmics Workshop (FAW~'08)}} @string{proc-fct-03-long = {Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT~'03)}} @string{proc-fct-05-long = {Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT~'05)}} @string{proc-fct-07-long = {Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT~'07)}} @string{proc-focs-86-long = {Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'86)}} @string{proc-focs-87-long = {Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'87)}} @string{proc-focs-88-long = {Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'88)}} @string{proc-focs-89-long = {Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'89)}} @string{proc-focs-90-long = {Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS~'90)}} @string{proc-focs-91-long = {Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS~'91)}} @string{proc-focs-92-long = {Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS~'92)}} @string{proc-focs-93-long = {Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'93)}} @string{proc-focs-94-long = {Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'94)}} @string{proc-focs-95-long = {Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'95)}} @string{proc-focs-96-long = {Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'96)}} @string{proc-focs-97-long = {Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'97)}} @string{proc-focs-98-long = {Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'98)}} @string{proc-focs-99-long = {Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'99)}} @string{proc-focs-00-long = {Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS~'00)}} @string{proc-focs-01-long = {Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS~'01)}} @string{proc-focs-02-long = {Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS~'02)}} @string{proc-focs-03-long = {Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'03)}} @string{proc-focs-04-long = {Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'04)}} @string{proc-focs-05-long = {Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'05)}} @string{proc-focs-06-long = {Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'06)}} @string{proc-focs-07-long = {Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'07)}} @string{proc-focs-08-long = {Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'08)}} @string{proc-fsttcs-97-long = {Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS~'97)}} @string{proc-fsttcs-01-long = {Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS~'01)}} @string{proc-fsttcs-02-long = {Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS~'02)}} @string{proc-fsttcs-03-long = {Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS~'03)}} @string{proc-fsttcs-04-long = {Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS~'04)}} @string{proc-fsttcs-07-long = {Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS~'07)}} @string{proc-gd-03-long = {Proceedings of the 11th International Symposium on Graph Drawing (GD~'03)}} @string{proc-icalp-91-long = {Proceedings of the 18th International Colloquium on Automata, Languages, and Programming (ICALP~'91)}} @string{proc-icalp-92-long = {Proceedings of the 19th International Colloquium on Automata, Languages, and Programming (ICALP~'92)}} @string{proc-icalp-93-long = {Proceedings of the 20st International Colloquium on Automata, Languages, and Programming (ICALP~'93)}} @string{proc-icalp-94-long = {Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (ICALP~'94)}} @string{proc-icalp-95-long = {Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP~'95)}} @string{proc-icalp-96-long = {Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP~'96)}} @string{proc-icalp-97-long = {Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP~'97)}} @string{proc-icalp-98-long = {Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP~'98)}} @string{proc-icalp-99-long = {Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP~'99)}} @string{proc-icalp-00-long = {Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP~'00)}} @string{proc-icalp-01-long = {Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP~'01)}} @string{proc-icalp-02-long = {Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP~'02)}} @string{proc-icalp-03-long = {Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP~'03)}} @string{proc-icalp-04-long = {Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP~'04)}} @string{proc-icalp-05-long = {Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP~'05)}} @string{proc-icalp-06-long = {Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP~'06)}} @string{proc-icalp-07-long = {Proceedings of the 34th International Colloquium on Automata, Languages, and Programming (ICALP~'07)}} @string{proc-icalp-08-long = {Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP~'08)}} @string{proc-icalp-09-long = {Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP~'09)}} @string{proc-ictcs-05-long = {Proceedings of the 9th Italian Conference on Theoretical Computer Science (ICTCS~'05)}} @string{proc-ipco-98-long = {Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization (IPCO~'98)}} @string{proc-ipco-07-long = {Proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO~'07)}} @string{proc-isaac-92-long = {Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC~'92)}} @string{proc-isaac-99-long = {Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC~'99)}} @string{proc-isaac-00-long = {Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC~'00)}} @string{proc-isaac-01-long = {Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC~'01)}} @string{proc-isaac-02-long = {Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC~'02)}} @string{proc-isaac-03-long = {Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC~'03)}} @string{proc-isaac-04-long = {Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC~'04)}} @string{proc-isaac-05-long = {Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC~'05)}} @string{proc-isaac-06-long = {Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC~'06)}} @string{proc-isaac-07-long = {Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC~'07)}} @string{proc-issac-97-long = {Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC~'97)}} @string{proc-istcs-96-long = {Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems (ISTCS~'96)}} @string{proc-iwpec-04-long = {Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC~'04)}} @string{proc-iwpec-06-long = {Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC~'06)}} @string{proc-iwpec-08-long = {Proceedings of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC~'08)}} @string{proc-latin-98-long = {Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN~'98)}} @string{proc-latin-00-long = {Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN~'00)}} @string{proc-latin-02-long = {Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN~'02)}} @string{proc-latin-04-long = {Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN~'04)}} @string{proc-latin-06-long = {Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN~'06)}} @string{proc-latin-08-long = {Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN~'08)}} @string{proc-mfcs-97-long = {Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS~'97)}} @string{proc-mfcs-01-long = {Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS~'01)}} @string{proc-mfcs-02-long = {Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS~'02)}} @string{proc-mfcs-03-long = {Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS~'03)}} @string{proc-mfcs-04-long = {Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS~'04)}} @string{proc-mfcs-05-long = {Proceedings of the 30st International Symposium on Mathematical Foundations of Computer Science (MFCS~'05)}} @string{proc-mfcs-06-long = {Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS~'06)}} @string{proc-mfcs-07-long = {Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS~'07)}} @string{proc-mfcs-08-long = {Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS~'08)}} @string{proc-podc-86-long = {Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing (PODC~'86)}} @string{proc-podc-95-long = {Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC~'95)}} @string{proc-podc-96-long = {Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC~'96)}} @string{proc-podc-97-long = {Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC~'97)}} @string{proc-podc-98-long = {Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC~'98)}} @string{proc-podc-00-long = {Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC~'00)}} @string{proc-podc-01-long = {Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC~'01)}} @string{proc-podc-02-long = {Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC~'02)}} @string{proc-podc-03-long = {Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC~'03)}} @string{proc-podc-04-long = {Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC~'04)}} @string{proc-podc-05-long = {Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC~'05)}} @string{proc-podc-06-long = {Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC~'06)}} @string{proc-random-02-long = {Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM~'02)}} @string{proc-random-04-long = {Proceedings of the 8th International Workshop on Randomization and Approximation Techniques (RANDOM~'04)}} @string{proc-sac-08-long = {Proceedings of the 23rd ACM Symposium on Applied Computing (SAC~'08)}} @string{proc-sirocco-94-long = {Proceedings of the 1st International Colloquium on Structural Information and Communication Complexity (SIROCCO~'94)}} @string{proc-sirocco-95-long = {Proceedings of the 2nd International Colloquium on Structural Information and Communication Complexity (SIROCCO~'95)}} @string{proc-sirocco-96-long = {Proceedings of the 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO~'96)}} @string{proc-sirocco-97-long = {Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO~'97)}} @string{proc-sirocco-05-long = {Proceedings of the 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO~'05)}} @string{proc-sirocco-06-long = {Proceedings of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO~'06)}} @string{proc-socg-96-long = {Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG~'96)}} @string{proc-soda-90-long = {Proceedings of the 1st Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'90)}} @string{proc-soda-91-long = {Proceedings of the 2nd Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'91)}} @string{proc-soda-92-long = {Proceedings of the 3rd Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'92)}} @string{proc-soda-93-long = {Proceedings of the 4th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'93)}} @string{proc-soda-94-long = {Proceedings of the 5th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'94)}} @string{proc-soda-95-long = {Proceedings of the 6th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'95)}} @string{proc-soda-96-long = {Proceedings of the 7th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'96)}} @string{proc-soda-97-long = {Proceedings of the 8th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'97)}} @string{proc-soda-98-long = {Proceedings of the 9th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'98)}} @string{proc-soda-99-long = {Proceedings of the 10th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'99)}} @string{proc-soda-00-long = {Proceedings of the 11th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'00)}} @string{proc-soda-01-long = {Proceedings of the 12th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'01)}} @string{proc-soda-02-long = {Proceedings of the 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'02)}} @string{proc-soda-03-long = {Proceedings of the 14th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'03)}} @string{proc-soda-04-long = {Proceedings of the 15th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'04)}} @string{proc-soda-04-it-long = {\textit{Proceedings of the 15th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'04)}}} @string{proc-soda-05-long = {Proceedings of the 16th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'05)}} @string{proc-soda-06-long = {Proceedings of the 17th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'06)}} @string{proc-soda-07-long = {Proceedings of the 18th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'07)}} @string{proc-soda-08-long = {Proceedings of the 19th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'08)}} @string{proc-soda-09-long = {Proceedings of the 20th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA~'09)}} @string{proc-sofsem-97-long = {Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM~'97)}} @string{proc-sofsem-98-long = {Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM~'98)}} @string{proc-sofsem-05-long = {Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM~'05)}} @string{proc-sofsem-06-long = {Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM~'06)}} @string{proc-sofsem-07-long = {Proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM~'07)}} @string{proc-sofsem-08-long = {Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM~'08)}} @string{proc-spaa-01-long = {Proceedings of the 13th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA~'01)}} @string{proc-spaa-02-long = {Proceedings of the 14th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA~'02)}} @string{proc-spaa-03-long = {Proceedings of the 15th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA~'03)}} @string{proc-spaa-04-long = {Proceedings of the 16th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA~'04)}} @string{proc-spaa-05-long = {Proceedings of the 17th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA~'05)}} @string{proc-spaa-06-long = {Proceedings of the 18th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA~'06)}} @string{proc-stacs-94-long = {Proceedings of the 11th International Symposium on Theoretical Aspects of Computer Science (STACS~'94)}} @string{proc-stacs-99-long = {Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS~'99)}} @string{proc-stacs-00-long = {Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (STACS~'00)}} @string{proc-stacs-01-long = {Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science (STACS~'01)}} @string{proc-stacs-02-long = {Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS~'02)}} @string{proc-stacs-03-long = {Proceedings of the 20st International Symposium on Theoretical Aspects of Computer Science (STACS~'03)}} @string{proc-stacs-04-long = {Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS~'04)}} @string{proc-stacs-05-long = {Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS~'05)}} @string{proc-stacs-06-long = {Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS~'06)}} @string{proc-stacs-07-long = {Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS~'07)}} @string{proc-stoc-71-long = {Proceedings of the 3rd Annual {ACM} Symposium on Theory of Computing (STOC~'71)}} @string{proc-stoc-74-long = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing (STOC~'74)}} @string{proc-stoc-75-long = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing (STOC~'75)}} @string{proc-stoc-76-long = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing (STOC~'76)}} @string{proc-stoc-77-long = {Proceedings of the 9th Annual {ACM} Symposium on Theory of Computing (STOC~'77)}} @string{proc-stoc-78-long = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing (STOC~'78)}} @string{proc-stoc-82-long = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing (STOC~'82)}} @string{proc-stoc-83-long = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing (STOC~'83)}} @string{proc-stoc-84-long = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing (STOC~'84)}} @string{proc-stoc-85-long = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing (STOC~'85)}} @string{proc-stoc-86-long = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing (STOC~'86)}} @string{proc-stoc-87-long = {Proceedings of the 19th Annual {ACM} Symposium on Theory of Computing (STOC~'87)}} @string{proc-stoc-88-long = {Proceedings of the 20st Annual {ACM} Symposium on Theory of Computing (STOC~'88)}} @string{proc-stoc-89-long = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing (STOC~'89)}} @string{proc-stoc-90-long = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing (STOC~'90)}} @string{proc-stoc-91-long = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing (STOC~'91)}} @string{proc-stoc-92-long = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing (STOC~'92)}} @string{proc-stoc-93-long = {Proceedings of the 25th Annual {ACM} Symposium on Theory of Computing (STOC~'93)}} @string{proc-stoc-94-long = {Proceedings of the 26th Annual {ACM} Symposium on Theory of Computing (STOC~'94)}} @string{proc-stoc-95-long = {Proceedings of the 27th Annual {ACM} Symposium on Theory of Computing (STOC~'95)}} @string{proc-stoc-96-long = {Proceedings of the 28th Annual {ACM} Symposium on Theory of Computing (STOC~'96)}} @string{proc-stoc-97-long = {Proceedings of the 29th Annual {ACM} Symposium on Theory of Computing (STOC~'97)}} @string{proc-stoc-98-long = {Proceedings of the 30st Annual {ACM} Symposium on Theory of Computing (STOC~'98)}} @string{proc-stoc-99-long = {Proceedings of the 31st Annual {ACM} Symposium on Theory of Computing (STOC~'99)}} @string{proc-stoc-00-long = {Proceedings of the 32nd Annual {ACM} Symposium on Theory of Computing (STOC~'00)}} @string{proc-stoc-01-long = {Proceedings of the 33rd Annual {ACM} Symposium on Theory of Computing (STOC~'01)}} @string{proc-stoc-02-long = {Proceedings of the 34th Annual {ACM} Symposium on Theory of Computing (STOC~'02)}} @string{proc-stoc-03-long = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing (STOC~'03)}} @string{proc-stoc-04-long = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing (STOC~'04)}} @string{proc-stoc-05-long = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing (STOC~'05)}} @string{proc-stoc-06-long = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing (STOC~'06)}} @string{proc-stoc-07-long = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing (STOC~'07)}} @string{proc-stoc-08-long = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing (STOC~'08)}} @string{proc-swat-00-long = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT~'00)}} @string{proc-swat-02-long = {Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT~'02)}} @string{proc-swat-04-long = {Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT~'04)}} @string{proc-swat-06-long = {Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT~'06)}} @string{proc-swat-06-it-long = {\textit{Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT~'06)}}} @string{proc-tamc-07-long = {Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC~'07)}} @string{proc-tamc-08-long = {Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC~'08)}} @string{proc-uai-94-long = {Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI~'94)}} @string{proc-wads-93-long = {Proceedings of the 3rd International Workshop on Algorithms and Data Structures (WADS~'93)}} @string{proc-wads-01-long = {Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS~'01)}} @string{proc-wads-03-long = {Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS~'03)}} @string{proc-wads-05-long = {Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS~'05)}} @string{proc-wads-07-long = {Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS~'07)}} @string{proc-walcom-09-long = {Proceedings of the 3rd International Workshop on Algorithms and Computation (WALCOM~'09)}} @string{proc-waoa-07-long = {Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA~'07)}} @string{proc-wea-03-long = {Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA~'03)}} @string{proc-wea-04-long = {Proceedings of the 3rd International Workshop on Experimental and Efficient Algorithms (WEA~'04)}} @string{proc-wea-05-long = {Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA~'05)}} @string{proc-wea-06-long = {Proceedings of the 5th International Workshop on Experimental and Efficient Algorithms (WEA~'06)}} @string{proc-wea-07-long = {Proceedings of the 6th International Workshop on Experimental and Efficient Algorithms (WEA~'07)}} @string{proc-wg-81-long = {Proceedings of the 7th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'81)}} @string{proc-wg-89-long = {Proceedings of the 15th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'89)}} @string{proc-wg-90-long = {Proceedings of the 16th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'90)}} @string{proc-wg-91-long = {Proceedings of the 17th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'91)}} @string{proc-wg-92-long = {Proceedings of the 18th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'92)}} @string{proc-wg-99-long = {Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG~'99)}} @string{proc-wg-00-long = {Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG~'00)}} @string{proc-wg-01-long = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG~'01)}} @string{proc-wg-02-long = {Proceedings of the 28th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'02)}} @string{proc-wg-03-long = {Proceedings of the 29th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'03)}} @string{proc-wg-04-long = {Proceedings of the 30th International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'04)}} @string{proc-wg-05-long = {Proceedings of the 31st International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'05)}} @string{proc-wg-06-long = {Proceedings of the 32nd International Workshop on Graph-Theoretic Conecpts in Computer Science (WG~'06)}} @string{proc-wg-07-long = {Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG~'07)}} @string{proc-aaim-08-short = {Proc.\ 4th AAIM}} @string{proc-acid-05-short = {Proc.\ 1st ACiD}} @string{proc-acid-06-short = {Proc.\ 2nd ACiD}} @string{proc-acid-07-short = {Proc.\ 3rd ACiD}} @string{proc-adhocnow-04-short = {Proc.\ 3rd ADHOC-NOW}} @string{proc-alenex-04-short = {Proc.\ 6th ALENEX}} @string{proc-alenex-05-short = {Proc.\ 7th ALENEX}} @string{proc-alenex-06-short = {Proc.\ 8th ALENEX}} @string{proc-apbc-07-short = {Proc.\ 5th APBC}} @string{proc-apbc-08-short = {Proc.\ 6th APBC}} @string{proc-approx-98-short = {Proc.\ 1st APPROX}} @string{proc-approx-00-short = {Proc.\ 3rd APPROX}} @string{proc-approx-02-short = {Proc.\ 5th APPROX}} @string{proc-approx-04-short = {Proc.\ 7th APPROX}} @string{proc-approx-random-04-short = {Proc.\ 7th APPROX + 8th RANDOM}} @string{proc-approx-06-short = {Proc.\ 9th APPROX}} @string{proc-atmos-05-short = {Proc.\ 5th ATMOS}} @string{proc-aussois-01-short = {Proc.\ 5th Intern.\ Workshop on Combinatorial Optimization---``{E}ureka, You Shrink!''}} @string{proc-cats-08-short = {Proc.\ 14th CATS}} @string{proc-ccc-03-short = {Proc.\ 18th CCC}} @string{proc-cccg-97-short = {Proc.\ 9th CCCG}} @string{proc-ciac-94-short = {Proc.\ 2nd CIAC}} @string{proc-ciac-97-short = {Proc.\ 3rd CIAC}} @string{proc-ciac-00-short = {Proc.\ 4th CIAC}} @string{proc-ciac-03-short = {Proc.\ 5th CIAC}} @string{proc-ciac-06-short = {Proc.\ 6th CIAC}} @string{proc-cocoa-08-short = {Proc.\ 2nd COCOA}} @string{proc-cocoon-97-short = {Proc.\ 3rd COCOON}} @string{proc-cocoon-98-short = {Proc.\ 4th COCOON}} @string{proc-cocoon-99-short = {Proc.\ 5th COCOON}} @string{proc-cocoon-00-short = {Proc.\ 6th COCOON}} @string{proc-cocoon-01-short = {Proc.\ 7th COCOON}} @string{proc-cocoon-02-short = {Proc.\ 8th COCOON}} @string{proc-cocoon-03-short = {Proc.\ 9th COCOON}} @string{proc-cocoon-04-short = {Proc.\ 10th COCOON}} @string{proc-cocoon-05-short = {Proc.\ 11th COCOON}} @string{proc-cocoon-06-short = {Proc.\ 12th COCOON}} @string{proc-cocoon-07-short = {Proc.\ 13th COCOON}} @string{proc-csr-06-short = {Proc.\ CSR}} @string{proc-disc-99-short = {Proc.\ 13th DISC}} @string{proc-disc-04-short = {Proc.\ 18th DISC}} @string{proc-disc-05-short = {Proc.\ 19th DISC}} @string{proc-disc-06-short = {Proc.\ 20th DISC}} @string{proc-esa-93-short = {Proc.\ 1st ESA}} @string{proc-esa-94-short = {Proc.\ 2nd ESA}} @string{proc-esa-95-short = {Proc.\ 3rd ESA}} @string{proc-esa-96-short = {Proc.\ 4th ESA}} @string{proc-esa-97-short = {Proc.\ 5th ESA}} @string{proc-esa-98-short = {Proc.\ 6th ESA}} @string{proc-esa-99-short = {Proc.\ 7th ESA}} @string{proc-esa-00-short = {Proc.\ 8th ESA}} @string{proc-esa-01-short = {Proc.\ 9th ESA}} @string{proc-esa-02-short = {Proc.\ 10th ESA}} @string{proc-esa-03-short = {Proc.\ 11th ESA}} @string{proc-esa-04-short = {Proc.\ 12th ESA}} @string{proc-esa-05-short = {Proc.\ 13th ESA}} @string{proc-esa-06-short = {Proc.\ 14th ESA}} @string{proc-escape-07-short = {Proc.\ 1st ESCAPE}} @string{proc-eurocg-09-short = {Proc.\ 25th EuroCG}} @string{proc-faw-07-short = {Proc.\ 1st FAW}} @string{proc-faw-08-short = {Proc.\ 2nd FAW}} @string{proc-fct-03-short = {Proc.\ 14th FCT}} @string{proc-fct-05-short = {Proc.\ 15th FCT}} @string{proc-fct-07-short = {Proc.\ 16th FCT}} @string{proc-focs-86-short = {Proc.\ 27th FOCS}} @string{proc-focs-87-short = {Proc.\ 28th FOCS}} @string{proc-focs-88-short = {Proc.\ 29th FOCS}} @string{proc-focs-89-short = {Proc.\ 30th FOCS}} @string{proc-focs-90-short = {Proc.\ 31st FOCS}} @string{proc-focs-91-short = {Proc.\ 32nd FOCS}} @string{proc-focs-92-short = {Proc.\ 33rd FOCS}} @string{proc-focs-93-short = {Proc.\ 34th FOCS}} @string{proc-focs-94-short = {Proc.\ 35th FOCS}} @string{proc-focs-95-short = {Proc.\ 36th FOCS}} @string{proc-focs-96-short = {Proc.\ 37th FOCS}} @string{proc-focs-97-short = {Proc.\ 38th FOCS}} @string{proc-focs-98-short = {Proc.\ 39th FOCS}} @string{proc-focs-99-short = {Proc.\ 40th FOCS}} @string{proc-focs-00-short = {Proc.\ 41st FOCS}} @string{proc-focs-01-short = {Proc.\ 42nd FOCS}} @string{proc-focs-02-short = {Proc.\ 43rd FOCS}} @string{proc-focs-03-short = {Proc.\ 44th FOCS}} @string{proc-focs-04-short = {Proc.\ 45th FOCS}} @string{proc-focs-05-short = {Proc.\ 46th FOCS}} @string{proc-focs-06-short = {Proc.\ 47th FOCS}} @string{proc-focs-07-short = {Proc.\ 48th FOCS}} @string{proc-focs-08-short = {Proc.\ 49th FOCS}} @string{proc-fsttcs-97-short = {Proc.\ 17th FSTTCS}} @string{proc-fsttcs-01-short = {Proc.\ 21st FSTTCS}} @string{proc-fsttcs-02-short = {Proc.\ 22nd FSTTCS}} @string{proc-fsttcs-03-short = {Proc.\ 23rd FSTTCS}} @string{proc-fsttcs-04-short = {Proc.\ 24st FSTTCS}} @string{proc-fsttcs-07-short = {Proc.\ 27st FSTTCS}} @string{proc-gd-03-short = {Proc.\ 11th GD}} @string{proc-icalp-91-short = {Proc.\ 18th ICALP}} @string{proc-icalp-92-short = {Proc.\ 19th ICALP}} @string{proc-icalp-93-short = {Proc.\ 20st ICALP}} @string{proc-icalp-94-short = {Proc.\ 21st ICALP}} @string{proc-icalp-95-short = {Proc.\ 22nd ICALP}} @string{proc-icalp-96-short = {Proc.\ 23rd ICALP}} @string{proc-icalp-97-short = {Proc.\ 24th ICALP}} @string{proc-icalp-98-short = {Proc.\ 25th ICALP}} @string{proc-icalp-99-short = {Proc.\ 26th ICALP}} @string{proc-icalp-00-short = {Proc.\ 27th ICALP}} @string{proc-icalp-01-short = {Proc.\ 28th ICALP}} @string{proc-icalp-02-short = {Proc.\ 29th ICALP}} @string{proc-icalp-03-short = {Proc.\ 30th ICALP}} @string{proc-icalp-04-short = {Proc.\ 31st ICALP}} @string{proc-icalp-05-short = {Proc.\ 32nd ICALP}} @string{proc-icalp-06-short = {Proc.\ 33rd ICALP}} @string{proc-icalp-07-short = {Proc.\ 34th ICALP}} @string{proc-icalp-08-short = {Proc.\ 35th ICALP}} @string{proc-icalp-09-short = {Proc.\ 36th ICALP}} @string{proc-ictcs-05-short = {Proc.\ 9th ICTCS}} @string{proc-ipco-98-short = {Proc.\ 6th IPCO}} @string{proc-ipco-07-short = {Proc.\ 12th IPCO}} @string{proc-isaac-92-short = {Proc.\ 3rd ISAAC}} @string{proc-isaac-99-short = {Proc.\ 10th ISAAC}} @string{proc-isaac-00-short = {Proc.\ 11th ISAAC}} @string{proc-isaac-01-short = {Proc.\ 12th ISAAC}} @string{proc-isaac-02-short = {Proc.\ 13th ISAAC}} @string{proc-isaac-03-short = {Proc.\ 14th ISAAC}} @string{proc-isaac-04-short = {Proc.\ 15th ISAAC}} @string{proc-isaac-05-short = {Proc.\ 16th ISAAC}} @string{proc-isaac-06-short = {Proc.\ 17th ISAAC}} @string{proc-isaac-07-short = {Proc.\ 18th ISAAC}} @string{proc-issac-97-short = {Proc.\ ISSAC~'97}} @string{proc-istcs-96-short = {Proc.\ 4th ISTCS}} @string{proc-iwpec-04-short = {Proc.\ 1st IWPEC}} @string{proc-iwpec-06-short = {Proc.\ 2nd IWPEC}} @string{proc-iwpec-08-short = {Proc.\ 3rd IWPEC}} @string{proc-latin-98-short = {Proc.\ 3rd LATIN}} @string{proc-latin-00-short = {Proc.\ 4th LATIN}} @string{proc-latin-02-short = {Proc.\ 5th LATIN}} @string{proc-latin-04-short = {Proc.\ 6th LATIN}} @string{proc-latin-06-short = {Proc.\ 7th LATIN}} @string{proc-latin-08-short = {Proc.\ 8th LATIN}} @string{proc-mfcs-97-short = {Proc.\ 22nd MFCS}} @string{proc-mfcs-01-short = {Proc.\ 26th MFCS}} @string{proc-mfcs-02-short = {Proc.\ 27th MFCS}} @string{proc-mfcs-03-short = {Proc.\ 28th MFCS}} @string{proc-mfcs-04-short = {Proc.\ 29th MFCS}} @string{proc-mfcs-05-short = {Proc.\ 30st MFCS}} @string{proc-mfcs-06-short = {Proc.\ 31st MFCS}} @string{proc-mfcs-07-short = {Proc.\ 32nd MFCS}} @string{proc-mfcs-08-short = {Proc.\ 33rd MFCS}} @string{proc-podc-86-short = {Proc.\ 5th PODC}} @string{proc-podc-95-short = {Proc.\ 14th PODC}} @string{proc-podc-96-short = {Proc.\ 15th PODC}} @string{proc-podc-97-short = {Proc.\ 16th PODC}} @string{proc-podc-98-short = {Proc.\ 17th PODC}} @string{proc-podc-00-short = {Proc.\ 19th PODC}} @string{proc-podc-01-short = {Proc.\ 20th PODC}} @string{proc-podc-02-short = {Proc.\ 21st PODC}} @string{proc-podc-03-short = {Proc.\ 22nd PODC}} @string{proc-podc-04-short = {Proc.\ 23rd PODC}} @string{proc-podc-05-short = {Proc.\ 24th PODC}} @string{proc-podc-06-short = {Proc.\ 25th PODC}} @string{proc-random-02-short = {Proc.\ 6th RANDOM}} @string{proc-random-04-short = {Proc.\ 8th RANDOM}} @string{proc-sac-08-short = {Proc.\ 23rd SAC}} @string{proc-sirocco-94-short = {Proc.\ 1st SIROCCO}} @string{proc-sirocco-95-short = {Proc.\ 2nd SIROCCO}} @string{proc-sirocco-96-short = {Proc.\ 3rd SIROCCO}} @string{proc-sirocco-97-short = {Proc.\ 4th SIROCCO}} @string{proc-sirocco-05-short = {Proc.\ 12th SIROCCO}} @string{proc-sirocco-06-short = {Proc.\ 13th SIROCCO}} @string{proc-socg-96-short = {Proc.\ 22nd SOCG}} @string{proc-soda-90-short = {Proc.\ 1st SODA}} @string{proc-soda-91-short = {Proc.\ 2nd SODA}} @string{proc-soda-92-short = {Proc.\ 3rd SODA}} @string{proc-soda-93-short = {Proc.\ 4rd SODA}} @string{proc-soda-94-short = {Proc.\ 5rd SODA}} @string{proc-soda-95-short = {Proc.\ 6rd SODA}} @string{proc-soda-96-short = {Proc.\ 7th SODA}} @string{proc-soda-97-short = {Proc.\ 8th SODA}} @string{proc-soda-98-short = {Proc.\ 9th SODA}} @string{proc-soda-99-short = {Proc.\ 10th SODA}} @string{proc-soda-00-short = {Proc.\ 11th SODA}} @string{proc-soda-01-short = {Proc.\ 12th SODA}} @string{proc-soda-02-short = {Proc.\ 13th SODA}} @string{proc-soda-03-short = {Proc.\ 14th SODA}} @string{proc-soda-04-short = {Proc.\ 15th SODA}} @string{proc-soda-04-it-short = {\textit{Proc.\ 15th SODA}}} @string{proc-soda-05-short = {Proc.\ 16th SODA}} @string{proc-soda-06-short = {Proc.\ 17th SODA}} @string{proc-soda-07-short = {Proc.\ 18th SODA}} @string{proc-soda-08-short = {Proc.\ 19th SODA}} @string{proc-soda-09-short = {Proc.\ 20th SODA}} @string{proc-sofsem-97-short = {Proc.\ 24th SOFSEM}} @string{proc-sofsem-98-short = {Proc.\ 25th SOFSEM}} @string{proc-sofsem-05-short = {Proc.\ 31st SOFSEM}} @string{proc-sofsem-06-short = {Proc.\ 32nd SOFSEM}} @string{proc-sofsem-07-short = {Proc.\ 33rd SOFSEM}} @string{proc-sofsem-08-short = {Proc.\ 34th SOFSEM}} @string{proc-spaa-01-short = {Proc.\ 13th SPAA}} @string{proc-spaa-02-short = {Proc.\ 14th SPAA}} @string{proc-spaa-03-short = {Proc.\ 15th SPAA}} @string{proc-spaa-04-short = {Proc.\ 16th SPAA}} @string{proc-spaa-05-short = {Proc.\ 17th SPAA}} @string{proc-spaa-06-short = {Proc.\ 18th SPAA}} @string{proc-stacs-94-short = {Proc.\ 11th STACS}} @string{proc-stacs-99-short = {Proc.\ 16th STACS}} @string{proc-stacs-00-short = {Proc.\ 17th STACS}} @string{proc-stacs-01-short = {Proc.\ 18th STACS}} @string{proc-stacs-02-short = {Proc.\ 19th STACS}} @string{proc-stacs-03-short = {Proc.\ 20st STACS}} @string{proc-stacs-04-short = {Proc.\ 21st STACS}} @string{proc-stacs-05-short = {Proc.\ 22nd STACS}} @string{proc-stacs-06-short = {Proc.\ 23rd STACS}} @string{proc-stacs-07-short = {Proc.\ 24th STACS}} @string{proc-stoc-71-short = {Proc.\ 3rd STOC}} @string{proc-stoc-74-short = {Proc.\ 6th STOC}} @string{proc-stoc-75-short = {Proc.\ 7th STOC}} @string{proc-stoc-76-short = {Proc.\ 8th STOC}} @string{proc-stoc-77-short = {Proc.\ 9th STOC}} @string{proc-stoc-78-short = {Proc.\ 10th STOC}} @string{proc-stoc-82-short = {Proc.\ 14th STOC}} @string{proc-stoc-83-short = {Proc.\ 15th STOC}} @string{proc-stoc-84-short = {Proc.\ 16th STOC}} @string{proc-stoc-85-short = {Proc.\ 17th STOC}} @string{proc-stoc-86-short = {Proc.\ 18th STOC}} @string{proc-stoc-87-short = {Proc.\ 19th STOC}} @string{proc-stoc-88-short = {Proc.\ 20st STOC}} @string{proc-stoc-89-short = {Proc.\ 21st STOC}} @string{proc-stoc-90-short = {Proc.\ 22nd STOC}} @string{proc-stoc-91-short = {Proc.\ 23rd STOC}} @string{proc-stoc-92-short = {Proc.\ 24th STOC}} @string{proc-stoc-93-short = {Proc.\ 25th STOC}} @string{proc-stoc-94-short = {Proc.\ 26th STOC}} @string{proc-stoc-95-short = {Proc.\ 27th STOC}} @string{proc-stoc-96-short = {Proc.\ 28th STOC}} @string{proc-stoc-97-short = {Proc.\ 29th STOC}} @string{proc-stoc-98-short = {Proc.\ 30st STOC}} @string{proc-stoc-99-short = {Proc.\ 31st STOC}} @string{proc-stoc-00-short = {Proc.\ 32nd STOC}} @string{proc-stoc-01-short = {Proc.\ 33rd STOC}} @string{proc-stoc-02-short = {Proc.\ 34th STOC}} @string{proc-stoc-03-short = {Proc.\ 35th STOC}} @string{proc-stoc-04-short = {Proc.\ 36th STOC}} @string{proc-stoc-05-short = {Proc.\ 37th STOC}} @string{proc-stoc-06-short = {Proc.\ 38th STOC}} @string{proc-stoc-07-short = {Proc.\ 39th STOC}} @string{proc-stoc-08-short = {Proc.\ 40th STOC}} @string{proc-swat-00-short = {Proc.\ 7th SWAT}} @string{proc-swat-02-short = {Proc.\ 8th SWAT}} @string{proc-swat-04-short = {Proc.\ 9th SWAT}} @string{proc-swat-06-short = {Proc.\ 10th SWAT}} @string{proc-swat-06-it-short = {\textit{Proc.\ 10th SWAT}}} @string{proc-tamc-07-short = {Proc.\ 4th TAMC}} @string{proc-tamc-08-short = {Proc.\ 5th TAMC}} @string{proc-uai-94-short = {Proc.\ 10th UAI}} @string{proc-wads-93-short = {Proc.\ 3rd WADS}} @string{proc-wads-01-short = {Proc.\ 7th WADS}} @string{proc-wads-03-short = {Proc.\ 8th WADS}} @string{proc-wads-05-short = {Proc.\ 9th WADS}} @string{proc-wads-07-short = {Proc.\ 10th WADS}} @string{proc-walcom-09-short = {Proc.\ 3rd WALCOM}} @string{proc-waoa-07-short = {Proc.\ 5th WAOA}} @string{proc-wea-03-short = {Proc.\ 2nd WEA}} @string{proc-wea-04-short = {Proc.\ 3rd WEA}} @string{proc-wea-05-short = {Proc.\ 4th WEA}} @string{proc-wea-06-short = {Proc.\ 5th WEA}} @string{proc-wea-07-short = {Proc.\ 6th WEA}} @string{proc-wg-81-short = {Proc.\ 7th~WG}} @string{proc-wg-89-short = {Proc.\ 15th~WG}} @string{proc-wg-90-short = {Proc.\ 16th~WG}} @string{proc-wg-91-short = {Proc.\ 17th~WG}} @string{proc-wg-92-short = {Proc.\ 18th~WG}} @string{proc-wg-99-short = {Proc.\ 25th~WG}} @string{proc-wg-00-short = {Proc.\ 26th~WG}} @string{proc-wg-01-short = {Proc.\ 27th~WG}} @string{proc-wg-02-short = {Proc.\ 28th~WG}} @string{proc-wg-03-short = {Proc.\ 29th~WG}} @string{proc-wg-04-short = {Proc.\ 30th~WG}} @string{proc-wg-05-short = {Proc.\ 31st~WG}} @string{proc-wg-06-short = {Proc.\ 32nd~WG}} @string{proc-wg-07-short = {Proc.\ 33rd~WG}} @string{proc-aaim-08 = proc-aaim-08-long} @string{proc-acid-05 = proc-acid-05-long} @string{proc-acid-06 = proc-acid-06-long} @string{proc-acid-07 = proc-acid-07-long} @string{proc-adhocnow-04 = proc-adhocnow-04-long} @string{proc-alenex-04 = proc-alenex-04-long} @string{proc-alenex-05 = proc-alenex-05-long} @string{proc-alenex-06 = proc-alenex-06-long} @string{proc-apbc-07 = proc-apbc-07-long} @string{proc-apbc-08 = proc-apbc-08-long} @string{proc-approx-98 = proc-approx-98-long} @string{proc-approx-00 = proc-approx-00-long} @string{proc-approx-02 = proc-approx-02-long} @string{proc-approx-04 = proc-approx-04-long} @string{proc-approx-random-04 = proc-approx-random-04-long} @string{proc-approx-06 = proc-approx-06-long} @string{proc-atmos-05 = proc-atmos-05-long} @string{proc-aussois-01 = proc-aussois-01-long} @string{proc-cats-08 = proc-cats-08-long}} @string{proc-ccc-03 = proc-ccc-03-long} @string{proc-cccg-97 = proc-cccg-97-long} @string{proc-ciac-94 = proc-ciac-94-long} @string{proc-ciac-97 = proc-ciac-97-long} @string{proc-ciac-00 = proc-ciac-00-long} @string{proc-ciac-03 = proc-ciac-03-long} @string{proc-ciac-06 = proc-ciac-06-long} @string{proc-cocoa-08 = proc-cocoa-08-long} @string{proc-cocoon-97 = proc-cocoon-97-long} @string{proc-cocoon-98 = proc-cocoon-98-long} @string{proc-cocoon-99 = proc-cocoon-99-long} @string{proc-cocoon-00 = proc-cocoon-00-long} @string{proc-cocoon-01 = proc-cocoon-01-long} @string{proc-cocoon-02 = proc-cocoon-02-long} @string{proc-cocoon-03 = proc-cocoon-03-long} @string{proc-cocoon-04 = proc-cocoon-04-long} @string{proc-cocoon-05 = proc-cocoon-05-long} @string{proc-cocoon-06 = proc-cocoon-06-long} @string{proc-cocoon-07 = proc-cocoon-07-long} @string{proc-csr-06 = proc-csr-06-long} @string{proc-disc-99 = proc-disc-99-long} @string{proc-disc-04 = proc-disc-04-long} @string{proc-disc-05 = proc-disc-05-long} @string{proc-disc-06 = proc-disc-06-long} @string{proc-esa-93 = proc-esa-93-long} @string{proc-esa-94 = proc-esa-94-long} @string{proc-esa-95 = proc-esa-95-long} @string{proc-esa-96 = proc-esa-96-long} @string{proc-esa-97 = proc-esa-97-long} @string{proc-esa-98 = proc-esa-98-long} @string{proc-esa-99 = proc-esa-99-long} @string{proc-esa-00 = proc-esa-00-long} @string{proc-esa-01 = proc-esa-01-long} @string{proc-esa-02 = proc-esa-02-long} @string{proc-esa-03 = proc-esa-03-long} @string{proc-esa-04 = proc-esa-04-long} @string{proc-esa-05 = proc-esa-05-long} @string{proc-esa-06 = proc-esa-06-long} @string{proc-escape-07 = proc-escape-07-long} @string{proc-eurocg-09 = proc-eurocg-09-long} @string{proc-faw-07 = proc-faw-07-long} @string{proc-faw-08 = proc-faw-08-long} @string{proc-fct-03 = proc-fct-03-long} @string{proc-fct-05 = proc-fct-05-long} @string{proc-fct-07 = proc-fct-07-long} @string{proc-focs-86 = proc-focs-86-long} @string{proc-focs-87 = proc-focs-87-long} @string{proc-focs-88 = proc-focs-88-long} @string{proc-focs-89 = proc-focs-89-long} @string{proc-focs-90 = proc-focs-90-long} @string{proc-focs-91 = proc-focs-91-long} @string{proc-focs-92 = proc-focs-92-long} @string{proc-focs-93 = proc-focs-93-long} @string{proc-focs-94 = proc-focs-94-long} @string{proc-focs-95 = proc-focs-95-long} @string{proc-focs-96 = proc-focs-96-long} @string{proc-focs-97 = proc-focs-97-long} @string{proc-focs-98 = proc-focs-98-long} @string{proc-focs-99 = proc-focs-99-long} @string{proc-focs-00 = proc-focs-00-long} @string{proc-focs-01 = proc-focs-01-long} @string{proc-focs-02 = proc-focs-02-long} @string{proc-focs-03 = proc-focs-03-long} @string{proc-focs-04 = proc-focs-04-long} @string{proc-focs-05 = proc-focs-05-long} @string{proc-focs-06 = proc-focs-06-long} @string{proc-focs-07 = proc-focs-07-long} @string{proc-focs-08 = proc-focs-08-long} @string{proc-fsttcs-97 = proc-fsttcs-97-long} @string{proc-fsttcs-01 = proc-fsttcs-01-long} @string{proc-fsttcs-02 = proc-fsttcs-02-long} @string{proc-fsttcs-03 = proc-fsttcs-03-long} @string{proc-fsttcs-04 = proc-fsttcs-04-long} @string{proc-fsttcs-07 = proc-fsttcs-07-long} @string{proc-gd-03 = proc-gd-03-long} @string{proc-icalp-91 = proc-icalp-91-long} @string{proc-icalp-92 = proc-icalp-92-long} @string{proc-icalp-93 = proc-icalp-93-long} @string{proc-icalp-94 = proc-icalp-94-long} @string{proc-icalp-95 = proc-icalp-95-long} @string{proc-icalp-96 = proc-icalp-96-long} @string{proc-icalp-97 = proc-icalp-97-long} @string{proc-icalp-98 = proc-icalp-98-long} @string{proc-icalp-99 = proc-icalp-99-long} @string{proc-icalp-00 = proc-icalp-00-long} @string{proc-icalp-01 = proc-icalp-01-long} @string{proc-icalp-02 = proc-icalp-02-long} @string{proc-icalp-03 = proc-icalp-03-long} @string{proc-icalp-04 = proc-icalp-04-long} @string{proc-icalp-05 = proc-icalp-05-long} @string{proc-icalp-06 = proc-icalp-06-long} @string{proc-icalp-07 = proc-icalp-07-long} @string{proc-icalp-08 = proc-icalp-08-long} @string{proc-icalp-09 = proc-icalp-09-long} @string{proc-ictcs-05 = proc-ictcs-05-long} @string{proc-ipco-98 = proc-ipco-98-long} @string{proc-ipco-07 = proc-ipco-07-long} @string{proc-isaac-92 = proc-isaac-92-long} @string{proc-isaac-99 = proc-isaac-99-long} @string{proc-isaac-00 = proc-isaac-00-long} @string{proc-isaac-01 = proc-isaac-01-long} @string{proc-isaac-02 = proc-isaac-02-long} @string{proc-isaac-03 = proc-isaac-03-long} @string{proc-isaac-04 = proc-isaac-04-long} @string{proc-isaac-05 = proc-isaac-05-long} @string{proc-isaac-06 = proc-isaac-06-long} @string{proc-isaac-07 = proc-isaac-07-long} @string{proc-issac-97 = proc-issac-97-long} @string{proc-istcs-96 = proc-istcs-96-long} @string{proc-iwpec-04 = proc-iwpec-04-long} @string{proc-iwpec-06 = proc-iwpec-06-long} @string{proc-iwpec-08 = proc-iwpec-08-long} @string{proc-latin-98 = proc-latin-98-long} @string{proc-latin-00 = proc-latin-00-long} @string{proc-latin-02 = proc-latin-02-long} @string{proc-latin-04 = proc-latin-04-long} @string{proc-latin-06 = proc-latin-06-long} @string{proc-latin-08 = proc-latin-08-long} @string{proc-mfcs-97 = proc-mfcs-97-long} @string{proc-mfcs-01 = proc-mfcs-01-long} @string{proc-mfcs-02 = proc-mfcs-02-long} @string{proc-mfcs-03 = proc-mfcs-03-long} @string{proc-mfcs-04 = proc-mfcs-04-long} @string{proc-mfcs-05 = proc-mfcs-05-long} @string{proc-mfcs-06 = proc-mfcs-06-long} @string{proc-mfcs-07 = proc-mfcs-07-long} @string{proc-mfcs-08 = proc-mfcs-08-long} @string{proc-podc-86 = proc-podc-86-long} @string{proc-podc-95 = proc-podc-95-long} @string{proc-podc-96 = proc-podc-96-long} @string{proc-podc-97 = proc-podc-97-long} @string{proc-podc-98 = proc-podc-98-long} @string{proc-podc-00 = proc-podc-00-long} @string{proc-podc-01 = proc-podc-01-long} @string{proc-podc-02 = proc-podc-02-long} @string{proc-podc-03 = proc-podc-03-long} @string{proc-podc-04 = proc-podc-04-long} @string{proc-podc-05 = proc-podc-05-long} @string{proc-podc-06 = proc-podc-06-long} @string{proc-random-02 = proc-random-02-long} @string{proc-random-04 = proc-approx-04-long} @string{proc-sac-08 = proc-sac-08-long} @string{proc-sirocco-94 = proc-sirocco-94-long} @string{proc-sirocco-95 = proc-sirocco-95-long} @string{proc-sirocco-96 = proc-sirocco-96-long} @string{proc-sirocco-97 = proc-sirocco-97-long} @string{proc-sirocco-05 = proc-sirocco-05-long} @string{proc-sirocco-06 = proc-sirocco-06-long} @string{proc-socg-96 = proc-socg-96-long} @string{proc-soda-90 = proc-soda-90-long} @string{proc-soda-90 = proc-soda-90-long} @string{proc-soda-92 = proc-soda-92-long} @string{proc-soda-93 = proc-soda-93-long} @string{proc-soda-94 = proc-soda-94-long} @string{proc-soda-95 = proc-soda-95-long} @string{proc-soda-96 = proc-soda-96-long} @string{proc-soda-97 = proc-soda-97-long} @string{proc-soda-98 = proc-soda-98-long} @string{proc-soda-99 = proc-soda-99-long} @string{proc-soda-00 = proc-soda-00-long} @string{proc-soda-01 = proc-soda-01-long} @string{proc-soda-02 = proc-soda-02-long} @string{proc-soda-03 = proc-soda-03-long} @string{proc-soda-04 = proc-soda-04-long} @string{proc-soda-04-it = proc-soda-04-it-long} @string{proc-soda-05 = proc-soda-05-long} @string{proc-soda-06 = proc-soda-06-long} @string{proc-soda-07 = proc-soda-07-long} @string{proc-soda-08 = proc-soda-08-long} @string{proc-soda-09 = proc-soda-09-long} @string{proc-sofsem-97 = proc-sofsem-97-long} @string{proc-sofsem-98 = proc-sofsem-98-long} @string{proc-sofsem-05 = proc-sofsem-05-long} @string{proc-sofsem-06 = proc-sofsem-06-long} @string{proc-sofsem-07 = proc-sofsem-07-long} @string{proc-sofsem-08 = proc-sofsem-08-long} @string{proc-spaa-01 = proc-spaa-01-long} @string{proc-spaa-02 = proc-spaa-02-long} @string{proc-spaa-03 = proc-spaa-03-long} @string{proc-spaa-04 = proc-spaa-04-long} @string{proc-spaa-05 = proc-spaa-05-long} @string{proc-spaa-06 = proc-spaa-06-long} @string{proc-stacs-94 = proc-stacs-94-long} @string{proc-stacs-99 = proc-stacs-99-long} @string{proc-stacs-00 = proc-stacs-00-long} @string{proc-stacs-01 = proc-stacs-01-long} @string{proc-stacs-02 = proc-stacs-02-long} @string{proc-stacs-03 = proc-stacs-03-long} @string{proc-stacs-04 = proc-stacs-04-long} @string{proc-stacs-05 = proc-stacs-05-long} @string{proc-stacs-06 = proc-stacs-06-long} @string{proc-stacs-07 = proc-stacs-07-long} @string{proc-stoc-71 = proc-stoc-71-long} @string{proc-stoc-74 = proc-stoc-74-long} @string{proc-stoc-75 = proc-stoc-75-long} @string{proc-stoc-76 = proc-stoc-76-long} @string{proc-stoc-77 = proc-stoc-77-long} @string{proc-stoc-78 = proc-stoc-78-long} @string{proc-stoc-82 = proc-stoc-82-long} @string{proc-stoc-83 = proc-stoc-83-long} @string{proc-stoc-84 = proc-stoc-84-long} @string{proc-stoc-85 = proc-stoc-85-long} @string{proc-stoc-86 = proc-stoc-86-long} @string{proc-stoc-87 = proc-stoc-87-long} @string{proc-stoc-88 = proc-stoc-88-long} @string{proc-stoc-89 = proc-stoc-89-long} @string{proc-stoc-90 = proc-stoc-90-long} @string{proc-stoc-91 = proc-stoc-91-long} @string{proc-stoc-92 = proc-stoc-92-long} @string{proc-stoc-93 = proc-stoc-93-long} @string{proc-stoc-94 = proc-stoc-94-long} @string{proc-stoc-95 = proc-stoc-95-long} @string{proc-stoc-96 = proc-stoc-96-long} @string{proc-stoc-97 = proc-stoc-97-long} @string{proc-stoc-98 = proc-stoc-98-long} @string{proc-stoc-99 = proc-stoc-99-long} @string{proc-stoc-00 = proc-stoc-00-long} @string{proc-stoc-01 = proc-stoc-01-long} @string{proc-stoc-02 = proc-stoc-02-long} @string{proc-stoc-03 = proc-stoc-03-long} @string{proc-stoc-04 = proc-stoc-04-long} @string{proc-stoc-05 = proc-stoc-05-long} @string{proc-stoc-06 = proc-stoc-06-long} @string{proc-stoc-07 = proc-stoc-07-long} @string{proc-stoc-08 = proc-stoc-08-long} @string{proc-swat-00 = proc-swat-00-long} @string{proc-swat-02 = proc-swat-02-long} @string{proc-swat-04 = proc-swat-04-long} @string{proc-swat-06 = proc-swat-06-long} @string{proc-swat-06-it = proc-swat-06-it-long} @string{proc-tamc-07 = proc-tamc-07-long} @string{proc-tamc-08 = proc-tamc-08-long} @string{proc-uai-94 = proc-uai-94-long} @string{proc-wads-93 = proc-wads-93-long} @string{proc-wads-01 = proc-wads-01-long} @string{proc-wads-03 = proc-wads-03-long} @string{proc-wads-05 = proc-wads-05-long} @string{proc-wads-07 = proc-wads-07-long} @string{proc-walcom-09 = proc-walcom-09-long} @string{proc-waoa-07 = proc-waoa-07-long} @string{proc-wea-03 = proc-wea-03-long} @string{proc-wea-04 = proc-wea-04-long} @string{proc-wea-05 = proc-wea-05-long} @string{proc-wea-06 = proc-wea-06-long} @string{proc-wea-07 = proc-wea-07-long} @string{proc-wg-81 = proc-wg-81-long} @string{proc-wg-89 = proc-wg-89-long} @string{proc-wg-90 = proc-wg-90-long} @string{proc-wg-91 = proc-wg-91-long} @string{proc-wg-92 = proc-wg-92-long} @string{proc-wg-99 = proc-wg-99-long} @string{proc-wg-00 = proc-wg-00-long} @string{proc-wg-01 = proc-wg-01-long} @string{proc-wg-02 = proc-wg-02-long} @string{proc-wg-03 = proc-wg-03-long} @string{proc-wg-04 = proc-wg-04-long} @string{proc-wg-05 = proc-wg-05-long} @string{proc-wg-06 = proc-wg-06-long} @string{proc-wg-07 = proc-wg-07-long} @string{proc-acmsoutheast-90 = {Proceedings of the 28th ACM Annual Southeast Regional Conference}} @string{proc-acmsoutheast-91 = {Proceedings of the 29th ACM Annual Southeast Regional Conference}} @string{proc-acmsoutheast-92 = {Proceedings of the 30th Annual Southeast Conference}} @string{proc-acmsoutheast-93 = {Proceedings of the 31st Annual Southeast Conference}} @string{proc-acmsoutheast-94 = {Proceedings of the 32nd Annual Southeast Conference}} % ---------------------------------------------------------------------- @string{journal-acmjexpalg-long = {ACM Journal of Experimental Algorithmics}} @string{journal-acmjexpalg-it-long = {\textit{ACM Journal of Experimental Algorithmics}}} @string{journal-acmsigactnews-long = {ACM SIGACT News}} @string{journal-acmtransalgorithms-long = {ACM Transactions on Algorithms}} @string{journal-acmtransalgorithms-it-long = {\textit{ACM Transactions on Algorithms}}} @string{journal-actainform-long = {Acta Informatica}} @string{journal-actamath-long = {Acta Mathematica}} @string{journal-anndiscretemath-long = {Annals of Discrete Mathematics}} @string{journal-annofmath-long = {Annals of Mathematics}} @string{journal-annofmath-it-long = {\textit{Annals of Mathematics}}} @string{journal-annoperres-long = {Annals of Operations Research}} @string{journal-annoperres-it-long = {\textit{Annals of Operations Research}}} @string{journal-arscombin-long = {Ars Combinatoria}} @string{journal-computgeom-long = {Computational Geometry}} @string{journal-computapplmath-long = {Journal of Computational and Applied Mathematics}} @string{journal-computmathappl-long = {Computers {\&} Mathematics with Applications}} @string{journal-comptesrendus-long = {Comptes Rendus de l'~Acad{\'e}mie des Sciences, Paris}} @string{journal-congrnumer-long = {Congressus Numerantium}} @string{journal-discreteapplmath-long = {Discrete Applied Mathematics}} @string{journal-discreteapplmath-it-long = {\textit{Discrete Applied Mathematics}}} @string{journal-discretecomputgeom-long = {Discrete {\&} Computational Geometry}} @string{journal-discretemath-long = {Discrete Mathematics}} @string{journal-discreteoptim-long = {Discrete Optimization}} @string{journal-discreteoptim-it-long = {\textit{Discrete Optimization}}} @string{journal-eatcsbulletin-long = {Bulletin of the European Association for Theoretical Computer Science}} @string{journal-europeanjoperres-long = {European Journal of Operational Research}} @string{journal-fundmath-long = {Fundamenta Mathematicae}} @string{journal-graphscombin-long = {Graphs and Combinatorics}} @string{journal-intjfoundcs-long = {International Journal of Foundations of Computer Science}} @string{journal-informandcomput-long = {Information and Computation}} @string{journal-internatjcomputgeomappl-long = {International Journal of Computational Geometry~{\&} Applications}} @string{journal-internatmathnews-long = {In\-ter\-na\-ti\-o\-na\-le Ma\-the\-ma\-ti\-sche Nach\-rich\-ten}} @string{journal-inttransoperres-long = {International Transactions in Operational Research}} @string{journal-ipl-long = {Information Processing Letters}} @string{journal-ipl-it-long = {\textit{Information Processing Letters}}} @string{journal-jacm-long = {Journal of the ACM}} @string{journal-jacm-it-long = {\textit{Journal of the ACM}}} @string{journal-jair-long = {Journal of Artificial Intelligence Research}} @string{journal-jalgorithms-long = {Journal of Algorithms}} @string{journal-jalgorithms-it-long = {\textit{Journal of Algorithms}}} @string{journal-jcombintheoryA-long = {Journal of Combinatorial Theory. Series~A}} @string{journal-jcombintheoryB-long = {Journal of Combinatorial Theory. Series~B}} @string{journal-jcomputbiol-long = {Journal of Computational Biology}} @string{journal-jcss-long = {Journal of Computer and System Sciences}} @string{journal-jcss-it-long = {\textit{Journal of Computer and System Sciences}}} @string{journal-jdiscretealgorithms-long = {Journal of Discrete Algorithms}} @string{journal-jdiscretealgorithms-it-long = {\textit{Journal of Discrete Algorithms}}} @string{journal-jgraphalgorithmsappl-long = {Journal of Graph Algorithms and Applications}} @string{journal-jgraphtheory-long = {Journal of Graph Theory}} @string{journal-linearalgebraappl-long = {Linear Algebra and its Applications}} @string{journal-machlearn-long = {Machine Learning}} @string{journal-mathprogram-long = {Mathematical Programming}} @string{journal-naturegenetics-long = {Nature Genetics}} @string{journal-navalreslogist-long = {Naval Research Logistics}} @string{journal-operres-long = {Operations Research}} @string{journal-operreslett-long = {Operations Research Letters}} @string{journal-pacificjmath-long = {Pacific Journal of Mathematics}} @string{journal-procams-long = {Proceedings of the American Mathematical Society}} @string{journal-procnatlacadusa-long = {Proceedings of the National Academy of Sciences of the United States of America}} @string{journal-siamjcomput-long = {SIAM Journal on Computing}} @string{journal-siamjcomput-it-long = {\textit{SIAM Journal on Computing}}} @string{journal-siamjdiscretemath-long = {SIAM Journal on Discrete Mathematics}} @string{journal-siamjdiscretemath-it-long = {\textit{SIAM Journal on Discrete Mathematics}}} @string{journal-siamjoptim-long = {SIAM Journal on Optimization}} @string{journal-tcs-long = {Theoretical Computer Science}} @string{journal-tcs-it-long = {\textit{Theoretical Computer Science}}} @string{journal-tocs-long = {Theory of Computing Systems}} @string{journal-tocs-it-long = {\textit{Theory of Computing Systems}}} @string{journal-acmjexpalg-short = {ACM J.\ Exp.\ Algorithmics}} @string{journal-acmjexpalg-it-short = {\textit{ACM J.\ Exp.\ Algorithmics}}} @string{journal-acmsigactnews-short = {SIGACT News}} @string{journal-acmtransalgorithms-short = {ACM Trans.\ Algorithms}} @string{journal-acmtransalgorithms-it-short = {\textit{ACM Trans.\ Algorithms}}} @string{journal-actainform-short = {Acta Inform.}} @string{journal-actamath-short = {Acta Math.}} @string{journal-anndiscretemath-short = {Ann.\ of Discrete Math.}} @string{journal-annofmath-short = {Ann.\ of Math.}} @string{journal-annofmath-it-short = {\textit{Ann.\ of Math.}}} @string{journal-annoperres-short = {Ann.\ Oper.\ Res.}} @string{journal-annoperres-it-short = {\textit{Ann.\ Oper.\ Res.}}} @string{journal-arscombin-short = {Ars Combin.}} @string{journal-computgeom-short = {Comput.\ Geom.}} @string{journal-computapplmath-short = {J.~Comput.\ Appl.\ Math.}} @string{journal-computmathappl-short = {Comput.\ Math.\ Appl.}} @string{journal-comptesrendus-short = {C.\ R.\ Acad.\ Sci.\ Paris}} @string{journal-congrnumer-short = {Congr.\ Numer.}} @string{journal-discreteapplmath-short = {Discrete Appl.\ Math.}} @string{journal-discreteapplmath-it-short = {\textit{Discrete Appl.\ Math.}}} @string{journal-discretecomputgeom-short = {Discrete Comput.\ Geom.}} @string{journal-discretemath-short = {Discrete Math.}} @string{journal-discreteoptim-short = {Discrete Optim.}} @string{journal-discreteoptim-it-short = {\textit{Discrete Optim.}}} @string{journal-eatcsbulletin-short = {EATCS Bulletin}} @string{journal-europeanjoperres-short = {European J.\ Oper.\ Res.}} @string{journal-fundmath-short = {Fund.\ Math.}} @string{journal-graphscombin-short = {Graphs Combin.}} @string{journal-intjfoundcs-shortI = {IJFCS}} @string{journal-intjfoundcs-shortII = {Int.\ J.\ Found.\ Computer Science}} % where does this abbreviation come from? @string{journal-intjfoundcs-short = journal-intjfoundcs-shortI} @string{journal-informandcomput-short = {Inform.\ and Comput.}} @string{journal-internatjcomputgeomappl-short = {Internat.\ J.\ Comput.\ Geom.\ Appl.}} @string{journal-internatmathnews-shortI = {In\-tern.\ Math.\ Nachr.}} @string{journal-internatmathnews-shortII = {In\-ter\-nat.\ Math.\ News}} @string{journal-internatmathnews-short = journal-internatmathnews-shortI} @string{journal-inttransoperres-short = {Int.\ Trans.\ Oper.\ Res.}} @string{journal-ipl-short = {Inf.\ Process.\ Lett.}} @string{journal-ipl-it-short = {\textit{Inf.\ Process.\ Lett.}}} @string{journal-jacm-short = {J.~ACM}} @string{journal-jacm-it-short = {\textit{J.~ACM}}} @string{journal-jair-short = {J.~Artificial Intelligence Res.}} @string{journal-jalgorithms-short = {J.~Algorithms}} @string{journal-jalgorithms-it-short = {\textit{J.~Algorithms}}} @string{journal-jcombintheoryA-short = {J.~Combin.\ Theory Ser.~A}} @string{journal-jcombintheoryB-short = {J.~Combin.\ Theory Ser.~B}} @string{journal-jcomputbiol-short = {J.~Comput.\ Biol.}} @string{journal-jcss-short = {J.~Comput.\ System Sci.}} @string{journal-jcss-it-short = {\textit{J.~Comput.\ System Sci.}}} @string{journal-jdiscretealgorithms-short = {J.~Discrete Algorithms}} @string{journal-jdiscretealgorithms-it-short = {\textit{J.~Discrete Algorithms}}} @string{journal-jgraphalgorithmsappl-short = {J.~Graph Algorithms Appl.}} @string{journal-jgraphtheory-short = {J.~Graph Theory}} @string{journal-linearalgebraappl-short = {Linear Algebra Appl.}} @string{journal-machlearn-short = {Mach.\ Learn.}} @string{journal-mathprogram-short = {Math.\ Program.}} @string{journal-naturegenetics-short = {Nat.\ Genet.}} % where does this abbreviation come from? @string{journal-navalreslogist-short = {Naval Res.\ Logist.}} @string{journal-operres-short = {Oper.\ Res.}} @string{journal-operreslett-short = {Oper.\ Res.\ Lett.}} @string{journal-pacificjmath-short = {Pacific J.\ Math.}} @string{journal-procams-shortI = {Proc.\ Amer.\ Math.\ Soc.}} @string{journal-procams-shortII = {Proc.\ AMS}} @string{journal-procams-short = journal-procams-shortI} @string{journal-procnatlacadusa-short = {Proc.\ Natl.\ Acad.\ Sci.\ USA}} @string{journal-siamjcomput-short = {SIAM J.\ Comput.}} @string{journal-siamjcomput-it-short = {\textit{SIAM J.\ Comput.}}} @string{journal-siamjdiscretemath-short = {SIAM J.\ Discrete Math.}} @string{journal-siamjdiscretemath-it-short = {\textit{SIAM J.\ Discrete Math.}}} @string{journal-siamjoptim-short = {SIAM J.\ Optim.}} @string{journal-tcs-short = {Theor.\ Comput.\ Sci.}} @string{journal-tcs-it-short = {\textit{Theor.\ Comput.\ Sci.}}} @string{journal-tocs-short = {Theory Comput.\ Syst.}} @string{journal-tocs-it-short = {\textit{Theory Comput.\ Syst.}}} @string{journal-acmjexpalg = journal-acmjexpalg-long} % publisher-acm @string{journal-acmjexpalg-it = journal-acmjexpalg-it-long} % publisher-acm @string{journal-acmsigactnews = journal-acmsigactnews-long} % publisher-acm @string{journal-acmtransalgorithms = journal-acmtransalgorithms-long} % publisher-acm @string{journal-acmtransalgorithms-it = journal-acmtransalgorithms-it-long} @string{journal-actainform = journal-actainform-long} % publisher-springer @string{journal-actamath = journal-actamath-long} % publisher-springer @string{journal-anndiscretemath = journal-anndiscretemath-long} % publisher-elsevier @string{journal-annofmath = journal-annofmath-long} % publisher-princeton @string{journal-annofmath-it = journal-annofmath-it-long} @string{journal-annoperres = journal-annoperres-long} % publisher-springer @string{journal-annoperres-it = journal-annoperres-it-long} @string{journal-arscombin = journal-arscombin-long}} % Charles Babbage Res. Centre @string{journal-computgeom = journal-computgeom-long} % publisher-elsevier @string{journal-computapplmath = journal-computapplmath-long} % publisher-elsevier @string{journal-computmathappl = journal-computmathappl-long} % publisher-elsevier @string{journal-comptesrendus = journal-comptesrendus-long} % publisher-elsevier @string{journal-congrnumer = journal-congrnumer-long} % publisher-utilitas @string{journal-discreteapplmath = journal-discreteapplmath-long} % publisher-elsevier @string{journal-discreteapplmath-it = journal-discreteapplmath-it-long} @string{journal-discretecomputgeom = journal-discretecomputgeom-long} % publisher-springer @string{journal-discretemath = journal-discretemath-long} % publisher-elsevier @string{journal-discreteoptim = journal-discreteoptim-long} % publisher-elsevier @string{journal-discreteoptim-it = journal-discreteoptim-it-long} @string{journal-eatcsbulletin = journal-eatcsbulletin-long} @string{journal-europeanjoperres = journal-europeanjoperres-long} % publisher-elsevier @string{journal-fundmath = journal-fundmath-long} % publisher-impan @string{journal-graphscombin = journal-graphscombin-long} % publisher-springer @string{journal-intjfoundcs = journal-intjfoundcs-long} % publisher-worldscientific @string{journal-informandcomput = journal-informandcomput-long} % publisher-elsevier @string{journal-internatjcomputgeomappl = journal-internatjcomputgeomappl-long} % publisher-worldscientific @string{journal-internatmathnews = journal-internatmathnews-long} % publisher-oemg @string{journal-inttransoperres = journal-inttransoperres-long} % publisher-wileyblackwell @string{journal-ipl = journal-ipl-long} % publisher-elsevier @string{journal-ipl-it = journal-ipl-it-long} @string{journal-jacm = journal-jacm-long} % publisher-acm @string{journal-jacm-it = journal-jacm-it-long} @string{journal-jair = journal-jair-long} % AI Access Found @string{journal-jalgorithms = journal-jalgorithms-long} % publisher-elsevier @string{journal-jalgorithms-it = journal-jalgorithms-it-long} @string{journal-jcombintheoryA = journal-jcombintheoryA-long} % publisher-elsevier @string{journal-jcombintheoryB = journal-jcombintheoryB-long} % publisher-elsevier @string{journal-jcomputbiol = journal-jcomputbiol-long} % publisher-maryannliebert @string{journal-jcss = journal-jcss-long} % publisher-elsevier @string{journal-jcss-it = journal-jcss-it-long} @string{journal-jdiscretealgorithms = journal-jdiscretealgorithms-long} % publisher-elsevier @string{journal-jdiscretealgorithms-it = journal-jdiscretealgorithms-it-long} @string{journal-jgraphalgorithmsappl = journal-jgraphalgorithmsappl-long} @string{journal-jgraphtheory = journal-jgraphtheory-long} % publisher-wiley @string{journal-linearalgebraappl = journal-linearalgebraappl-long} % publisher-elsevier @string{journal-machlearn = journal-machlearn-long} % publisher-springer @string{journal-mathprogram = journal-mathprogram-long}} % publisher-springer @string{journal-naturegenetics = journal-naturegenetics-long} @string{journal-navalreslogist = journal-navalreslogist-long} % publisher-wiley @string{journal-operres = journal-operres-long} % publisher-informs @string{journal-operreslett = journal-operreslett-long} % publisher-elsevier @string{journal-pacificjmath = journal-pacificjmath-long} % publisher-mathsciencesberkeley @string{journal-procams = journal-procams-long} % publisher-ams @string{journal-procnatlacadusa = journal-procnatlacadusa-long} % publisher-natlacadusa @string{journal-siamjcomput = journal-siamjcomput-long} % publisher-siam @string{journal-siamjcomput-it = journal-siamjcomput-it-long} @string{journal-siamjdiscretemath = journal-siamjdiscretemath-long} % publisher-siam @string{journal-siamjdiscretemath-it = journal-siamjdiscretemath-it-long} @string{journal-siamjoptim = journal-siamjoptim-long} % publisher-siam @string{journal-tcs = journal-tcs-long} % publisher-elsevier @string{journal-tcs-it = journal-tcs-it-long} @string{journal-tocs = journal-tocs-long} % publisher-springer @string{journal-tocs-it = journal-tocs-it-long} @string{journal-advapplmath = {Advances in Applied Mathematics}} % publisher-elsevier @string{journal-algorithmica = {Algorithmica}} % publisher-springer @string{journal-algorithmica-it = {\textit{Algorithmica}}} @string{journal-bioinformatics = {Bioinformatics}} % publisher-oxford @string{journal-bioinformatics-it = {\textit{Bioinformatics}}} @string{journal-combinatorica = {Combinatorica}} % publisher-springer @string{journal-combinatorica-it = {\textit{Combinatorica}}} @string{journal-computerjournal = {The Computer Journal}} % publisher-oxford @string{journal-comptesrendusoldI = {Comptes Rendus Hebdomadaires des S{\'e}ances de l'~ Acad{\'e}mie des Sciences, Paris}} @string{journal-comptesrendusoldII = {Comptes Rendus des S{\'e}ances Hebdomadaires, Acad{\'e}mie des Sciences, Paris}} @string{journal-csur = {ACM Computing Surveys}} % publisher-acm @string{journal-mathprogramstudy = {Mathematical Programming Study}} @string{journal-networks = {Networks}} % publisher-wiley @string{journal-siamjmethods = {SIAM Journal on Algebraic and Discrete Methods}} % ---------------------------------------------------------------------- @string{publisher-ams-long = {American Mathematical Society}} @string{publisher-dagstuhl-long = {In\-ter\-na\-ti\-o\-na\-les Be\-geg\-nungs- und For\-schungs\-zen\-trum f{\"u}r In\-for\-ma\-tik (IBFI), Schloss Dag\-stuhl, Germany}} @string{publisher-eatcs-long = {European Association for Theoretical Computer Science}} @string{publisher-freeman-long = {W.~H.~Freeman and Company}} @string{publisher-ieeecas-long = {IEEE Circuits and Systems Society}} @string{publisher-siam-long = {Society for Industrial and Applied Mathematics}} @string{publisher-ams-short = {AMS}} @string{publisher-dagstuhl-short = {IBFI Dagstuhl, Germany}} @string{publisher-eatcs-short = {EATCS}} @string{publisher-freeman-short = {Freeman}} @string{publisher-ieeecas-short = {IEEE CAS}} @string{publisher-siam-short = {SIAM}} @string{publisher-ams = publisher-ams-short} @string{publisher-dagstuhl = publisher-dagstuhl-short} @string{publisher-eatcs = publisher-eatcs-short} @string{publisher-freeman = publisher-freeman-short} @string{publisher-ieeecas = publisher-ieeecas-short} @string{publisher-siam = publisher-siam-short} @string{publisher-academic = {Academic Press}} @string{publisher-acm = {ACM~Press}} @string{publisher-acmsiam = {ACM/SIAM}} @string{publisher-acs = {Australian Computer Society}} @string{publisher-addisonwesley = {Addison-Wesley}} @string{publisher-blackwell = {Blackwell Publishing}} @string{publisher-cambridge = {Cambridge University Press}} @string{publisher-carletonsc = {Carleton Scientific}} @string{publisher-carletonup = {Carleton University Press}} @string{publisher-chapmanhall = {Chapman {\&} Hall}} @string{publisher-clarendon = {Clarendon Press}} @string{publisher-collegepublications = {College Publications}} @string{publisher-dover = {Dover Publications Inc.}} @string{publisher-elsevier = {Elsevier~B.~V.}} @string{publisher-gruyter = {Gruyter}} @string{publisher-hanser = {Hanser Ver\-lag}} @string{publisher-harvard = {Harvard University Press}} @string{publisher-humana = {Humana Press}} @string{publisher-ieee = {IEEE}} @string{publisher-ieeecs = {IEEE Computer Society Press}} @string{publisher-impan = {Institute of Mathematics, Polish Academy of Sciences}} @string{publisher-informs = {INFORMS}} @string{publisher-kluwer = {Kluwer Academic Publishers}} @string{publisher-maryannliebert = {Mary Ann Liebert Inc.}} @string{publisher-mathsciencesberkeley = {Mathematics Sciences Publishers}} @string{publisher-mit = {MIT Press}} @string{publisher-morgankaufmann = {Morgan Kaufmann}} @string{publisher-natlacadusa = {The National Academy of Sciences of the USA}} @string{publisher-northholland = {North-Holland}} @string{publisher-oemg = {{\"O}ster\-reich\-ische Ma\-the\-ma\-ti\-sche Ge\-sell\-schaft}} @string{publisher-oxford = {Oxford University Press}} @string{publisher-plenum = {Plenum Press}} @string{publisher-prenticehall = {Prentice Hall}} @string{publisher-princeton = {Princeton University Press}} @string{publisher-springer = {Springer}} @string{publisher-utilitas = {Utilitas Mathematica Publishing Inc.}} @string{publisher-wiley = {Wiley}} @string{publisher-wileyblackwell = {Wiley-Blackwell}} @string{publisher-worldscientific = {World Scientific Publishing Co.}} % ---------------------------------------------------------------------- @string{series-acs-crpit-long = {Conferences in Research and Practice in Information Technology}} @string{series-springer-lectnoteseconmathsyst-long = {Lecture Notes in Economics and Mathematical Systems}} @string{series-springer-lnbi-long = {Lecture Notes in Bioinformatics}} @string{series-springer-lnbi-it-long = {\textit{Lecture Notes in Bioinformatics}}} @string{series-springer-lncs-long = {Lecture Notes in Computer Science}} @string{series-springer-lncs-it-long = {\textit{Lecture Notes in Computer Science}}} @string{series-acs-crpit-short = {CRPIT}} @string{series-springer-lectnoteseconmathsyst-short = {Lect.\ Notes Econ.\ Math.\ Syst.}} @string{series-springer-lncs-short = {LNCS}} @string{series-springer-lncs-it-short = {\textit{LNCS}}} @string{series-springer-lnbi-short = {LNBI}} @string{series-springer-lnbi-it-short = {\textit{LNBI}}} @string{series-acs-crpit = series-acs-crpit-short} @string{series-springer-lectnoteseconmathsyst = series-springer-lectnoteseconmathsyst-short} @string{series-springer-lncs = series-springer-lncs-short} @string{series-springer-lncs-it = series-springer-lncs-it-short} @string{series-springer-lnbi = series-springer-lnbi-short} @string{series-springer-lnbi-it = series-springer-lnbi-it-short} @string{series-ams-dimacsmonographs = {DIMACS Monographs}} @string{series-elsevier-anndiscretemath = {Annals of Discrete Mathematics}} @string{series-collegepublications-algorithmics = {Texts in Algorithmics}} @string{series-siam-monographsdiscretemathappl = {SIAM Monographs on Discrete Mathematics and Applications}} @string{series-springer-lectnoteseconmathsystItoXV = {Lecture Notes in Operations Research and Mathematical Economics}} @string{series-springer-lectnoteseconmathsystXVItoLIX = {Lecture Notes in Operations Research and Mathematical Systems}} @string{series-wiley-dmo = {Discrete Mathematics and Optimization}} @string{series-worldscientific-advancesbioinf = {Advances in Bioinformatics and Computational Biology}} % ---------------------------------------------------------------------- @string{institution-arxiv-long = {arXiv.org, Cornell University Library}} @string{institution-eccc-long = {Electronic Colloquium on Computational Complexity (ECCC)}} @string{institution-arxiv-short = {arXiv.org}} @string{institution-eccc-short = {ECCC}} @string{institution-arxiv = institution-arxiv-short} @string{institution-eccc = institution-eccc-long} @string{institution-bonndiskretemathematik = {For\-schungs\-in\-sti\-tut f{\"u}r Dis\-kre\-te Ma\-the\-ma\-tik, Uni\-ver\-si\-t{\"a}t Bonn, Germany}} @string{institution-budapesttecs = {Dept.\ Computer Science, Budapest University of Technology and Economics, Hungary}} @string{institution-carletoncs = {School of Computer Science, Carleton University, Ottawa, Canada}} @string{institution-clay = {The Clay Mathematics Institute of Cambridge, Massachusetts, USA}} @string{institution-fsuinf = {In\-sti\-tut f{\"u}r In\-for\-ma\-tik, Fried\-rich-Schil\-ler-Uni\-ver\-si\-t{\"a}t Je\-na, Germany}} @string{institution-kaiserslautern = {University of Kai\-sers\-lau\-tern, Germany}} @string{institution-princetoncs = {Department of Computer Science, Princeton University, USA}} @string{institution-rand = {The Rand Corporation, Santa Monica, USA}} @string{institution-stanford = {Stanford University, USA}} @string{institution-telavivcs = {Department of Computer Science, Tel Aviv University, Israel}} @string{institution-torontocs = {Department of Computer Science, University of Toronto, Canada}} @string{institution-tuebingeninf = {Wil\-helm-Schickard-In\-sti\-tut f{\"u}r In\-for\-ma\-tik, Uni\-ver\-si\-t{\"a}t T{\"u}\-bin\-gen, Germany}} @string{institution-utrechtcs = {Institute of Information and Computing Sciences, Utrecht University, Netherlands}} @string{institution-waterlooco = {Department of Combinatorics and Optimization, University of Waterloo, Canada}} @string{institution-waterloocs = {School of Computer Science, University of Waterloo, Canada}} % ---------------------------------------------------------------------- % Entries: @Misc{ ISGCIGraphClasses, title = {Graphclasses in {ISGCI}}, howpublished = {Online database}, myyear = {2002}, year = {2008}, note = {\biburl{http://wwwteo.informatik.uni-rostock.de/isgci/classes.cgi}} } @Misc{ GLPK, title = {{GNU} {L}inear {P}rogramming {K}it}, howpublished = {Homepage of the {GLPK} software package}, myyear = {2000}, year = {2008}, note = {\biburl{http://www.gnu.org/software/glpk}} } @Misc{ ClayProblems, title = {Millennium Prize Problems}, howpublished = {Web page by } # institution-clay, myyear = {2000}, year = {2009}, note = {\biburl{http://www.claymath.org/millennium}} } @Unpublished{ BGNxx, author = {Nadja Betzler and Jiong Guo and Rolf Niedermeier}, title = {Parameterized Computational Complexity of {D}odgson and {Y}oung Elections}, year = {2008}, note = {Submitted} } @Misc{ BFKNxx, author = {Nadja Betzler and Michael R. Fellows and Christian Komusiewicz and Rolf Niedermeier}, title = {Parameterized Algorithms and Hardness Results for Some Graph Motif Problems}, year = {2008}, note = {Submitted} } @Article{ DHxx, author = {Erik D. Demaine and MohammadTaghi Hajiaghayi}, title = {The Bidimensionality Theory and Its Algorithmic Applications}, journal = journal-computerjournal, publisher = publisher-oxford, year = {2008}, note = {To appear} } @InCollection{ DHNxx, author = {Michael Dom and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Depth-First Search ({A}riadne \& {C}o.)}, editor = {Berthold V{\"o}cking and Helmut Alt and Martin Dietzfelbinger and R{\"u}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, publisher = {Springer}, series = {eXamen.press}, note = {To appear} } @Misc{ FGMNxx, author = {Michael R. Fellows and Jiong Guo and Hannes Moser and Rolf Niedermeier}, title = {A Generalization of {N}emhauser and {T}rotter's Local Optimization Algorithm}, note = {Submitted}, year = {2008} } @InProceedings{ GMNxx, author = {Jiong Guo and Hannes Moser and Rolf Niedermeier}, title = {Iterative Compression for Exactly Solving {NP}-Hard Minimization Problems}, booktitle = {``Algorithmics of Large and Complex Networks''}, mybooktitle = {DFG SPP~1126 ``Algorithmics of Large and Complex Networks''}, publisher = publisher-springer, series = series-springer-lncs, note = {To appear} } @Unpublished{ HGPSxx, author = {Falk H{\"{u}}ffner and Spencer Graves and Hans-Peter Piepho and Tamara Steijger}, title = {Visualizing paired comparisons---the {multcompView} package}, note = {To be submitted to \bibremark{No string.}\textit{R~News}} } @Misc{ Marxx, author = {Jerzy Martyna}, howpublished = {\bibremark{No string.}Zentralblatt MATH Review 1095.68038}, publisher = publisher-springer } @Article{ MSxx, author = {Hannes Moser and Somnath Sikdar}, title = {The Parameterized Complexity of the Induced Matching Problem in Planar Graphs}, journal = journal-discreteapplmath, publisher = publisher-elsevier, year = {2008}, note = {Submitted for publication} } @Article{ RSxx, author = {Venkatesh Raman and Saket Saurabh}, title = {Short Cycles make {W}-hard problems hard: {FPT} algorithms for {W}-hard Problems in Graphs with no short Cycles}, journal = journal-algorithmica, publisher = publisher-springer, year = {2008}, note = {To appear}, mynote = {A preliminary version of this paper appeared under the title ``Triangles, 4-Cycles and Parameterized (In-)Tractability'' in } # proc-swat-06-it # {, volume~4059 of } # series-springer-lncs-it # {, pages~304--315. } # publisher-springer # {, 2006} } @Article{ DGHNT10, author = {Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier and Anke Truss}, title = {Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, year = {2010}, volume = {8}, number = {1}, pages = {76--86}, myurl = {http://dx.doi.org/10.1016/j.jda.2009.08.001}, doi = {10.1016/j.jda.2009.08.001} } @Article{ DGN10, author = {Michael Dom and Jiong Guo and Rolf Niedermeier}, title = {Approximation and Fixed-Parameter Algorithms for Consecutive Ones Submatrix Problems}, journal = journal-jcss, publisher = publisher-elsevier, year = {2010}, volume = {76}, number = {3--4}, pages = {204--221}, myurl = {http://dx.doi.org/10.1016/j.jcss.2009.07.001}, doi = {10.1016/j.jcss.2009.07.001} } difficult name @Book{ BG09, author = {J{\o}rgen Bang{-}Jensen and Gregory Gutin}, title = {Digraphs: Theory, Algorithms and Applications}, publisher = publisher-springer, year = {2009}, edition = {2nd} } @InProceedings{ DFR09, author = {Michael Dom and Michael R. Fellows and Frances A. Rosamond}, title = {Parameterized Complexity of Stabbing Rectangles and Squares in the Plane}, booktitle = proc-walcom-09, publisher = publisher-springer, series = series-springer-lncs, volume = {5431}, pages = {298--309}, year = {2009}, myurl = {http://dx.doi.org/10.1007/978-3-642-00202-1_26}, doi = {10.1007/978-3-642-00202-1_26} } @InProceedings{ DLS09, author = {Michael Dom and Daniel Lokshtanov and Saket Saurabh}, title = {Incompressibility through Colors and {ID}s}, booktitle = proc-icalp-09, myeditor = {Susanne Albers}, publisher = publisher-springer, series = series-springer-lncs, volume = {5555}, pages = {378--389}, year = {2009}, myurl = {http://dx.doi.org/10.1007/978-3-642-02927-1_32}, doi = {10.1007/978-3-642-02927-1_32} } @Article{ Dom09, author = {Michael Dom}, title = {Algorithmic Aspects of the Consecutive-Ones Property}, journal = journal-eatcsbulletin, publisher = publisher-eatcs, volume = {98}, pages = {27--59}, year = {2009} } @article{ FHRV09, author = {Michael R. Fellows and Danny Hermelin and Frances A. Rosamond and St{\'e}phane Vialette}, title = {On the Parameterized Complexity of Multiple-Interval Graph Problems}, journal = journal-tcs, publisher = publisher-elsevier, volume = {410}, number = {1}, year = {2009}, pages = {53--61}, myurl = {http://dx.doi.org/10.1016/j.tcs.2008.09.065}, doi = {10.1016/j.tcs.2008.09.065} } @InProceedings{ GKRW09, author = {Panos Giannopoulos and Christian Knauer and G{\"u}nter Rote and Daniel Werner}, title = {Fixed-parameter tractability and lower bounds for stabbing problems}, booktitle = proc-eurocg-09, myeditor = {Stefan Langerman}, pages = {\bibremark{No publisher.}281--284}, year = {2009} } @article{ OR09, author = {Marcus Oswald and Gerhard Reinelt}, title = {The simultaneous consecutive ones problem}, journal = journal-tcs, publisher = publisher-elsevier, volume = {410}, number = {21--23}, pages = {1986--1992}, year = {2009}, doi = {10.1016/j.tcs.2008.12.039} } @InProceedings{ Tho09, author = { St{\'e}phan Thomass{\'e}}, title = {A Quadratic Kernel for Feedback Vertex Set}, booktitle = proc-soda-09, publisher = publisher-acmsiam, year = {2009}, note = {To appear} } difficult name @inproceedings{ACE+08, author = {Ernst Althaus and Stefan Canzar and Mark R. Emmett and Andreas Karrenbauer and Alan G. Marshall and Anke Meyer{-}Baese and Huimin Zhang}, title = {Computing {H/D}-exchange speeds of single residues from data of peptic fragments}, booktitle = proc-sac-08, pages = {1273--1277}, publisher = publisher-acm, year = {2008} } @article{ ACN08, author = {Nir Ailon and Moses Charikar and Alantha Newman}, title = {Aggregating inconsistent information: Ranking and clustering}, myjournal = journal-jacm, journal = journal-jacm # {\bibremark{No pages.}\textnormal{, 55(5), Article~23}}, publisher = publisher-acm, myvolume = {55}, mynumber = {5}, mypages = {\bibremark{No pages.}xx--xx}, year = {2008}, myurl = {http://doi.acm.org/10.1145/1411509.1411513} } @TechReport{ AG08TechReport, author = {Noga Alon and Shai Gutner}, title = {Kernels for the dominating set problem on graphs with an excluded minor}, institution = institution-eccc-long, year = {2008}, number = {TR08-066}, myurl = {http://www.cs.tau.ac.il/research/shai.gutner/papers/kernels.pdf} } @InProceedings{ BBBT08, author = {Sebastian B{\"{o}}cker and Sebastian Briesemeister and Quang Bao Anh Bui and Anke Tru{\ss}}, title = {A fixed-parameter approach for Weighted Cluster Editing}, booktitle = proc-apbc-08, series = series-worldscientific-advancesbioinf, volume = {5}, pages = {211--220}, publisher = {\bibremark{No string.}Imperial College Press}, year = {2008} } @InProceedings{ BDFH08ICALP, author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin}, title = {On Problems without Polynomial Kernels}, booktitle = proc-icalp-08, publisher = publisher-springer, series = series-springer-lncs, volume = {5125}, pages = {563--574}, year = {2008} } @TechReport{ BDFH08TechReport, author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin}, title = {On Problems Without Polynomial Kernels}, institution = institution-utrechtcs, year = {2008}, number = {UU-CS-2007-046}, myurl = {http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-046.pdf} } @InProceedings{ BH08, author = {Andreas Brandst{\"a}dt and Christian Hundt}, title = {Ptolemaic Graphs and Interval Graphs are Leaf Powers}, booktitle = proc-latin-08, publisher = publisher-springer, series = series-springer-lncs, year = {2008}, note = {To appear} } @InProceedings{ BFGNR08, author = {Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond}, title = {Fixed-Parameter Algorithms for {K}emeny Scores}, booktitle = proc-aaim-08, series = series-springer-lncs, publisher = publisher-springer, year = {2008}, volume = {5034}, pages = {60--71} } @TechReport{ BTY08, author = {Hans L. Bodlaender and Stephan Thomass{\'e} and Anders Yeo}, title = {Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels}, number = {UU-CS-2008-030}, institution = institution-utrechtcs, year = {2008} } @InProceedings{ CFLLV08, author = {Jianer Chen and Fedor V. Fomin and Yang Liu and Songjian Lu and Yngve Villanger}, title = {Improved algorithms for feedback vertex set problems}, publisher = publisher-elsevier, journal = journal-jcss, note = {To appear} } @Misc{ CFM08, author = {Yijia Chen and J{\"{o}}rg Flum and Moritz M{\"{u}}ller}, title = {Lower bounds for kernelization}, note = {Manuscript}, year = {2008} } @Article{ CLLOR08jacm, author = {Jianer Chen and Yang Liu and Songjian Lu and Barry O'Sullivan and Igor Razgon}, title = {A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem}, myjournal = journal-jacm, journal = journal-jacm # {\bibremark{No pages.}\textnormal{, 55(5), Article~21}}, publisher = publisher-acm, myvolume = {55}, mynumber = {5}, mypages = {\bibremark{No pages.}xx--xx}, year = {2008}, myurl = {http://doi.acm.org/10.1145/1411509.1411511} } @InProceedings{ CLLOR08STOC, author = {Jianer Chen and Yang Liu and Songjian Lu and Barry O'Sullivan and Igor Razgon}, title = {A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem}, booktitle = proc-stoc-08, myeditor = {Richard E. Ladner and Cynthia Dwork}, publisher = publisher-acm, year = {2008}, pages = {177--186}, myurl = {http://doi.acm.org/10.1145/1374376.1374404}, myeditor = {Richard E. Ladner and Cynthia Dwork} } @article{ CM08, author = {Jianer Chen and Jie Meng}, title = {On Parameterized Intractability: Hardness and Completeness}, journal = journal-computerjournal, publisher = publisher-oxford, volume = {51}, number = {1}, year = {2008}, pages = {39--59}, myurl = {http://dx.doi.org/10.1093/comjnl/bxm036}, doi = {10.1093/comjnl/bxm036} } @Article{ DGHN08, author = {Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {{C}losest 4-{L}eaf {P}ower is Fixed-Parameter Tractable}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {156}, number = {18}, pages = {3345--3361}, year = {2008}, myurl = {http://dx.doi.org/10.1016/j.dam.2008.01.007}, doi = {10.1016/j.dam.2008.01.007} } @Article{ DGNW08, author = {Michael Dom and Jiong Guo and Rolf Niedermeier and Sebastian Wernicke}, title = {Red-Blue Covering Problems and the Consecutive Ones Property}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, volume = {6}, number = {3}, pages = {393--407}, year = {2008}, myurl = {http://dx.doi.org/10.1016/j.jda.2007.11.002}, doi = {10.1016/j.jda.2007.11.002} } @InCollection{ DHN08, author = {Michael Dom and Falk H{\"u}ffner and Rolf Niedermeier}, title = {{T}ie\-fen\-su\-che ({A}ri\-ad\-ne und {C}o.)}, booktitle = {{T}a\-schen\-buch der {A}l\-go\-rith\-men}, editor = {Berthold V{\"o}cking and Helmut Alt and Martin Dietzfelbinger and R{\"u}diger Reischuk and Christian Scheideler and Heribert Vollmer and Dorothea Wagner}, publisher = publisher-springer, series = {\bibremark{No string.}eXamen.press}, year = {2008}, pages = {61--73}, doi = {10.1007/978-3-540-76394-9_7}, myurl = {http://dx.doi.org/10.1007/978-3-540-76394-9_7}, note = {In German language; English version to appear} } @InProceedings{ DLSV08, author = {Michael Dom and Daniel Lokshtanov and Saket Saurabh and Yngve Villanger}, title = {Capacitated Domination and Covering: A Parameterized Perspective}, booktitle = proc-iwpec-08, myeditor = {Martin Grohe and Rolf Niedermeier}, year = {2008}, publisher = publisher-springer, series = series-springer-lncs, volume = {5018}, pages = {78--90}, myurl = {http://dx.doi.org/10.1007/978-3-540-79723-4_9}, doi = {10.1007/978-3-540-79723-4_9} } @PhDThesis{ Dom08PhDThesis, author = {Michael Dom}, title = {Recognition, Generation, and Application of Binary Matrices with the Consecutive-Ones Property}, school = institution-fsuinf, year = {2008}, note = {Published by Cuvillier, 2009} } @InCollection{ Dom08Encycl, author = {Michael Dom}, title = {{S}et {C}over with Almost Consecutive Ones}, booktitle = {Encyclopedia of Algorithms}, editor = {Ming-Yang Kao}, publisher = publisher-springer, pages = {832--834}, year = {2008}, doi = {10.1007/978-0-387-30162-4_368}, myurl = {http://dx.doi.org/10.1007/978-0-387-30162-4_368} } @InProceedings{ DS08, author = {Michael Dom and Somnath Sikdar}, title = {The Parameterized Complexity of the Rectangle Stabbing Problem and its Variants}, booktitle = proc-faw-08, myeditor = {Franco P. Preparata and Xiaodong Wu and Jianping Yin}, year = {2008}, publisher = publisher-springer, series = series-springer-lncs, volume = {5059}, pages = {288--299}, myurl = {http://dx.doi.org/10.1007/978-3-540-69311-6_30}, doi = {10.1007/978-3-540-69311-6_30} } @article{ ELRSSS08, author = {Guy Even and Retsef Levi and Dror Rawitz and Baruch Schieber and Shimon Shahar and Maxim Sviridenko}, title = {Algorithms for Capacitated Rectangle Stabbing and Lot Sizing with Joint Set-Up Costs}, myjournal = journal-acmtransalgorithms, journal = journal-acmtransalgorithms # {\bibremark{No pages.}\textnormal{, 4(3), Article~34}}, publisher = publisher-acm, myvolume = {4}, mynumber = {3}, mypages = {\bibremark{No pages.}xx--xx}, year = {2008}, myurl = {http://doi.acm.org/10.1145/1367064.1367074}, doi = {10.1145/1367064.1367074} } @Article{ Fer08, author = {Henning Fernau}, title = {Parameterized Algorithmics for Linear Arrangement Problems}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {156}, number = {17}, pages = {3166--3177}, year = {2008}, doi = {10.1016/j.dam.2008.05.008} } @TechReport{ FFLRSV08, author = {Henning Fernau and Fedor V. Fomin and Daniel Lokshtanov and Daniel Raible and Saket Saurabh and Yngve Villanger}, title = {Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves}, institution = institution-arxiv, number = {abs/0810.4796}, year = {2008}, myurl = {http://arxiv.org/abs/0810.4796} } @InProceedings{ FGKLS08, author = {Fedor Fomin and Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Saket Saurabh}, title = {Iterative Compression and Exact Algorithms}, booktitle = proc-mfcs-08, myeditor = {Edward Ochmanski and Jerzy Tyszkiewicz}, publisher = publisher-springer, series = series-springer-lncs, volume = {5162}, pages = {335--346}, year = {2008}, myurl = {http://dx.doi.org/10.1007/978-3-540-85238-4_27}, doi = {10.1007/978-3-540-85238-4_27} } @InCollection{ FHHR08, author = {Piotr Faliszewski and Edith Hemaspaandra and Lane A. Hemaspaandra and J{\"{o}}rg Rothe}, title = {A richer understanding of the complexity of election systems}, booktitle = {Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz}, publisher = publisher-springer, note = {To appear}, year = {2008} } @InProceedings{ FS08, author = {Lance Fortnow and Rahul Santhanam}, title = {Infeasibility of instance compression and succinct {PCPs} for~{NP}}, booktitle = proc-stoc-08, publisher = publisher-acm, year = {2008}, note = {To appear} } @InProceedings{ GHKZ08, author = {Jiong Guo and Falk H{\"{u}}ffner and Christian Komusiewicz and Yong Zhang}, title = {Improved Algorithms for Bicluster Editing}, booktitle = proc-tamc-08, series = series-springer-lncs, volume = {4978}, publisher = publisher-springer, year = {2008}, note = {To appear} } @Article{ GK08, author = {Gasarch, William and Kin, Keung Ma}, title = {{Invitation to Fixed-Parameter Algorithms * Parameterized Complexity Theory * Parameterized Algorithmics: Theory, Practice and Prospects}}, journal = journal-computerjournal, publisher = publisher-oxford, volume = {51}, number = {1}, pages = {137--140}, year = {2008}, doi = {10.1093/comjnl/bxm047}, myurl = {http://comjnl.oxfordjournals.org/cgi/reprint/51/1/137.pdf} } @Article{ GKW08, author = {Panos Giannopoulos and Christian Knauer and Sue Whitesides}, title = {Parameterized Complexity of Geometric Problems}, journal = journal-computerjournal, volume = {51}, number = {3}, pages = {372--384}, publisher = publisher-oxford, doi = {10.1093/comjnl/bxm053}, year = {2008} } @InCollection{ Guo08, author = {Jiong Guo}, title = {{U}ndirected {F}eedback {V}ertex {S}et}, booktitle = {Encyclopedia of Algorithms}, editor = {Ming-Yang Kao}, publisher = publisher-springer, pages = {995--996}, year = {2008} } @Article{ Gup08, author = {Sushmita Gupta}, title = {Feedback Arc Set Problem in Bipartite Tournaments}, journal = journal-ipl, publisher = publisher-elsevier, volume = {105}, number = {5}, pages = {150--154}, year = {2008}, doi = {10.1016/j.ipl.2007.08.023} } @InProceedings{ HKMN08LATIN, author = {Falk H{\"{u}}ffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier}, title = {Fixed-Parameter Algorithms for Cluster Vertex Deletion}, booktitle = proc-latin-08, series = series-springer-lncs, publisher = publisher-springer, volume = {4957}, pages = {711--722}, year = {2008}, note = {Journal version to appear in } # journal-tocs-it } old key: HKMN08X @InProceedings{ HKMN08COCOA, author = {Falk H{\"u}ffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier}, title = {Enumerating Isolated Cliques in Financial and Synthetic Networks}, booktitle = proc-cocoa-08, series = series-springer-lncs, publisher = publisher-springer, year = {2008}, note = {To appear} } @Article{ HL08, author = {Salim Haddadi and Zoubir Layouni}, title = {Consecutive Block Minimization is {$1.5$}-Approximable}, journal = journal-ipl, publisher = publisher-elsevier, volume = {108}, pages = {132--135}, year = {2008} } @InCollection{ HNW08Bioinformatics, author = {Falk H{\"u}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems}, booktitle = {Bioinformatics}, series = {\bibremark{No string.}Methods in Molecular Biology Series}, publisher = publisher-humana, volume = {453}, year = {2008} } old key: HNW08 @Article{ HNW08computerjournal, author = {Falk H{\"{u}}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Techniques for Practical Fixed-Parameter Algorithms}, journal = journal-computerjournal, publisher = publisher-oxford, volume = {51}, number = {1}, pages = {7--25}, year = {2008}, doi = {10.1093/comjnl/bxm040} } old key: Hue07Encycl @InCollection{ Hue08Encycl, author = {Falk H{\"u}ffner}, title = {Automated Search Tree Generation}, booktitle = {Encyclopedia of Algorithms}, editor = {Ming-Yang Kao}, publisher = publisher-springer, pages = {78--81}, year = {2008} } old key: HWZ07Algorithmica @Article{ HWZ08Algorithmica, author = {Falk H{\"u}ffner and Sebastian Wernicke and Thomas Zichner}, title = {Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection}, journal = journal-algorithmica, publisher = publisher-springer, volume = {52}, number = {2}, year = {2008}, pages = {114--132}, myurl = {http://dx.doi.org/10.1007/s00453-007-9008-7}, doi = {10.1007/s00453-007-9008-7} } @Book{ JM08, author = {Klaus Jansen and Marian Margraf}, title = {Approximative Algorithmen und Nichtapproximierbarkeit}, publisher = publisher-gruyter, year = {2008}, note = {In German language} } @Article{ KR08, author = {Subhash Khot and Oded Regev}, title = {Vertex cover might be hard to approximate to within {$2-\epsilon$}}, journal = journal-jcss, publisher = publisher-elsevier, volume = {74}, number = {3}, pages = {335--349}, year = {2008}, doi = {10.1016/j.jcss.2007.06.019} } @InProceedings{ MR08, author = {Egbert Mujuni and Frances A. Rosamond}, title = {Parameterized Complexity of the Clique Partition Problem}, booktitle = proc-cats-08, series = series-acs-crpit, volume = {77}, pages = {75--78}, publisher = publisher-acs, year = {2008}, myurl = {http://crpit.com/confpapers/CRPITV77Mujuni.pdf} } @article{ MRR08, author = {Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, title = {Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover}, journal = journal-tocs, publisher = publisher-springer, volume = {43}, number = {2}, year = {2008}, pages = {234--253}, myurl = {http://dx.doi.org/10.1007/s00224-007-9089-3}, doi = {10.1007/s00224-007-9089-3} } @InCollection{ Nie08, author = {Rolf Niedermeier}, title = {Data Reduction for Domination in Graphs}, booktitle = {Encyclopedia of Algorithms}, editor = {Ming-Yang Kao}, publisher = publisher-springer, pages = {220--222}, year = {2008} } @InProceedings{ PHN08, author = {Oriana Ponta and Falk H{\"{u}}ffner and Rolf Niedermeier}, title = {Speeding up Dynamic Programming for some {NP}-hard Graph Recoloring Problems}, booktitle = proc-tamc-08, series = series-springer-lncs, volume = {4978}, publisher = publisher-springer, year = {2008}, note = {To appear} } @TechReport{ RO08, author = {Igor Razgon and Barry O'Sullivan}, title = {Almost {2-SAT} is Fixed-Parameter Tractable}, institution = institution-arxiv, year = {2008}, number = {arXiv:0801.1300}, myurl = {http://arxiv.org/abs/0801.1300} } @Article{ Sas08, author = {Prashant Sasatte}, title = {Improved approximation algorithm for the feedback set problem in a bipartite tournament}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {36}, number = {5}, year = {2008}, pages = {602--604}, myurl = {http://dx.doi.org/10.1016/j.orl.2007.12.005}, doi = {10.1016/j.orl.2007.12.005} } @Article{ Woe08, author = {Gerhard J. Woeginger}, title = {Open problems around exact algorithms}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {156}, number = {3}, pages = {397--405}, year = {2008}, doi = {10.1016/j.dam.2007.03.023} } @InProceedings{ ZPR08, author = {Michael Zuckerman and Ariel D. Procaccia and Jeffrey S. Rosenschein}, title = {Algorithms for the Coalitional Manipulation Problem}, booktitle = proc-soda-08, pages = {277--286}, publisher = publisher-acmsiam, year = {2008} } difficult name @InProceedings{ Abu07, author = {Faisal N. Abu{-}Khzam}, title = {Kernelization algorithms for {$d$}-{H}itting {S}et problems}, booktitle = proc-wads-07, series = series-springer-lncs, volume = {4619}, pages = {434--445}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-73951-7_38} } difficult name @Article{ AFLS07, author = {Faisal N. Abu{-}Khzam and Michael R. Fellows and Michael A. Langston and W. Henry Suters}, title = {Crown Structures for Vertex Cover Kernelization}, journal = journal-tocs, volume = {41}, number = {3}, pages = {411--430}, publisher = publisher-springer, year = {2007}, doi = {10.1007/s00224-007-1328-0} } @Article{ AL07, author = {Adi Avidor and Michael Langberg}, title = {The multi-multiway cut problem}, journal = journal-tcs, publisher = publisher-elsevier, volume = {377}, number = {1--3}, pages = {35--42}, year = {2007}, doi = {10.1016/j.tcs.2007.02.026} } @Unpublished{ BBBT07, author = {Sebastian B{\"o}cker and Sebastian Briesemeister and Quang Bao Anh Bui and Anke Tru{\ss}}, title = {{PEACE}: Parameterized and Exact Algorithms for Cluster Editing}, year = {2007}, note = {\bibremark{No string.}Manuscript, Lehrstuhl f\"ur Bioinformatik, Friedrich-Schiller-Universit\"at Jena}, month = sep } @Unpublished{ BBT07, author = {Sebastian B{\"o}cker and Quang Bao Anh Bui and Anke Tru{\ss}}, title = {A fixed-parameter approach for weighted cluster editing}, year = {2007}, note = {\bibremark{No string.}Manuscript, Lehrstuhl f\"ur Bioinformatik, Friedrich-Schiller-Universit\"at Jena}, month = may } @InProceedings{ BF07, author = {Felix Brandt and Felix Fischer}, title = {Computational aspects of covering in dominance graphs}, booktitle = {\bibremark{No string.}Proceedings of the 22nd Conference on Artificial Intelligence (AAAI~'07)}, pages = {694--699}, publisher = {\bibremark{No string.}AAAI Press}, year = {2007}, myeditor = {R. C. Holte and A. Howe} } @InProceedings{ BFH07, author = {Felix Brandt and Felix Fischer and Paul Harrenstein}, title = { The computational complexity of choice sets}, booktitle = {\bibremark{No string.}Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK~'07)}, pages = {82--91}, publisher = publisher-acm, year = {2007}, myeditor = {D. Samet} } @Article{ BFSS07, author = {Holger Bast and Stefan Funke and Peter Sanders and Dominik Schultes}, title = {Fast Routing in Road Networks with Transit Nodes}, journal = {\bibremark{No string.}Science\bibremark{No publisher.}}, volume = {316}, number = {5824}, pages = {566}, year = {2007}, doi = {10.1126/science.1137521} } @Article{ BGP07, author = {Ralf Bornd{\"o}rfer and Martin Gr{\"o}tschel and Marc E. Pfetsch}, title = {A Column-Generation Approach to Line Planning in Public Transport}, journal = {\bibremark{No string.}Transportation Science\bibremark{No publisher.}}, volume = {41}, number = {1}, pages = {123--132}, year = {2007}, doi = {10.1287/trsc.1060.0161} } @Article{ BGW07, author = {Ulrik Brandes and Marco Gaertler and Dorothea Wagner}, title = {Engineering graph clustering: Models and experimental evaluation}, journal = {\bibremark{No string.}ACM Journal of Experimental Algorithms}, publisher = publisher-acm, volume = {12}, year = {2007}, myurl = {http://doi.acm.org/10.1145/1227161.1227162} } @InProceedings{ BHKK07, author = {Andreas Bj{\"o}rklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto}, title = {Fourier meets {M\"o}bius: fast subset convolution}, booktitle = proc-stoc-07, pages = {67--74}, publisher = publisher-acm, year = {2007}, doi = {10.1145/1250790.1250801} } difficult name @Article{ BHMY07, author = {J{\o}rgen Bang{-}Jensen and Jing Huang and Gary MacGillivray and Anders Yeo}, title = {Domination in convex bipartite and convex-round graphs}, journal = {\bibremark{No string.}International Journal of Mathematical Sciences\bibremark{No publisher.}}, year = {2007} } @Article{ BK07, author = {Hans L. Bodlaender and Arie M. C. A. Koster}, title = {Combinatorial Optimization on Graphs of Bounded Treewidth}, journal = journal-computerjournal, publisher = publisher-oxford, year = {2007}, note = {To appear}, doi = {10.1093/comjnl/bxm037} } @InProceedings{ Bod07, author = {Hans L. Bodlaender}, title = {A Cubic Kernel for Feedback Vertex Set}, booktitle = proc-stacs-07, series = series-springer-lncs, volume = {4393}, pages = {320--331}, publisher = publisher-springer, year = {2007} } @InProceedings{ CELM07, author = { Yann Chevaleyre and Ulle Endriss and J{\'e}r{\^o}me Lang and Nicolas Maudet}, title = {A short introduction to computational social choice (Invited paper)}, booktitle = proc-sofsem-07, series = series-springer-lncs, volume = {4362}, pages = {51--69}, publisher = publisher-springer, year = {2007} } @InProceedings{ CFLLV07, author = {Jianer Chen and Fedor V. Fomin and Yang Liu and Songjian Lu and Yngve Villanger}, title = {Improved algorithms for the feedback vertex set problems}, booktitle = proc-wads-07, series = series-springer-lncs, volume = {4619}, pages = {422--433}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-73951-7_37}, note = {To appear in } # journal-jcss-it } @Article{ CFRS07, author = {Robin Christian and Michael R. Fellows and Frances A. Rosamond and Arkadii Slinko}, title = {On complexity of lobbying in multiple referenda}, journal = {\bibremark{No string.}Review of Economic Design\bibremark{No publisher.}}, volume = {11}, number = {3}, pages = {217--224}, year = {2007}, doi = {10.1007/s10058-007-0028-1} } @Article{ CH07, author = {Ir{\`e}ne Charon and Olivier Hudry}, title = {A survey on the linear ordering problem for weighted or unweighted tournaments}, journal = {\bibremark{No string.}4OR: A Quarterly Journal of Operations Research\bibremark{No publisher.}}, volume = {5}, number = {1}, pages = {5--60}, year = {2007}, doi = {10.1007/s10288-007-0036-6} } @Article{ CHLRS07, author = {Liming Cai and Xiuzhen Huang and Chunmei Liu and Frances A. Rosamond and Yinglei Song}, title = {Parameterized Complexity and Biopolymer Sequence Comparison}, journal = journal-computerjournal, publisher = publisher-oxford, year = {2007}, note = {To appear}, doi = {10.1093/comjnl/bxm035} } @InProceedings{ CK07, author = {Maw-Shang Chang and Ming-Tat Ko}, title = {The 3-{S}teiner Root Problem}, booktitle = proc-wg-07, publisher = publisher-springer, series = series-springer-lncs, volume = {4769}, pages = {109--120}, year = {2007} } @Article{ CKSXZ07, author = {Charles Chiang and Andrew B. Kahng and Subarna Sinha and Xu Xu and Alexander Z. Zelikovsky}, title = {Fast and Efficient Bright-Field {AAPSM} Conflict Detection and Correction}, journal = {\bibremark{No string.}IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\bibremark{No publisher.}}, volume = {26}, number = {1}, pages = {115--126}, year = {2007}, doi = {10.1109/TCAD.2006.882642} } @TechReport{ CLL07, author = {Jianer Chen and Yang Liu and Songjian Lu}, title = {Directed Feedback Vertex Set Problem is {FPT}}, number = {2007-7-1}, institution = {\bibremark{No string.}Texas A{\&}M University, Department of Computer Science}, year = {2007}, mymonth = jul } @InProceedings{ CLSZ07, author = {Jianer Chen and Songjian Lu and Sing-Hoi Sze and Fenghui Zhang}, title = {Improved Algorithms for Path, Matching, and Packing Problems}, booktitle = proc-soda-07, pages = {298--307}, publisher = publisher-acmsiam, year = {2007}, myurl = {http://doi.acm.org/10.1145/1283383.1283415} } @Article{ CM07, author = {Denis Cornaz and Ali Ridha Mahjoub}, title = {The maximum induced bipartite subgraph problem with edge weights}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {21}, number = {3}, pages = {662--675}, year = {2007}, doi = {10.1137/060650015} } @InProceedings{ CMRS07, author = {Rodolfo Carvajal and Mart\'{\i}n Matamala and Ivan Rapaport and Nicolas Schabanel}, title = {Small Alliances in Graphs}, booktitle = proc-mfcs-07, series = series-springer-lncs, volume = {4708}, pages = {218--227}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-74456-6_21} } @Article{ CSL07, author = {Vincent Conitzer and Tuomas Sandholm and J{\'e}r{\^o}me Lang}, title = {When are elections with few candidates hard to manipulate?}, journal = journal-jacm, publisher = publisher-acm, volume = {54}, number = {3}, pages = {1--33}, year = {2007} } @InProceedings{ CS07, author = {Paola Cappanera and Maria Grazia Scutell{\`a}}, title = {Balanced paths in telecommunication networks: some computational results}, booktitle = {\bibremark{No string.}Proceedings of the 3rd International Network Optimization Conference (INOC~'07)\bibremark{No publisher.}}, year = {2007} } @Article{ CST+07, author = {Victoria J. Cook and Sumi J. Sun and Jane Tapia and Stephen Q. Muth and D. Ferm{\'{i}}n Arg{\"{u}}ello and Bryan L. Lewis and Richard B. Rothenberg and Peter D. McElroy and the Network Analysis Project Team}, title = {Transmission Network Analysis in Tuberculosis Contact Investigations}, journal = {\bibremark{No string.}Journal of Infectious Diseases}, volume = {196}, pages = {1517--1527}, publisher = {\bibremark{No string.}University of Chicago Press}, year = {2007} } @Article{ CTY07, author = {Pierre Charbit and St{\'e}phan Thomass{\'e} and Anders Yeo}, title = {The Minimum Feedback Arc Set Problem is {NP}-Hard for Tournaments}, journal = {\bibremark{No string.}Combinatorics, Probability and Computing\bibremark{No publisher.}}, volume = {16}, pages = {1--4}, year = {2007}, doi = {10.1017/S0963548306007887} } @article{ CV07, author = {Kenneth L. Clarkson and Kasturi R. Varadarajan}, title = {Improved Approximation Algorithms for Geometric Set Cover}, journal = journal-discretecomputgeom, publisher = publisher-springer, volume = {37}, number = {1}, year = {2007}, pages = {43--58}, myurl = {http://dx.doi.org/10.1007/s00454-006-1273-8}, doi = {10.1007/s00454-006-1273-8} } @InProceedings{ DBK07, author = {Pawan Deshpande and Regina Barzilay and David R. Karger}, title = {Randomized Decoding for Selection-and-Ordering Problems}, booktitle = {\bibremark{No string.}Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technologies (NAACL HLT~'07)}, pages = {444--451}, publisher = {\bibremark{No string.}Association for Computational Linguistics}, year = {2007}, myurl = {http://www.aclweb.org/anthology/N/N07/N07-1056} } @Article{ DESZ07, author = {Bhaskar DasGupta and German Andres Enciso and Eduardo D. Sontag and Yi Zhang}, title = {Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems}, journal = {\bibremark{No string.}Biosystems\bibremark{No publisher.}}, volume = {90}, number = {1}, pages = {161--178}, year = {2007}, doi = {10.1016/j.biosystems.2006.08.001} } @InCollection{ Dom07, author = {Michael Dom}, title = {Compact Routing}, booktitle = {Algorithms for Sensor and Ad Hoc Networks}, editor = {Dorothea Wagner and Roger Wattenhofer}, publisher = publisher-springer, series = series-springer-lncs, volume = {4621}, pages = {187--202}, year = {2007}, myurl = {http://dx.doi.org/10.1007/978-3-540-74991-2_10}, doi = {10.1007/978-3-540-74991-2_10} } @Article{ DFLRS07, author = {Frank K. H. A. Dehne and Michael R. Fellows and Michael A. Langston and Frances A. Rosamond and Kim Stevens}, title = {An {$O(2^{O(k)} n^3)$} {FPT} Algorithm for the Undirected Feedback Vertex Set Problem}, journal = journal-tocs, publisher = publisher-springer, volume = {41}, number = {3}, pages = {479--492}, year = {2007}, doi = {10.1007/s00224-007-1345-z} } @InProceedings{ DGN07, author = {Michael Dom and Jiong Guo and Rolf Niedermeier}, title = {Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems}, booktitle = proc-tamc-07, publisher = publisher-springer, series = series-springer-lncs, volume = {4484}, pages = {680--691}, year = {2007}, myurl = {http://dx.doi.org/10.1007/978-3-540-72504-6_62}, doi = {10.1007/978-3-540-72504-6_62}, note = {Journal version appeared in } # journal-jcss-it } @Article{ DK07, author = {Josep D{\'i}az and Marcin J. Kami{\'n}ski}, title = {{MAX-CUT} and {MAX-BISECTION} are {NP}-hard on unit disk graphs}, journal = journal-tcs, publisher = publisher-elsevier, volume = {377}, number = {1--3}, pages = {271--276}, year = {2007}, doi = {10.1016/j.tcs.2007.02.013} } difficult name @Article{ DKP07, author = {Della{ }Croce, Federico and Marcin J. Kami{\'n}ski and Vangelis Th. Paschos}, title = {An exact algorithm for {MAX-CUT} in sparse graphs}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {35}, number = {3}, pages = {403--408}, year = {2007}, doi = {10.1016/j.orl.2006.04.001} } @InProceedings{ DN07, author = {Michael Dom and Rolf Niedermeier}, title = {The Search for Consecutive Ones Submatrices: Faster and More General}, booktitle = proc-acid-07, year = {2007}, publisher = publisher-collegepublications, series = series-collegepublications-algorithmics, volume = {9}, pages = {43--54}, note = {Journal version appeared in } # journal-jcss-it } @InProceedings{ DSGRBS07, author = {Banu Dost and Tomer Shlomi and Nitin Gupta and Eytan Ruppin and Vineet Bafna and Roded Sharan}, title = {{QNet}: A Tool for Querying Protein Interaction Networks}, booktitle = {\bibremark{No string.}Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (RECOMB~'07)}, series = series-springer-lnbi, volume = {4453}, pages = {1--15}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-71681-5_1} } @Article{ DV07, author = {Tomislav Do{\v{s}}li{\'c} and Damir Vuki{\v{c}}evi{\'c}}, title = {Computing the bipartite edge frustration of fullerene graphs}, journal = journal-discreteapplmath, volume = {155}, number = {10}, pages = {1294--1301}, publisher = publisher-elsevier, year = {2007}, doi = {10.1016/j.dam.2006.12.003} } @InProceedings{ EGG07, author = {Edith Elkind and Leslie A. Goldberg and Paul W. Goldberg}, title = {Computational Complexity of Weighted Threshold Games}, booktitle = {\bibremark{No string.}Proceedings of the 22nd Conference on Artificial Intelligence (AAAI~'07)}, pages = {718--723}, publisher = {\bibremark{No string.}AAAI Press}, year = {2007} } @Misc{ Fel07pers, author = {Michael R. Fellows}, year = {2007}, month = sep, note = {Personal communication} } @InProceedings{ FFHV07, author = {Michael R. Fellows and Guillaume Fertin and Danny Hermelin and St{\'e}phane Vialette}, title = {Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs}, booktitle = proc-icalp-07, series = series-springer-lncs, volume = {4596}, pages = {340--351}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-73420-8_31} } @Article{ FKMRRW07, author = {Bernhard Fuchs and Walter Kern and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith and Xinhui Wang}, title = {Dynamic Programming for Minimum {S}teiner Trees}, journal = journal-tocs, volume = {41}, number = {3}, pages = {493--500}, publisher = publisher-springer, year = {2007}, doi = {10.1007/s00224-007-1324-4} } @InProceedings{ FLRS07, author = {Michael R. Fellows and Michael A. Langston and Frances A. Rosamond and Peter Shaw}, title = {Efficient Parameterized Preprocessing for {C}luster {E}diting}, booktitle = proc-fct-07, myeditor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Zolt{\'a}n {\'E}sik}, publisher = publisher-springer, series = series-springer-lncs, volume = {4639}, year = {2007}, pages = {312--321}, myurl = {http://dx.doi.org/10.1007/978-3-540-74240-1_27}, doi = {10.1007/978-3-540-74240-1_27} } @Article{ FLV07, author = {Isabelle Fagnot and Ga{\"e}lle Lelandais and St{\'e}phane Vialette}, title = {Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, year = {2007}, myurl = {http://dx.doi.org/10.1016/j.jda.2007.06.002}, doi = {10.1016/j.jda.2007.06.002} } @InProceedings{ FMPS07, author = {Herbert Fleischner and Egbert Mujuni and Dani{\"e}l Paulusma and Stefan Szeider}, title = {Covering Graphs with Few Complete Bipartite Subgraphs}, booktitle = proc-fsttcs-07, series = series-springer-lncs, volume = {4855}, pages = {340--351}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-77050-3_28} } @InProceedings{ FR07, author = {Henning Fernau and Daniel Raible}, title = {Alliances in Graphs: a Complexity-Theoretic Study}, booktitle = proc-sofsem-07, volume = {2}, pages = {61--70}, publisher = {\bibremark{No string.}Institute of Computer Science AS CR, Prague}, year = {2007} } @Article{ Gab07, author = {Harold N. Gabow}, title = {Finding Paths and Cycles of Superpolylogarithmic Length}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {36}, number = {6}, pages = {1648--1671}, year = {2007}, doi = {10.1137/S0097539704445366} } @Article{ Gar07, author = {Fr{\'e}d{\'e}ric Gardi}, title = {The {R}oberts characterization of proper and unit interval graphs}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {307}, number = {22}, year = {2007}, pages = {2906--2908}, myurl = {http://dx.doi.org/10.1016/j.disc.2006.04.043}, doi = {10.1016/j.disc.2006.04.043} } @Article{ GGHN07, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Data reduction and exact algorithms for clique cover}, journal = journal-acmjexpalg, publisher = publisher-acm, year = {2007}, note = {To appear} } @Article{ GGHNPS07, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier and Hans-Peter Piepho and Ramona Schmid}, title = {Algorithms for Compact Letter Displays: Comparison and Evaluation}, journal = {\bibremark{No string.}Computational Statistics\,\&\,Data Analysis\bibremark{No publisher.}}, volume = {52}, number = {2}, pages = {725--736}, year = {2007}, doi = {10.1016/j.csda.2006.09.035} } @Article{ GHKNU07, author = {Jiong Guo and Falk H{\"u}ffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann}, title = {Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs}, journal = journal-europeanjoperres, publisher = publisher-elsevier, year = {2007}, note = {To appear}, doi = {10.1016/j.ejor.2007.02.014} } @Article{ GHM07, author = {Jiong Guo and Falk H{\"u}ffner and Hannes Moser}, title = {Feedback Arc Set in Bipartite Tournaments is {NP}-Complete}, journal = journal-ipl, volume = {102}, number = {2--3}, pages = {62--65}, publisher = publisher-elsevier, year = {2007} } @Article{ GN07SIGACT, author = {Jiong Guo and Rolf Niedermeier}, title = {Invitation to data reduction and problem kernelization}, journal = journal-acmsigactnews, publisher = publisher-acm, volume = {38}, number = {1}, pages = {31--45}, year = {2007} } @InProceedings{ GN07ICALP, author = {Jiong Guo and Rolf Niedermeier}, title = {Linear Problem Kernels for {NP}-Hard Problems on Planar Graphs}, booktitle = proc-icalp-07, myeditor = {Lars Arge and Christian Cachin and Tomasz Jurdzinski and Andrzej Tarlecki}, publisher = publisher-springer, series = series-springer-lncs, volume = {4596}, year = {2007}, pages = {375--386}, myurl = {http://dx.doi.org/10.1007/978-3-540-73420-8_34}, doi = {10.1007/978-3-540-73420-8_34} } @Article{ GNW07, author = {Jiong Guo and Rolf Niedermeier and Sebastian Wernicke}, title = {Parameterized complexity of {V}ertex {C}over variants}, journal = journal-tocs, publisher = publisher-elsevier, volume = {41}, number = {3}, pages = {501--520}, year = {2007} } @InProceedings{ Guo07, author = {Jiong Guo}, title = {A More Effective Linear Kernelization for {C}luster {E}diting}, booktitle = proc-escape-07, myeditor = {Bo Chen and Mike Paterson and Guochuan Zhang}, publisher = publisher-springer, series = series-springer-lncs, volume = {4614}, year = {2007}, pages = {36--47}, myurl = {http://dx.doi.org/10.1007/978-3-540-74450-4_4}, doi = {10.1007/978-3-540-74450-4_4} } @InProceedings{ Gup07, author = {Sushmita Gupta}, title = {Feedback Arc Set Problem in Bipartite Tournaments}, booktitle = proc-tamc-07, series = series-springer-lncs, volume = {4484}, pages = {354--361}, publisher = publisher-springer, year = {2007}, note = {To appear in } # journal-ipl-it, doi = {10.1016/j.ipl.2007.08.023} } @Article{ GY07, author = {Gregory Gutin and Anders Yeo}, title = {Some Parameterized Problems On Digraphs}, journal = journal-computerjournal, publisher = publisher-oxford, year = {2007}, note = {To appear}, doi = {10.1093/comjnl/bxm039} } @InProceedings{ HBN07, author = {Falk H{\"u}ffner and Nadja Betzler and Rolf Niedermeier}, title = {Optimal Edge Deletions for Signed Graph Balancing}, booktitle = proc-wea-07, series = series-springer-lncs, volume = {4525}, pages = {297--310}, publisher = publisher-springer, year = {2007} } @Article{ HHR07, author = {Edith Hemaspaandra and Lane A. Hemaspaandra and J{\"{o}}rg Rothe}, title = {Anyone but him: The complexity of precluding an alternative}, journal = {\bibremark{No string.}Artificial Intelligence\bibremark{No publisher.}}, volume = {171}, pages = {255--285}, year = {2007} } @InCollection{ HHRW07, author = {Sabine Helwig and Falk H{\"u}ffner and Ivo R{\"o}ssling and Maik Weinard}, title = {Algorithm Design}, booktitle = {Algorithm Engineering}, series = series-springer-lncs, publisher = publisher-springer, year = {2007}, note = {To appear} } @InCollection{ HNW07Bioinformatics, author = {Falk H{\"u}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems}, booktitle = {Bioinformatics}, series = {\bibremark{No string.}Methods in Molecular Biology Series}, publisher = publisher-humana, year = {2007}, note = {To appear} } @InCollection{ HNW07clustering, author = {Falk H{\"u}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Fixed-parameter algorithms for graph-modeled data clustering}, booktitle = {Clustering Challenges in Biological Networks}, publisher = publisher-worldscientific, year = {2007}, note = {To appear} } @Article{ HNW07computerjournal, author = {Falk H{\"u}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Techniques for Practical Fixed-Parameter Algorithms}, journal = journal-computerjournal, publisher = publisher-oxford, year = {2007}, note = {To appear}, doi = {10.1093/comjnl/bxm040} } @Article{ HOSG07, author = {Petr Hlin{\u{e}}n{\'y} and Sang-il Oum and Detlef Seese and Georg Gottlob}, title = {Width parameters beyond tree-width and their applications}, journal = journal-computerjournal, publisher = publisher-oxford, year = {2007}, note = {To appear}, doi = {10.1093/comjnl/bxm052} } @InProceedings{ HPTV07, author = {Pinar Heggernes and Christophe Paul and Jan Arne Telle and Yngve Villanger}, title = {Interval completion with few edges}, booktitle = proc-stoc-07, myeditor = {David S. Johnson and Uriel Feige}, year = {2007}, pages = {374--381}, myurl = {http://doi.acm.org/10.1145/1250790.1250847}, publisher = publisher-acm, } @Article{ HWZ07Bioinformatics, author = {Falk H{\"u}ffner and Sebastian Wernicke and Thomas Zichner}, title = {{FASPAD}: fast signaling pathway detection}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {23}, number = {13}, pages = {1708--1709}, year = {2007}, doi = {10.1093/bioinformatics/btm160} } @InProceedings{ HWZ07APBC, author = {Falk H{\"u}ffner and Sebastian Wernicke and Thomas Zichner}, title = {Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection}, booktitle = proc-apbc-07, year = {2007}, series = series-worldscientific-advancesbioinf, publisher = publisher-worldscientific, volume = {5}, pages = {277--286}, note = {Journal version to appear in } # journal-algorithmica-it } @PhDThesis{ Hue07PhDThesis, author = {Falk H{\"u}ffner}, title = {Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems}, school = institution-fsuinf, year = {2007}, myurl = {http://theinf1.informatik.uni-jena.de/publications/diss-hueffner07.pdf} } @InProceedings{ KHMN07, author = {Christian Komusiewicz and Falk H{\"u}ffner and Hannes Moser and Rolf Niedermeier}, title = {Isolation Concepts for Enumerating Dense Subgraphs}, booktitle = proc-cocoon-07, series = series-springer-lncs, volume = {4598}, pages = {140--150}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-73545-8_16} } @InProceedings{ Kho07, author = {Victor Khomenko}, title = {Efficient Automatic Resolution of Encoding Conflicts Using {STG} Unfoldings}, booktitle = {\bibremark{No string.}Proceedings of the 7th International Conference on Application of Concurrency to System Design (ACSD~'07)}, pages = {137--146}, publisher = publisher-ieee, year = {2007}, doi = {10.1109/ACSD.2007.48} } @Article{ KKMO07, author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell}, title = {Optimal Inapproximability Results for {MAX-CUT} and Other 2-Variable {CSPs}?}, journal = journal-siamjcomput, volume = {37}, number = {1}, pages = {319--357}, publisher = publisher-siam, year = {2007}, doi = {10.1137/S0097539705447372} } @InProceedings{ KMR07, author = {Joachim Kneis and Daniel M{\"o}lle and Peter Rossmanith}, title = {Partial vs.\ Complete Domination: {$t$}-Dominating Set}, booktitle = proc-sofsem-07, series = series-springer-lncs, volume = {4362}, pages = {367--376}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-69507-3} } @InProceedings{ KS07, author = {Claire Kenyon-Mathieu and Warren Schudy}, title = {How to Rank with Few Errors: A {PTAS} for Weighted Feedback Arc Set on Tournaments}, booktitle = proc-stoc-07, pages = {95--103}, publisher = publisher-acm, year = {2007}, doi = {10.1145/1250790.1250806} } @InCollection{ LCM07, author = {Michael A. Langston and Carlos Cotta and Pablo Moscato}, title = {Combinatorial and Algorithmic Issues for Microarray Analysis}, booktitle = {Approximation Algorithms and Metaheuristics}, editor = {T. F. Gonzales}, pages = {74.1--74.14}, publisher = {\bibremark{No string.}Taylor {\&} Francis}, year = {2007} } @Article{ LYCCZS07, author = {Feng Luo and Yunfeng Yang and Chin-Fu Chen and Roger Chang and Jizhong Zhou and Richard H. Scheuermann}, title = {Modular organization of protein interaction networks}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {23}, number = {2}, pages = {207--214}, year = {2007}, myurl = {http://dx.doi.org/10.1093/bioinformatics/btl562}, doi = {10.1093/bioinformatics/btl562} } @Article{ LZCS07, author = {Songjian Lu and Fenghui Zhang and Jianer Chen and Sing-Hoi Sze}, title = {Finding pathway structures in protein interaction networks}, journal = journal-algorithmica, publisher = publisher-springer, volume = {48}, number = {8}, pages = {363--374}, year = {2007}, doi = {10.1007/s00453-007-0155-7} } @Misc{ Mar07, author = {D{\'a}niel Marx}, title = {Invitation to fixed-parameter algorithms}, publisher = publisher-ams, year = {2007}, howpublished = {MathSciNet Review MR2223196} } @InProceedings{ MRS07, author = {Hannes Moser and Venkatesh Raman and Somnath Sikdar}, title = {The Parameterized Complexity of the Unique Coverage Problem}, booktitle = proc-isaac-07, pages = {621--631}, year = {2007}, volume = {4835}, series = series-springer-lncs, publisher = publisher-springer } @InProceedings{ MS07, author = {Hannes Moser and Somnath Sikdar}, title = {The Parameterized Complexity of the Induced Matching Problem in Planar Graphs}, booktitle = proc-faw-07, pages = {325--336}, year = {2007}, volume = {4613}, series = series-springer-lncs, publisher = publisher-springer } @Article{ MSRGRSP07, author = {Itay Mayrose and Tomer Shlomi and Nimrod D. Rubinstein and Jonathan M. Gershoni and Eytan Ruppin and Roded Sharan and Tal Pupko}, title = {Epitope mapping using combinatorial phage-display libraries: a graph-based algorithm}, journal = {\bibremark{No string.}Nucleic Acids Research\bibremark{No publisher.}}, volume = {35}, number = {1}, pages = {69--78}, year = {2007}, doi = {10.1093/nar/gkl975} } @Misc{ Pei07, author = {Thomas Peiselt}, title = {An Iterative Compression Algorithm for Vertex Cover}, year = {2007}, howpublished = {Studienarbeit, } # institution-fsuinf, myurl = {http://theinf1.informatik.uni-jena.de/publications/vc-iterative-compression-peiselt07.pdf} } @InProceedings{ QLBLX07, author = {Jianbo Qian and Shuai Cheng Li and Dongbo Bu and Ming Li and Jinbo Xu}, title = {Finding Compact Structural Motifs}, booktitle = {\bibremark{No string.}Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM~'07)}, series = series-springer-lncs, volume = {4580}, pages = {142--149}, publisher = publisher-springer, year = {2007}, myurl = {http://dx.doi.org/10.1007/978-3-540-73437-6_16}, doi = {10.1007/978-3-540-73437-6_16} } @InProceedings{ RRW07, author = {Franz Rendl and Giovanni Rinaldi and Angelika Wiegele}, title = {A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations}, booktitle = proc-ipco-07, series = series-springer-lncs, volume = {4513}, pages = {295--309}, publisher = publisher-springer, year = {2007}, doi = {10.1007/978-3-540-72792-7_23} } @TechReport{ RS07, author = {Igor Razgon and Barry O'Sullivan}, title = {Directed Feedback Vertex Set is Fixed-Parameter Tractable}, number = {arXiv:0707.0282v1}, institution = institution-arxiv, year = {2007}, myurl = {http://arxiv.org/abs/0707.0282v1} } @Article{ RS07MAXCUT, author = {Venkatesh Raman and Saket Saurabh}, title = {Improved fixed parameter tractable algorithms for two ``edge'' problems: {MAXCUT} and {MAXDAG}}, journal = journal-ipl, volume = {104}, number = {2}, pages = {65--72}, publisher = publisher-elsevier, year = {2007}, doi = {10.1016/j.ipl.2007.05.014} } @Article{ RS07subgraph, author = {Venkatesh Raman and Somnath Sikdar}, title = {Parameterized complexity of the induced subgraph problem in directed graphs}, journal = journal-ipl, volume = {104}, number = {3}, pages = {79--85}, publisher = publisher-elsevier, year = {2007}, doi = {10.1016/j.ipl.2007.05.005} } @Article{ RSS07, author = {Venkatesh Raman and Saket Saurabh and Somnath Sikdar}, title = {Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques}, journal = journal-tocs, volume = {41}, number = {3}, pages = {563--587}, publisher = publisher-springer, year = {2007}, myurl = {http://www.imsc.res.in/~vraman/pub/toc_06.ps} } @InProceedings{ RWBMTB07, author = {Sven Rahmann and Tobias Wittkop and Jan Baumbach and Marcel Martin and Anke Tru{\ss} and Sebastian B{\"o}cker}, title = {Exact and Heuristic Algorithms for Weighted Cluster Editing}, booktitle = {\bibremark{No string.}Proceedings of the 6th International Conference on Computational Systems Bioinformatics (CSB~'07)}, series = {\bibremark{No string.}Computational Systems Bioinformatics}, volume = {6}, pages = {391--401}, publisher = {\bibremark{No string.}Imperial College Press}, year = {2007}, myurl = {http://www.lifesciencessociety.org/CSB2007/toc/PDF/391.2007.pdf}, doi = {10.1142/9781860948732_0040} } @Article{ Sas07, author = {Prashant Sasatte}, title = {Improved {FPT} algorithm for feedback vertex set problem in bipartite tournament}, journal = journal-ipl, volume = {105}, number = {3}, pages = {79--82}, publisher = publisher-elsevier, year = {2007}, doi = {10.1016/j.ipl.2007.08.014} } @Article{ Son07, author = {Eduardo D. Sontag}, title = {Monotone and near-monotone biochemical networks}, journal = {\bibremark{No string.}Systems and Synthetic Biology\bibremark{No publisher.}}, volume = {1}, number = {2}, pages = {59--87}, year = {2007}, doi = {10.1007/s11693-007-9005-9} } @Article{ SS07, author = {Alexander D. Scott and Gregory B. Sorkin}, title = {Linear-programming design and analysis of fast algorithms for {Max 2-CSP}}, journal = journal-discreteoptim, publisher = publisher-elsevier, volume = {4}, number = {3--4}, pages = {260--287}, year = {2007}, doi = {10.1016/j.disopt.2007.08.001} } @Article{ Thi07, author = {Thilikos, D. M.}, title = {Invitation to fixed-parameter algorithms}, journal = {\bibremark{No string.}Computer Science Review}, volume = {1}, number = {2}, pages = {103--104}, publisher = publisher-elsevier, year = {2007} } @Article{ TZ07, author = {Jinsong Tan and Louxin Zhang}, title = {The Consecutive Ones Submatrix Problem for Sparse Matrices}, journal = journal-algorithmica, publisher = publisher-springer, volume = {48}, number = {3}, pages = {287--299}, year = {2007}, myurl = {http://dx.doi.org/10.1007/s00453-007-0118-z}, doi = {10.1007/s00453-007-0118-z} } @PhDThesis{ Wah07, author = {Magnus Wahlstr{\"o}m}, title = {Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems}, year = {2007}, school = {\bibremark{No string.}Department of Computer and Information Science, Link{\"o}pings universitet, Sweden}, myurl = {http://www.diva-portal.org/diva/getDocument?urn_nbn_se_liu_diva-8714-1__fulltext.pdf} } @Article{ WBLR07, author = {Tobias Wittkop and Jan Baumbach and Francisco P. Lobo and Sven Rahmann}, title = {Large scale clustering of protein sequences with {FORCE} -- A layout based heuristic for weighted cluster editing}, journal = {\bibremark{No string.}BMC Bioinformatics\bibremark{No publisher.}}, volume = {8}, number = {1}, pages = {396}, year = {2007} } @Article{ WLZ07, author = {Rui Wang and Francis C. M. Lau and Yingchao Zhao}, title = {Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {155}, number = {17}, year = {2007}, pages = {2312--2320}, myurl = {http://dx.doi.org/10.1016/j.dam.2007.06.009}, doi = {10.1016/j.dam.2007.06.009} } @InProceedings{ WP07, author = {Bin Wu and Xin Pei}, title = {A Parallel Algorithm for Enumerating All the Maximal $k$-Plexes}, booktitle = {Emerging Technologies in Knowledge Discovery and Data Mining}, series = {\bibremark{No string.}Lecture Notes in Artificial Intelligence}, volume = {4819}, pages = {476--483}, publisher = publisher-springer, year = {2007} } @Article{ WR07Bioinformatics, author = {Sebastian Wernicke and Florian Rasche}, title = {Simple and fast alignment of metabolic pathways by exploiting local diversity}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {23}, number = {15}, pages = {1978--1985}, year = {2007}, myurl = {http://dx.doi.org/10.1093/bioinformatics/btm279}, doi = {10.1093/bioinformatics/btm279} } @Article{ XX07, author = {Guang Xu and Jinhui Xu}, title = {Constant Approximation Algorithms for Rectangle Stabbing and Related Problems}, journal = journal-tocs, publisher = publisher-springer, volume = {40}, number = {2}, year = {2007}, pages = {187--204}, myurl = {http://dx.doi.org/10.1007/s00224-005-1273-8}, doi = {10.1007/s00224-005-1273-8}, } @InProceedings{ ZW07, author = {van Zuylen, Anke and David P. Williamson}, title = {Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems}, booktitle = proc-waoa-07, series = series-springer-lncs, publisher = publisher-springer, year = {2007}, note = {To appear}, myurl = {http://legacy.orie.cornell.edu/~anke/wfas.pdf} } @Article{ ABN06, author = {Jochen Alber and Nadja Betzler and Rolf Niedermeier}, title = {Experiments on data reduction for optimal domination in networks}, journal = journal-annoperres, publisher = publisher-springer, volume = {146}, number = {1}, pages = {105--117}, year = {2006}, doi = {10.1007/s10479-006-0045-4} } @Article{ ACLRT06, author = {Marta Arias and Lenore Cowen and Kofi A. Laing and Rajmohan Rajaraman and Orjeta Taka}, title = {Compact Routing with Name Independence}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {20}, number = {3}, year = {2006}, pages = {705--726} } difficult name @InProceedings{ AF06, author = {Faisal N. Abu{-}Khzam and Henning Fernau}, title = {Kernels: Annotated, Proper and Induced}, booktitle = proc-iwpec-06, series = series-springer-lncs, volume = {4169}, pages = {264--275}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11847250_24} } @InProceedings{ AGGM06, author = {Ittai Abraham and Cyril Gavoille and Andrew V. Goldberg and Dahlia Malkhi}, title = {Routing in Networks with Low Doubling Dimension}, booktitle = {\bibremark{No string.}Proceedings of the 26th International Conference on Distributed Computing Systems (ICDCS~2006)}, pages = {75}, year = {2006}, publisher = publisher-ieee, } @InProceedings{ AGM06lower, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi}, title = {On space-stretch trade-offs: lower bounds}, booktitle = proc-spaa-06, myeditor = {Phillip B. Gibbons and Uzi Vishkin}, year = {2006}, pages = {207--216}, myurl = {http://doi.acm.org/10.1145/1148109.1148143}, publisher = publisher-acm, isbn = {1-59593-452-9} } @InProceedings{ AGM06upper, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi}, title = {On space-stretch trade-offs: upper bounds}, booktitle = proc-spaa-06, myeditor = {Phillip B. Gibbons and Uzi Vishkin}, year = {2006}, pages = {217--224}, myurl = {http://doi.acm.org/10.1145/1148109.1148144}, publisher = publisher-acm, isbn = {1-59593-452-9} } @Article{ AKR06, author = {Tibor Antal and Paul L. Krapivsky and Sidney Redner}, title = {Social balance on networks: The dynamics of friendship and enmity}, journal = {\bibremark{No string.}Physica~D: Nonlinear Phenomena\bibremark{No publisher.}}, volume = {224}, number = {1--2}, pages = {130--136}, year = {2006}, doi = {10.1016/j.physd.2006.09.028} } @Article{ Alo06, author = {Noga Alon}, title = {Ranking tournaments}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {20}, number = {1}, pages = {137--142}, year = {2006} } difficult name @Article{ ALSS06, author = {Faisal N. Abu{-}Khzam and Michael A. Langston and Pushkar Shanbhag and Christopher T. Symons}, title = {Scalable Parallel Algorithms for {FPT} Problems}, journal = journal-algorithmica, publisher = publisher-springer, volume = {45}, number = {3}, pages = {269--284}, year = {2006}, doi = {10.1007/s00453-006-1214-1} } @Article{ AP06, author = {Giorgio Ausiello and Vangelis Th. Paschos}, title = {Reductions, completeness and the hardness of approximability}, journal = journal-europeanjoperres, publisher = publisher-elsevier, volume = {172}, pages = {719--739}, year = {2006}, doi = {10.1016/j.ejor.2005.06.006} } @InProceedings{ BAHN06, author = {Matthias Brosemann and Jochen Alber and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Matrix Robustness, with an Application to Power System Observability}, booktitle = proc-acid-06, publisher = publisher-collegepublications, series = series-collegepublications-algorithmics, volume = {7}, pages = {37--48}, year = {2006} } @Article{ BBD06, author = {Pablo Burzyn and Flavia Bonomo and Guillermo Dur{\'a}n}, title = {{NP}-completeness results for edge modification problems}, journal = journal-discreteapplmath, volume = {154}, number = {13}, pages = {1824--1844}, publisher = publisher-elsevier, year = {2006}, doi = {10.1016/j.dam.2006.03.031} } @Misc{ BBHS06, author = {Balabhaskar Balasundaram and Sergiy Butenko and Illya V. Hicks and S. Sachdeva}, title = {Clique Relaxations in Social Network Analysis: The Maximum $k$-plex Problem}, year = {2006}, note = {Manuscript} } @InProceedings{ BC06ALENEX, author = {Arthur Brady and Lenore Cowen}, title = {Compact routing on power-law graphs with additive stretch}, booktitle = proc-alenex-06, year = {2006}, pages = {119--128} } @InProceedings{ BC06DISC, author = {Arthur Brady and Lenore Cowen}, title = {Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes}, booktitle = proc-disc-06, myeditor = {Shlomi Dolev}, year = {2006}, pages = {339--354}, myurl = {http://dx.doi.org/10.1007/11864219_24}, doi = {10.1007/11864219_24}, publisher = publisher-springer, series = series-springer-lncs, volume = {4167}, isbn = {3-540-44624-9} } @InProceedings{ BC06SPAA, author = {Arthur Brady and Lenore Cowen}, title = {Compact routing with additive stretch using distance labelings}, booktitle = proc-spaa-06, myeditor = {Phillip B. Gibbons and Uzi Vishkin}, year = {2006}, pages = {233}, myurl = {http://doi.acm.org/10.1145/1148109.1148147}, publisher = publisher-acm, isbn = {1-59593-452-9} } @TechReport{ BCCFTM06, author = {Hans L. Bodlaender and Leizhen Cai and Jianer Chen and Michael R. Fellows and Jan Arne Telle and D{\'a}niel Marx}, title = {Open Problems in Parameterized and Exact Computation -- {IWPEC} 2006}, number = {UU-CS-2006-052}, institution = institution-utrechtcs, year = {2006} } difficult name @InProceedings{ BEFLMR06, author = {Kevin Burrage and Vladimir Estivill{-}Castro and Michael R. Fellows and Michael A. Langston and Shev Mac and Frances A. Rosamond}, title = {The Undirected Feedback Vertex Set Problem Has a Poly({$k$}) Kernel}, booktitle = proc-iwpec-06, series = series-springer-lncs, volume = {4169}, pages = {192--202}, publisher = publisher-springer, year = {2006} } @Article{ BEHM06, author = {Maurizio Bruglieri and Matthias Ehrgott and Horst W. Hamacher and Francesco Maffioli}, title = {An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints}, journal = journal-discreteapplmath, volume = {154}, number = {9}, pages = {1344--1357}, publisher = publisher-elsevier, year = {2006}, doi = {10.1016/j.dam.2005.05.036} } @Misc{ Bet06, author = {Nadja Betzler}, title = {Steiner Tree Problems in the Analysis of Biological Networks}, year = {2006}, howpublished = {Diploma thesis, } # institution-tuebingeninf } @InProceedings{ BFKKT06, author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos}, title = {On Exact Algorithms for Treewidth}, booktitle = proc-esa-06, year = {2006}, pages = {672--683}, series = series-springer-lncs, volume = {4168}, publisher = publisher-springer } @Article{ BL06, author = {Andreas Brandst{\"a}dt and Van Bang Le}, title = {Structure and linear time recognition of 3-leaf powers}, journal = journal-ipl, publisher = publisher-elsevier, volume = {98}, number = {4}, year = {2006}, pages = {133--138}, myurl = {http://dx.doi.org/10.1016/j.ipl.2006.01.004}, doi = {10.1016/j.ipl.2006.01.004} } @Article{ BT06, author = {Michael Behrisch and Anusch Taraz}, title = {Efficiently covering complex networks with cliques of similar vertices}, journal = journal-tcs, publisher = publisher-elsevier, volume = {355}, number = {1}, pages = {37--47}, year = {2006}, doi = {10.1016/j.tcs.2005.12.005} } @InProceedings{ CCC06, author = {Leizhen Cai and Siu Man Chan and Siu On Chan}, title = {Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems}, booktitle = proc-iwpec-06, series = series-springer-lncs, volume = {4169}, pages = {239--250}, publisher = publisher-springer, year = {2006} } @Article{ CCV06, author = {Michele Conforti and G{\'e}rard Cornu{\'e}jols and Kristina Vuskovic}, title = {Balanced matrices}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {306}, number = {19--20}, year = {2006}, pages = {2411--2437}, myurl = {http://dx.doi.org/10.1016/j.disc.2005.12.033}, doi = {10.1016/j.disc.2005.12.033} } @Article{ CDE+06, author = {Y. Chevaleyre and P. E. Dunne and U. Endriss and J. Lang and M. Lema\^itre and N. Maudet and J. Padget and S. Phelps and J. A. Rodr\'iguez and P. Sousa}, title = {Issues in multiagent resource allocation}, journal = {\bibremark{No string.}Informatica}, publisher = {\bibremark{No string.}Slovenian Society Informatika}, volume = {30}, pages = {3--31}, year = {2006} } difficult name @Article{ CIKT06, author = {Rudi Cilibrasi and van Iersel, Leo and Steven Kelk and John Tromp}, title = {On the Complexity of the Single Individual {SNP} Haplotyping Problem}, journal = journal-algorithmica, year = {2006}, publisher = publisher-springer, note = {To appear} } @InProceedings{ CKL06, author = {Maw-Shang Chang and Ming-Tat Ko and Hsueh-I Lu}, title = {Linear-Time Algorithms for Tree Root Problems}, booktitle = proc-swat-06, myeditor = {Lars Arge and Rusins Freivalds}, publisher = publisher-springer, series = series-springer-lncs, volume = {4059}, year = {2006}, pages = {411--422}, myurl = {http://dx.doi.org/10.1007/11785293_38}, doi = {10.1007/11785293_38} } @Article{ CN06, author = {Julia Chuzhoy and Joseph Naor}, title = {Covering Problems with Hard Capacities}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {36}, number = {2}, year = {2006}, pages = {498--515}, myurl = {http://dx.doi.org/10.1137/S0097539703422479}, doi = {10.1137/S0097539703422479} } @InProceedings{ CKX06, author = {Jianer Chen and Iyad A. Kanj and Ge Xia}, title = {Improved Parameterized Upper Bounds for {V}ertex {C}over}, booktitle = proc-mfcs-06, myeditor = {Rastislav Kralovic and Pawel Urzyczyn}, publisher = publisher-springer, series = series-springer-lncs, volume = {4162}, year = {2006}, pages = {238--249}, myurl = {http://dx.doi.org/10.1007/11821069_21}, doi = {10.1007/11821069} } @InProceedings{ Con06, author = {Vincent Conitzer}, title = {Computing {S}later Rankings Using Similarities among Candidates}, booktitle = {\bibremark{No string.}Proceedings of the 21st National Conference on Artificial Intelligence (AAAI~'06)}, publisher = {\bibremark{No string.}AAAI Press}, pages = {613--619}, year = {2006} } @Article{ CS06, author = {Vincent Conitzer and Tuomas Sandholm}, title = {Complexity of constructing solutions in the core based synergies among coalitions}, journal = {\bibremark{No string.}Artificial Intelligence\bibremark{No publisher.}}, volume = {170}, pages = {607--619}, year = {2006} } @Article{ CT06, author = {Zhi-Zhong Chen and Tatsuie Tsukiji}, title = {Computing bounded-degree phylogenetic roots of disconnected graphs}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {59}, number = {2}, year = {2006}, pages = {125--148}, myurl = {http://dx.doi.org/10.1016/j.jalgor.2004.12.004}, doi = {10.1016/j.jalgor.2004.12.004} } @Article{ DFHKLMNRRSWW06, author = {Vida Dujmovic and Michael R. Fellows and Michael T. Hallett and Matthew Kitching and Giuseppe Liotta and Catherine McCartin and Naomi Nishimura and Prabhakar Ragde and Frances A. Rosamond and Matthew Suderman and Sue Whitesides and David R. Wood}, title = {A Fixed-Parameter Approach to 2-{L}ayer {P}lanarization}, journal = journal-algorithmica, publisher = publisher-springer, volume = {45}, number = {2}, year = {2006}, pages = {159--182}, myurl = {http://dx.doi.org/10.1007/s00453-005-1181-y}, doi = {10.1007/s00453-005-1181-y} } @Article{ DGHN06, author = {Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Error Compensation in Leaf Power Problems}, journal = journal-algorithmica, year = {2006}, volume = {44}, number = {4}, pages = {363--381}, publisher = publisher-springer, myurl = {http://dx.doi.org/10.1007/s00453-005-1180-z}, doi = {10.1007/s00453-005-1180-z} } @InProceedings{ DGHNT06, author = {Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier and Anke Tru{\ss}}, title = {Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments}, booktitle = proc-ciac-06, year = {2006}, series = series-springer-lncs, volume = {3998}, pages = {320--331}, publisher = publisher-springer, myurl = {http://dx.doi.org/10.1007/11758471_31}, doi = {10.1007/11758471_31}, note = {Journal version appeared in } # journal-jdiscretealgorithms-it } @Article{ DGMST06, author = {Guillermo Dur{\'a}n and Agust\'{\i}n Gravano and Ross M. McConnell and Jeremy Spinrad and Alan C. Tucker}, title = {Polynomial time recognition of unit circular-arc graphs}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {58}, number = {1}, year = {2006}, pages = {67--78}, myurl = {http://dx.doi.org/10.1016/j.jalgor.2004.08.003}, doi = {10.1016/j.jalgor.2004.08.003} } @InProceedings{ DGNW06, author = {Michael Dom and Jiong Guo and Rolf Niedermeier and Sebastian Wernicke}, title = {Minimum Membership Set Covering and the Consecutive Ones Property}, booktitle = proc-swat-06, year = {2006}, series = series-springer-lncs, volume = {4059}, pages = {339--350}, publisher = publisher-springer, myurl = {http://dx.doi.org/10.1007/11785293_32}, doi = {10.1007/11785293_32}, note = {Journal version appeared in } # journal-jdiscretealgorithms-it } @InProceedings{ DHFS06, author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Uriel Feige and Mohammad R. Salavatipour}, title = {Combination can be hard: approximability of the unique coverage problem}, booktitle = proc-soda-06, year = {2006}, pages = {162--171}, myurl = {http://doi.acm.org/10.1145/1109557.1109577}, publisher = publisher-acm, isbn = {0-89871-605-5} } @Article{ DHOW06, author = {Vladimir G. Deineko and Michael Hoffmann and Yoshio Okamoto and Gerhard J. Woeginger}, title = {The traveling salesman problem with few inner points}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {34}, number = {1}, pages = {106--110}, year = {2006}, myurl = {http://dx.doi.org/10.1016/j.orl.2005.01.002}, doi = {10.1016/j.orl.2005.01.002} } @InProceedings{ DLLPSZ06, author = {Frank K. H. A. Dehne and Michael A. Langston and Xuemei Luo and Sylvain Pitre and Peter Shaw and Yun Zhang}, title = {The Cluster Editing Problem: Implementations and Experiments}, booktitle = proc-iwpec-06, series = series-springer-lncs, volume = {4169}, pages = {13--24}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11847250_2} } @InProceedings{ DMRP06, author = {Vinay Deolalikar and Malena R. Mesarina and John Recker and Salil Pradhan}, title = {Perturbative Time and Frequency Allocations for {RFID} Reader Networks}, booktitle = {\bibremark{No string.}Proceedings of the 2006 Workshop on Emerging Directions in Embedded and Ubiquitous Computing (EUC~'06)}, series = series-springer-lncs, volume = {4097}, pages = {392--402}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11807964_40} } @InProceedings{ EFLR06, author = {Vladimir Estivill-Castro and Michael R. Fellows and Michael A. Langston and Frances A. Rosamond}, title = {{FPT} is {P}-Time Extremal Structure {I}}, booktitle = proc-acid-06, publisher = publisher-collegepublications, series = series-collegepublications-algorithmics, volume = {4}, pages = {1--41}, year = {2006} } @InProceedings{ ERS06, author = {Guy Even and Dror Rawitz and Shimon Shahar}, title = {Approximation Algorithms for Capacitated Rectangle Stabbing}, booktitle = proc-ciac-06, year = {2006}, pages = {18--29}, myurl = {http://dx.doi.org/10.1007/11758471_5}, doi = {10.1007/11758471_5}, myeditor = {Tiziana Calamoneri and Irene Finocchi and Giuseppe F. Italiano}, publisher = publisher-springer, series = series-springer-lncs, volume = {3998}, isbn = {3-540-34375-X} } @InProceedings{ Fer06CIAC, author = {Henning Fernau}, title = {Parameterized Algorithms for Hitting Set: The Weighted Case}, booktitle = proc-ciac-06, series = series-springer-lncs, volume = {3998}, pages = {332--343}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11758471_32} } @InProceedings{ Fer06CTW, author = {Henning Fernau}, title = {Speeding up Exact Algorithms With High Probability}, booktitle = {\bibremark{No string.}Proceedings of the 5th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW~'06)}, series = {\bibremark{No string.}Electronic Notes in Discrete Mathematics}, volume = {25}, pages = {57--59}, publisher = publisher-elsevier, year = {2006}, number = {1\bibremark{?}}, doi = {10.1016/j.endm.2006.06.065} } @Book{ FG06, author = {J{\"o}rg Flum and Martin Grohe}, title = {Parameterized Complexity Theory}, publisher = publisher-springer, year = {2006} } @Article{ FGN06, author = {Michael R. Fellows and Jens Gramm and Rolf Niedermeier}, title = { On the parameterized intractability of motif search problems}, journal = journal-combinatorica, publisher = publisher-springer, volume = {26}, number = {2}, pages = {141--167}, year = {2006} } @InProceedings{ FHH06, author = {P. Faliszewski and E. Hemaspaandra and L. A. Hemaspaandra}, title = {The complexity of bribery in elections}, booktitle = {\bibremark{No string.}Proceedings of the 21st National Conference on Artifical Intelligence (AAAI~'06)}, pages = {641--646}, publisher = {\bibremark{No string.}AAAI Press}, year = {2006} } @TechReport{ FMZ06, author = {Tom{\'a}s Feder and Rajeev Motwani and An Zhu}, title = {{$k$}-Connected Spanning Subgraphs of Low Degree}, institution = institution-eccc, number = {TR06-041}, year = {2006}, myurl = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-041/index.html} } @Article{ FR06, author = {Pierre Fouilhoux and Ali Ridha Mahjoub}, title = {Polyhedral results for the bipartite induced subgraph problem}, journal = journal-discreteapplmath, volume = {154}, number = {15}, pages = {2128--2149}, publisher = publisher-elsevier, year = {2006}, doi = {10.1016/j.dam.2005.04.017} } @Article{ FSPBI06, author = {Adam M. Feist and Johannes C. M. Scholten and Bernhard {\O}. Palsson and Fred J. Brockman and Trey Ideker}, title = {Modeling methanogenesis with a genome-scale metabolic reconstruction of \textit{Methanosarcina barkeri}}, journal = {\bibremark{No string.}Molecular Systems Biology\bibremark{No publisher.}}, volume = {2}, year = {2006}, doi = {10.1038/msb4100046} } @Article{ FT06, author = {Fedor V. Fomin and Dimitrios M. Thilikos}, title = {Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {36}, number = {2}, year = {2006}, pages = {281--309}, myurl = {http://dx.doi.org/10.1137/S0097539702419649}, doi = {10.1137/S0097539702419649} } @InProceedings{ GGHN06ALENEX, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Data Reduction, Exact, and Heuristic Algorithms for Clique Cover}, booktitle = proc-alenex-06, pages = {86--94}, year = {2006}, publisher = publisher-siam, note = {Journal version to appear under the title ``Data reduction and exact algorithms for clique cover'' in } # journal-acmjexpalg-it } @Article{ GGN06tocs, author = {Jens Gramm and Jiong Guo and Rolf Niedermeier}, title = {Parameterized intractability of distinguishing substring selection}, journal = journal-tocs, volume = {39}, number = {4}, pages = {545--560}, publisher = publisher-springer, year = {2006} } @Article{ GGHNW06, author = {Jiong Guo and Jens Gramm and Falk H{\"u}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization}, journal = journal-jcss, volume = {72}, number = {8}, pages = {1386--1396}, publisher = publisher-elsevier, year = {2006} } @Article{ GHKKS06, author = {Rajiv Gandhi and Eran Halperin and Samir Khuller and Guy Kortsarz and Aravind Srinivasan}, title = {An improved approximation algorithm for {V}ertex {C}over with hard capacities}, journal = journal-jcss, publisher = publisher-elsevier, volume = {72}, number = {1}, year = {2006}, pages = {16--33}, myurl = {http://dx.doi.org/10.1016/j.jcss.2005.06.004}, doi = {10.1016/j.jcss.2005.06.004} } @InProceedings{ GHKNU06, author = {Jiong Guo and Falk H{\"u}ffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann}, title = {Complexity and Exact Algorithms for Multicut}, booktitle = proc-sofsem-06, series = series-springer-lncs, volume = {3831}, pages = {137--147}, publisher = publisher-springer, year = {2006} } @InProceedings{ GKH06, author = {Andrew V. Goldberg and Haim Kaplan and Chris Harrelson}, title = {Reach for A{$^{*}$}: Efficient point-to-point shortest path algorithms}, booktitle = proc-alenex-06, year = {2006}, publisher = publisher-siam } @Article{ GN06, author = {Jiong Guo and Rolf Niedermeier}, title = {A fixed-parameter tractability result for multicommodity demand flow in trees}, journal = journal-ipl, volume = {97}, pages = {109--114}, publisher = publisher-elsevier, year = {2006} } @InProceedings{ GSY06, author = {Gregory Gutin and Stefan Szeider and Anders Yeo}, title = {Fixed-Parameter Complexity of Minimum Profile Problems}, booktitle = proc-iwpec-06, myeditor = {Hans L. Bodlaender and Michael A. Langston}, publisher = publisher-springer, series = series-springer-lncs, volume = {4169}, year = {2006}, pages = {60--71}, myurl = {http://dx.doi.org/10.1007/11847250_6}, doi = {10.1007/11847250_6} } @PhDThesis{ Guo06, author = {Jiong Guo}, title = {Algorithm Design Techniques for Parameterized Graph Modification Problems}, year = {2006}, school = institution-fsuinf, myurl = {http://theinf1.informatik.uni-jena.de/publications/graph-modification-guo06.pdf} } @article{ HL06, author = {Dorit S. Hochbaum and Asaf Levin}, title = {Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms}, publisher = publisher-elsevier, journal = journal-discreteoptim, volume = {3}, number = {4}, year = {2006}, pages = {327--340}, myurl = {http://dx.doi.org/10.1016/j.disopt.2006.02.002}, doi = {10.1016/j.disopt.2006.02.002} } @Book{ HMU06, author = {John E. Hopcroft and Rajeev Motwani and Jeffrey D. Ullman}, title = {Introduction to Automata Theory, Languages, and Computation}, publisher = publisher-addisonwesley, year = {2006}, edition = {3rd} } @InProceedings{ HN06, author = {Danny Harnik and Moni Naor}, title = {On the Compressibility of {NP}~instances and Cryptographic Applications}, booktitle = proc-focs-06, pages = {719--728}, publisher = publisher-ieee, year = {2006} } @Article{ IV06, author = {Trey Ideker and Alfonso Valencia}, title = {Bioinformatics in the human interactome project}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {22}, number = {24}, pages = {2973--2974}, year = {2006}, doi = {10.1093/bioinformatics/btl579} } @InProceedings{ KK06, author = {Jan K{\'a}ra and Jan Kratochv\'{\i}l}, title = {Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs}, booktitle = proc-iwpec-06, year = {2006}, pages = {166--174}, series = series-springer-lncs, volume = {4169}, publisher = publisher-springer, myurl = {http://dx.doi.org/10.1007/11847250_15}, doi = {10.1007/11847250_15} } @Article{ KLY06, author = {William Kennedy and Guohui Lin and Guiying Yan}, title = {Strictly chordal graphs are leaf powers}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, volume = {4}, number = {4}, year = {2006}, pages = {511--525}, myurl = {http://dx.doi.org/10.1016/j.jda.2005.06.005}, doi = {10.1016/j.jda.2005.06.005} } @Article{ KMMS06, author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy Spinrad}, title = {Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {36}, number = {2}, year = {2006}, pages = {326--353}, myurl = {http://dx.doi.org/10.1137/S0097539703437855}, doi = {10.1137/S0097539703437855} } @InProceedings{ KN06, author = {Haim Kaplan and Yahav Nussbaum}, title = {A Simpler Linear-Time Recognition of Circular-Arc Graphs}, booktitle = proc-swat-06, myeditor = {Lars Arge and Rusins Freivalds}, publisher = publisher-springer, series = series-springer-lncs, volume = {4059}, year = {2006}, isbn = {3-540-35753-X}, pages = {41--52}, myurl = {http://dx.doi.org/10.1007/11785293_7}, doi = {10.1007/11785293_7} } @InProceedings{ KRX06, author = {Goran Konjevod and Andr{\'e}a W. Richa and Donglin Xia}, title = {Optimal-stretch name-independent compact routing in doubling metrics}, booktitle = proc-podc-06, myeditor = {Eric Ruppert and Dahlia Malkhi}, year = {2006}, pages = {198--207}, myurl = {http://doi.acm.org/10.1145/1146381.1146412}, publisher = publisher-acm } @InProceedings{ KalS06, author = {Kanela Kaligosi and Peter Sanders}, title = {How Branch Mispredictions Affect Quicksort}, booktitle = proc-esa-06, year = {2006}, pages = {780--791}, series = series-springer-lncs, volume = {4168}, publisher = publisher-springer } @InProceedings{ KMRR06, author = {Joachim Kneis and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, title = {Divide-and-Color}, booktitle = proc-wg-06, series = series-springer-lncs, volume = {4271}, pages = {58--67}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11917496_6} } @Article{ KovS06, author = {Sofia Kovaleva and Frits C. R. Spieksma}, title = {Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems}, year = {2006}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {20}, number = {3}, pages = {748--768}, myurl = {http://link.aip.org/link/?SJD/20/748/1}, doi = {10.1137/S089548010444273X} } @Article{ Lau06, author = {Lap Chi Lau}, title = {Bipartite roots of graphs}, journal = journal-acmtransalgorithms, publisher = publisher-acm, volume = {2}, number = {2}, year = {2006}, pages = {178--208}, myurl = {http://doi.acm.org/10.1145/1150334.1150337} } @InProceedings{ LLCS06, author = {Yang Liu and Songjian Lu and Jianer Chen and Sing-Hoi Sze}, title = {Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms}, booktitle = proc-iwpec-06, series = series-springer-lncs, volume = {4169}, pages = {84--95}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11847250_8} } @InProceedings{ Mar06IWPEC, author = {D{\'a}niel Marx}, title = {Parameterized complexity of independence and domination on geometric graphs}, booktitle = proc-iwpec-06, year = {2006}, pages = {154--165}, series = series-springer-lncs, volume = {4169}, publisher = publisher-springer } @InProceedings{ Mar06WG, author = {D{\'a}niel Marx}, title = {Chordal Deletion Is Fixed-Parameter Tractable}, booktitle = proc-wg-06, series = series-springer-lncs, volume = {4271}, pages = {37--48}, publisher = publisher-springer, year = {2006}, doi = {10.1007/11917496_4} } @Article{ MC06, author = {Ewa Misio{\l}ek and Danny Z. Chen}, title = {Two flow network simplification algorithms}, journal = journal-ipl, volume = {97}, number = {5}, pages = {197--202}, publisher = publisher-elsevier, year = {2006}, doi = {10.1016/j.ipl.2005.11.002} } @Book{ MG06, author = {Ji{\v{r}}{\'{i}} Matou{\v{s}}ek and Bernd G{\"a}rtner}, title = {Understanding and Using Linear Programming}, series = {\bibremark{No string.}Universitext}, publisher = publisher-springer, year = {2006} } @Misc{ MMMMSW06, author = {Kurt Mehlhorn and Rolf M{\"o}hring and Burkhard Monien and Petra Mutzel and Peter Sanders and Dorothea Wagner}, title = {{B}eschreibung des {DFG}-{S}chwerpunktprogramms zum {T}hema {A}lgorithm {E}ngineering}, year = {2006}, howpublished = {Call for proposals of the Deutsche Forschungsgemeinschaft (DFG) (in German language)}, myurl = {http://www.algorithm-engineering.de/beschreibung.pdf} } @InProceedings{ MRR06, author = {Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, title = {Enumerate and Expand: Improved Algorithms for {C}onnected {V}ertex {C}over and {T}ree {C}over}, booktitle = proc-csr-06, myeditor = {Dima Grigoriev and John Harrison and Edward A. Hirsch}, publisher = publisher-springer, series = series-springer-lncs, volume = {3967}, year = {2006}, pages = {270--280}, myurl = {http://dx.doi.org/10.1007/11753728_28}, doi = {10.1007/11753728_28} } @Book{ Nie06, author = {Rolf Niedermeier}, title = {Invitation to Fixed-Parameter Algorithms}, myseries = {\bibremark{No string.}Oxford Lecture Series in Mathematics and Its Applications}, mynumber = {31}, publisher = publisher-oxford, year = {2006} } @Article{ OK06, author = {Kanae Oda and Hiroaki Kitano}, title = {A comprehensive map of the toll-like receptor signaling network}, journal = {\bibremark{No string.}Molecular Systems Biology\bibremark{No publisher.}}, volume = {2}, year = {2006}, eid = {2006.0015}, doi = {10.1038/msb4100057} } @InProceedings{ PD06, author = {Tobias Polzin and Siavash Vahdati Daneshmand}, title = {Practical Partitioning-Based Methods for the {S}teiner Problem}, booktitle = proc-wea-06, series = series-springer-lncs, volume = {4007}, pages = {241--252}, publisher = publisher-springer, year = {2006} } @Article{ PS06, author = {Elena Prieto and Christian Sloper}, title = {Looking at the stars}, journal = journal-tcs, publisher = publisher-elsevier, volume = {351}, number = {3}, pages = {437--445}, year = {2006}, doi = {10.1016/j.tcs.2005.10.009} } @InProceedings{ PSS06, author = {F{\'a}bio Protti and Maise Dantas da Silva and Jayme L. Szwarcfiter}, title = {Applying Modular Decomposition to Parameterized Bicluster Editing}, booktitle = proc-iwpec-06, series = series-springer-lncs, volume = {4169}, pages = {1--12}, publisher = publisher-springer, year = {2006}, doi = {10.1007/s00224-007-9032-7}, note = {To appear under the title ``Applying modular decomposition to parameterized cluster editing problems'' in } # journal-tocs-it } @Article{ Rau06, author = {Dieter Rautenbach}, title = {Some remarks about leaf roots}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {306}, number = {13}, year = {2006}, pages = {1456--1461}, myurl = {http://dx.doi.org/10.1016/j.disc.2006.03.030}, doi = {10.1016/j.disc.2006.03.030} } @Book{ Ros06, author = {Kenneth H. Rosen}, title = {Discrete Mathematics and Its Applications}, publisher = {\bibremark{No string.}McGraw Hill}, year = {2006}, edition = {6th} } @Article{ RS06, author = {Venkatesh Raman and Saket Saurabh}, title = {Parameterized algorithms for feedback set problems and their duals in tournaments}, journal = journal-tcs, publisher = publisher-elsevier, volume = {351}, number = {3}, pages = {446--458}, year = {2006}, doi = {10.1016/j.tcs.2005.10.010} } @InCollection{ San06, author = {Tuomas Sandholm}, title = {Optimal Winner Determination Algorithms}, booktitle = {Combinatorial Auctions}, editor = {Cramton and Shoham and Steinberg}, publisher = publisher-mit, year = {2006}, chapter = {14} } @Article{ SI06, author = {Sharan, Roded and Ideker, Trey}, title = {Modeling cellular machinery through biological network comparison}, journal = {\bibremark{No string.}Nature Biotechnology}, volume = {24}, pages = {427--433}, publisher = {\bibremark{No string.}Nature Publishing Group}, year = {2006} } @Article{ SIKS06, author = {Jacob Scott and Trey Ideker and Richard M. Karp and Roded Sharan}, title = {Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks}, journal = journal-jcomputbiol, publisher = publisher-maryannliebert, volume = {13}, number = {2}, pages = {133--144}, year = {2006} } @InProceedings{ SKD06, author = {Harald Sack and Uwe Kr{\"u}ger and Michael Dom}, title = {A Knowledge Base on {NP}-complete Decision Problems and its Application in Bibliographic Search}, booktitle = {XML-Tage~2006}, location = {Berlin}, month = sep, year = {2006} } @Article{ SSRSI06, author = {Silpa Suthram and Tomer Shlomi and Eytan Ruppin and Roded Sharan and Trey Ideker}, title = {A direct comparison of protein interaction confidence assignment schemes}, journal = {\bibremark{No string.}BMC Bioinformatics\bibremark{No publisher.}}, volume = {7}, year = {2006}, eid = {360}, doi = {10.1186/1471-2105-7-360} } @Article{ SSRS06, author = {Tomer Shlomi and Daniel Segal and Eytan Ruppin and Roded Sharan}, title = {{QPath}: a method for querying pathways in a protein-protein interaction network}, journal = {\bibremark{No string.}BMC Bioinformatics\bibremark{No publisher.}}, volume = {7}, year = {2006}, eid = {199}, doi = {10.1186/1471-2105-7-199} } @Article{ TC06, author = {Tatsuie Tsukiji and Zhi-Zhong Chen}, title = {Computing phylogenetic roots with bounded degrees and errors is {NP}-complete}, journal = journal-tcs, publisher = publisher-elsevier, volume = {363}, number = {1}, year = {2006}, pages = {43--59}, myurl = {http://dx.doi.org/10.1016/j.tcs.2006.06.016}, doi = {10.1016/j.tcs.2006.06.016} } @InCollection{ TSS06, author = {Amos Tanay and Roded Sharan and Ron Shamir}, title = {Biclustering algorithms: A survey}, booktitle = {Handbook of Computational Molecular Biology}, editor = {Srinivas Aluru}, pages = {26.1--26.17}, publisher = {\bibremark{No string.}Chapman Hall/CRC Press}, year = {2006} } @InProceedings{ VWW06, author = {Virginia Vassilevska and Ryan Williams and Shan Leung Maverick Woo}, title = {Confronting hardness using a hybrid approach}, booktitle = proc-soda-06, pages = {1--10}, publisher = publisher-acmsiam, year = {2006}, doi = {10.1145/1109557.1109558} } @PhDThesis{ Wer06PhDThesis, author = {Sebastian Wernicke}, title = {Combinatorial Algorithms to Cope with the Complexity of Biological Networks}, year = {2006}, school = institution-fsuinf } @Article{ Wer06Transactions, author = {Sebastian Wernicke}, title = {Efficient detection of network motifs}, journal = {\bibremark{No string.}IEEE/ACM Transactions on Computational Biology and Bioinformatics\bibremark{No publisher.}}, volume = {3}, number = {4}, pages = {347--359}, year = {2006} } @Article{ WO06, author = {Rong-Long Wang and Kozo Okazaki}, title = {A Hill-Shift Learning Algorithm of {H}opfield Network for Bipartite Subgraph Problem}, journal = {\bibremark{No string.}IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\bibremark{No journal.}}, volume = {E89-A}, number = {1}, pages = {354--358}, year = {2006}, doi = {10.1093/ietfec/e89-a.1.354} } @Article{ WR06, author = {Sebastain Wernicke and Florian Rasche}, title = {{FANMOD:} {A}~tool for fast network motif detection}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {22}, number = {9}, pages = {1152--1153}, year = {2006} } @Article{ ZWWC06, author = {Xiang-Sun Zhang and Rui-Sheng Wang and Ling-Yun Wu and Luonan Chen}, title = {Models and Algorithms for Haplotyping Problem}, journal = {\bibremark{No string.}Current Bioinformatics\bibremark{No publisher.}}, volume = {1}, number = {1}, pages = {104--114}, year = {2006}, myurl = {http://www.bentham.org/cbio/Samples/cbio1-1/Chen.pdf} } @InProceedings{ ACMM05, author = {Amit Agarwal and Moses Charikar and Konstantin Makarychev and Yury Makarychev}, title = {{$O(\sqrt{\log n})$} approximation algorithms for min~{UnCut}, min~{2CNF} deletion, and directed cut problems}, booktitle = proc-stoc-05, pages = {573--581}, publisher = publisher-acm, year = {2005}, doi = {10.1145/1060590.1060675} } @TechReport{ ACN05TechReport, author = {Nir Ailon and Moses Charikar and Alantha Newman}, title = {Proofs of Conjectures in ``{A}ggregating Inconsistent Information: Ranking and Clustering''}, institution = institution-princetoncs, year = {2005}, number = {TR-719-05}, myurl = {ftp://ftp.cs.princeton.edu/techreports/2005/719.pdf} } @InProceedings{ ACN05STOC, author = {Nir Ailon and Moses Charikar and Alantha Newman}, title = {Aggregating inconsistent information: ranking and clustering}, booktitle = proc-stoc-05, pages = {684--693}, publisher = publisher-acm, year = {2005}, doi = {10.1145/1060590.1060692} } @Article{ ADN05, author = {Jochen Alber and Frederic Dorn and Rolf Niedermeier}, title = {Experimental evaluation of a tree decomposition based algorithm for Vertex Cover on planar graphs}, journal = journal-discreteapplmath, volume = {145}, number = {2}, pages = {219--231}, publisher = publisher-elsevier, year = {2005}, doi = {10.1016/j.dam.2004.01.013} } @Article{ AFFFNRS05, author = {Jochen Alber and Hongbing Fan and Michael R. Fellows and Henning Fernau and Rolf Niedermeier and Frances A. Rosamond and Ulrike Stege}, title = {A refined search tree technique for {D}ominating {S}et on planar graphs}, journal = journal-jcss, volume = {71}, number = {4}, pages = {385--405}, publisher = publisher-elsevier, year = {2005} } @InProceedings{ AGM05, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi}, title = {Compact Routing for Graphs Excluding a Fixed Minor}, booktitle = proc-disc-05, pages = {442--456}, year = {2005}, series = series-springer-lncs, volume = {3724}, publisher = publisher-springer } difficult name @InProceedings{ ALS05, author = {Faisal N. Abu{-}Khzam and Michael A. Langston and W. Henry Suters}, title = {Fast, effective vertex cover kernelization: a tale of two algorithms}, booktitle = {\bibremark{No string.}Proceedings of the 3rd ACS/IEEE International Conference on Computer Systems and Applications (AICCSA~'05)}, pages = {16~pp.}, publisher = {\bibremark{No string.}ACS/IEEE}, year = {2005}, doi = {10.1109/AICCSA.2005.1387015} } difficult name @Unpublished{ ALSS05, author = {Faisal N. Abu{-}Khzam and Michael A. Langston and Pushkar Shanbhag and Christopher T. Symons}, title = {Scalable parallel algorithms for {FPT} problems}, year = {2005}, note = {To appear in } # journal-algorithmica-it } @InProceedings{ AM05, author = {Ittai Abraham and Dahlia Malkhi}, title = {Name independent routing for growth bounded networks}, booktitle = proc-spaa-05, myeditor = {Phillip B. Gibbons and Paul G. Spirakis}, year = {2005}, pages = {49--55}, myurl = {http://doi.acm.org/10.1145/1073970.1073978}, publisher = publisher-acm, isbn = {1-58113-986-1} } @Article{ AMY05, author = {Yonatan Aumann and Efrat Manisterski and Zohar Yakhini}, title = {Designing optimally multiplexed {SNP} genotyping assays}, journal = journal-jcss, publisher = publisher-elsevier, volume = {70}, number = {3}, year = {2005}, pages = {399--417}, myurl = {http://dx.doi.org/10.1016/j.jcss.2004.12.004}, doi = {10.1016/j.jcss.2004.12.004} } @InProceedings{ ASS05, author = {Noga Alon and Asaf Shapira and Benny Sudakov}, title = {Additive Approximation for Edge-Deletion Problems}, booktitle = proc-focs-05, pages = {419--428}, publisher = publisher-ieee, year = {2005}, note = {Journal version to appear in } # journal-annofmath-it, myurl = {http://annals.math.princeton.edu/issues/2006/FinalFiles/AlonShapiraSudakovFinal.pdf} } @Article{ BBT05, author = {Balabhaskar Balasundaram and Sergiy Butenko and Svyatoslav Trukhanovzu}, title = {Novel Approaches for Analyzing Biological Networks}, journal = {\bibremark{No string.}Journal of Combinatorial Optimization}, volume = {10}, number = {1}, pages = {23--39}, publisher = publisher-springer, year = {2005} } @Article{ BDF05, author = {Michael A. Bender and Erik D. Demaine and Martin Farach-Colton}, title = {Cache-Oblivious B-Trees}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {35}, number = {2}, year = {2005}, pages = {341--358}, myurl = {http://epubs.siam.org/SICOMP/volume-35/art_38995.html} } @Article{ BILR05, author = {Vineet Bafna and Sorin Istrail and Giuseppe Lancia and Romeo Rizzi}, title = {Polynomial and {APX}-hard cases of the individual haplotyping problem}, journal = journal-tcs, publisher = publisher-elsevier, volume = {335}, number = {1}, year = {2005}, pages = {109--125}, myurl = {http://dx.doi.org/10.1016/j.tcs.2004.12.017}, doi = {10.1016/j.tcs.2004.12.017} } difficult name @InProceedings{ BFGKN05, author = {Hans L. Bodlaender and de Figueiredo, Celina M. Herrera and Marisa Gutierrez and Ton Kloks and Rolf Niedermeier}, title = {Simple max-cut for split-indifference graphs and graphs with Few {$P_4$}'s}, booktitle = proc-wea-05, series = series-springer-lncs, volume = {3503}, pages = {87--99}, publisher = publisher-springer, year = {2005}, myurl = {http://springerlink.com/content/50k2qyfxcx4h4l0f} } @Unpublished{ BraL05, author = {Andreas Brandst{\"a}dt and Van Bang Le and R. Sritharan}, title = {Structure and linear time recognition of 4-leaf powers}, year = {2005}, note = {Manuscript} } @Unpublished{ BryL05, author = {David Bryant and Jens Lagergren}, title = {Compatibility of unrooted phylogenetic trees is {FPT}}, year = {2005}, note = {To appear in } # journal-tcs-it, month = may } @InProceedings{ Bod05, author = {Hans L. Bodlaender}, title = {Discovering treewidth}, booktitle = proc-sofsem-05, series = series-springer-lncs, volume = {3381}, pages = {1--16}, publisher = publisher-springer, year = {2005} } @InProceedings{ BTV05, author = {Cristina Bazgan and Zsolt Tuza and Daniel Vanderpooten}, title = {Complexity and Approximation of Satisfactory Partition Problems}, booktitle = proc-cocoon-05, pages = {829--838}, year = {2005}, series = series-springer-lncs, volume = {3595}, publisher = publisher-springer } @Article{ CDKW05, author = {Gruia C{\u{a}}linescu and Adrian Dumitrescu and Howard J. Karloff and Peng-Jun Wan}, title = {Separating Points by Axis-parallel Lines}, journal = journal-internatjcomputgeomappl, publisher = publisher-worldscientific, volume = {15}, number = {6}, year = {2005}, pages = {575--590}, myurl = {http://dx.doi.org/10.1142/S0218195905001865}, doi = {10.1142/S0218195905001865} } @Article{ CFG05, author = {Yijia Chen and J{\"o}rg Flum and Martin Grohe}, title = {Machine-based methods in parameterized complexity theory}, journal = journal-tcs, publisher = publisher-elsevier, volume = {339}, number = {2--3}, pages = {167--199}, year = {2005} } @InProceedings{ CFKX05, author = {Jianer Chen and Henning Fernau and Iyad A. Kanj and Ge Xia}, title = {Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size}, booktitle = proc-stacs-05, series = series-springer-lncs, volume = {3404}, pages = {269--280}, publisher = publisher-springer, year = {2005} } @Article{ CG05, author = {L. Sunil Chandran and Fabrizio Grandoni}, title = {Refined Memorisation for Vertex Cover}, journal = journal-ipl, volume = {93}, number = {3}, pages = {125--131}, publisher = publisher-elsevier, year = {2005} } @Article{ CGW05, author = {Moses Charikar and Venkatesan Guruswami and Anthony Wirth}, title = {Clustering with qualitative information}, journal = journal-jcss, publisher = publisher-elsevier, volume = {71}, number = {3}, year = {2005}, pages = {360--383}, myurl = {http://dx.doi.org/10.1016/j.jcss.2004.10.012}, doi = {10.1016/j.jcss.2004.10.012} } @Unpublished{ CKX05, author = {Jianer Chen and Iyad A. Kanj and Ge Xia}, title = {Simplicity is beauty: improved upper bounds for {V}ertex {C}over}, year = {2005}, note = {Manuscript}, month = apr } @Article{ CLRWXXJ05, author = {Zhi-Zhong Chen and Guohui Lin and Romeo Rizzi and Jianjun Wen and Dong Xu and Ying Xu and Tao Jiang}, title = {More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling}, journal = journal-jcomputbiol, volume = {12}, number = {2}, year = {2005}, pages = {129--146}, myurl = {http://dx.doi.org/10.1089/cmb.2005.12.129}, doi = {10.1089/cmb.2005.12.129} } @Article{ CLS+05, author = {Chesler, Elissa J. and Lu, Lu and Shou, Siming and Qu, Yanhua and Gu, Jing and Wang, Jintao and Hsu, Hui C. and Mountz, John D. and Baldwin, Nicole E. and Langston, Michael A. and Threadgill, David W. and Manly, Kenneth F. and Williams, Robert W. }, title = {Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function}, journal = {\bibremark{No string.}Nature Genetics}, volume = {37}, number = {3}, pages = {233--242}, publisher = {\bibremark{No string.}Nature Publishing Group}, year = {2005}, doi = {10.1038/ng1518}, myurl = {http://dx.doi.org/10.1038/ng1518} } @InProceedings{ Dam05, author = {Peter Damaschke}, title = {On the Fixed-Parameter Enumerability of Cluster Editing}, booktitle = proc-wg-05, series = series-springer-lncs, volume = {3787}, pages = {283--294}, publisher = publisher-springer, year = {2005} } @Article{ DFHT05, author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {Subexponential parameterized algorithms on bounded-genus graphs and \textit{H}-minor-free graphs}, journal = journal-jacm, publisher = publisher-acm, volume = {52}, number = {6}, year = {2005}, pages = {866--893}, myurl = {http://doi.acm.org/10.1145/1101821.1101823} } @InProceedings{ DFLRS05, author = {Frank K. H. A. Dehne and Michael R. Fellows and Michael A. Langston and Frances A. Rosamond and Kim Stevens}, title = {An {${O(2^{O(k)} n^3)}$} {FPT} Algorithm for the Undirected Feedback Vertex Set Problem}, booktitle = proc-cocoon-05, series = series-springer-lncs, volume = {3595}, pages = {859--869}, publisher = publisher-springer, year = {2005} } @InProceedings{ DGN05, author = {Michael Dom and Jiong Guo and Rolf Niedermeier}, title = {{B}ounded {D}egree {C}losest $k$-{T}ree {P}ower is {NP}-complete}, booktitle = proc-cocoon-05, pages = {757--766}, year = {2005}, series = series-springer-lncs, volume = {3595}, publisher = publisher-springer, myurl = {http://dx.doi.org/10.1007/11533719_77}, doi = {10.1007/11533719_77} } @InProceedings{ DGHN05, author = {Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Extending the Tractability Border for Closest Leaf Powers}, booktitle = proc-wg-05, year = {2005}, series = series-springer-lncs, volume = {3787}, pages = {397--408}, publisher = publisher-springer, myurl = {http://dx.doi.org/10.1007/11604686_35}, doi = {10.1007/11604686_35}, note = {Journal version appeared in } # journal-discreteapplmath-it } @Article{ DGKR05, author = {Irit Dinur and Venkatesan Guruswami and Subhash Khot and Oded Regev}, title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex Cover}, journal = journal-siamjcomput, volume = {34}, number = {5}, pages = {1129--1146}, publisher = publisher-siam, year = {2005}, doi = {10.1137/S0097539704443057} } @InProceedings{ DH05, author = {Erik D. Demaine and MohammadTaghi Hajiaghayi}, title = {Bidimensionality: New Connections between {FPT} Algorithms and {PTASs}}, booktitle = proc-soda-05, pages = {590--601}, publisher = publisher-acmsiam, year = {2005} } @Article{ DHT05, author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors}, journal = journal-algorithmica, publisher = publisher-springer, volume = {41}, number = {4}, pages = {245--267}, year = {2005} } @Book{ Die05, author = {Reinhard Diestel}, title = {Graph Theory}, series = {\bibremark{No string.}Graduate Texts in Mathematics}, volume = {173}, publisher = publisher-springer, year = {2005}, edition = {3rd}, } @Article{ DS05, author = {Irit Dinur and Shmuel Safra}, title = {On the Hardness of Approximating Minimum Vertex Cover}, journal = journal-annofmath, publisher = publisher-princeton, year = {2005}, volume = {162}, number = {1}, pages = {439--485}}, myurl = {http://annals.math.princeton.edu/issues/2005/July2005/DinurSafra.pdf} } @InProceedings{ Fer05SOFSEM, author = {Henning Fernau}, title = {Two-Layer Planarization: Improving on Parameterized Algorithmics}, booktitle = proc-sofsem-05, myeditor = {Peter Vojt{\'a}s and M{\'a}ria Bielikov{\'a} and Bernadette Charron-Bost and Ondrej S{\'y}kora}, publisher = publisher-springer, series = series-springer-lncs, volume = {3381}, year = {2005}, pages = {137--146}, myurl = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3381{\&}spage=137} } @Misc{ Fer05Habil, author = {Henning Fernau}, title = {Parameterized Algorithmics: A Graph-Theoretic Approach}, year = {2005}, howpublished = {Habilitationsschrift, } # institution-tuebingeninf } @Article{ FG05, author = {J{\"o}rg Flum and Martin Grohe}, title = {Model-checking problems as a basis for parameterized intractability}, journal = {\bibremark{No string.}Logical Methods in Computer Science\bibremark{No publisher.}}, volume = {1}, number = {1}, year = {2005} } @InProceedings{ FGK05, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, title = {Measure and conquer: domination---a case study}, booktitle = proc-icalp-05, series = series-springer-lncs, volume = {3580}, pages = {191--203}, publisher = publisher-springer, year = {2005} } @InProceedings{ FHRV05, author = {Samuel Fiorini and Nadia Hardy and Bruce Reed and Adrian Vetta}, title = {Planar graph bipartization in linear time}, booktitle = {\bibremark{No string.}Proceedings of the 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO~'05)}, series = {\bibremark{No string.}Electronic Notes in Discrete Mathematics}, volume = {19}, pages = {265--271}, publisher = {Elsevier}, year = {2005}, note = {Journal version to appear in } # journal-discreteapplmath-it, doi = {10.1016/j.dam.2007.08.013} } @TechReport{ FKMRRW05, author = {Bernhard Fuchs and Walter Kern and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith and Xinhui Wang}, title = {Dynamic Programming for Minimum {Steiner} Trees}, number = {zaik2005-492}, institution = {\bibremark{No string.}Zentrum f\"ur Angewandte Informatik, Universit\"at zu K{\"o}ln}, year = {2005}, note = {To appear in } # journal-tocs-it, myurl = {http://www-lti.informatik.rwth-aachen.de/pub/papers/jsteiner.ps} } @InProceedings{ FM05, author = {Tom{\'a}s Feder and Rajeev Motwani}, title = {Finding large cycles in {H}amiltonian graphs}, booktitle = proc-soda-05, pages = {166--175}, publisher = publisher-acmsiam, year = {2005}, doi = {10.1145/1070432.1070456} } @Article{ GGHN05, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation}, journal = journal-tocs, volume = {38}, number = {4}, pages = {373--392}, publisher = publisher-springer, year = {2005}, doi = {10.1007/s00224-004-1178-y} } @InProceedings{ GGHNW05, author = {Jiong Guo and Jens Gramm and Falk H{\"u}ffner and Rolf Niedermeier and Sebastian Wernicke}, title = {Improved fixed-parameter algorithms for two feedback set problems}, booktitle = proc-wads-05, series = series-springer-lncs, volume = {3503}, pages = {158--168}, publisher = publisher-springer, year = {2005}, doi = {10.1007/11427186_22} } @Article{ GN05jdiscretealgorithms, author = {Jiong Guo and Rolf Niedermeier}, title = {Exact algorithms and applications for {T}ree-like {W}eighted {S}et {C}over}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, year = {2005}, note = {To appear} } @Article{ GN05Networks, author = {Jiong Guo and Rolf Niedermeier}, title = {Fixed-Parameter Tractability and Data Reduction for {M}ulticut in {T}rees}, journal = {\bibremark{No string.}Networks\bibremark{No publisher.}}, volume = {46}, number = {3}, pages = {124--135}, year = {2005} } @InProceedings{ GNR05, author = {Jiong Guo and Rolf Niedermeier and Daniel Raible}, title = {Improved algorithms and complexity results for power domination in graphs}, booktitle = proc-fct-05, series = series-springer-lncs, volume = {3623}, pages = {172--184}, publisher = publisher-springer, year = {2005} } @Unpublished{ GNST04, author = {Jens Gramm and Till Nierhoff and Roded Sharan and Till Tantau}, title = {Haplotyping with missing data via perfect path phylogenies}, year = {2005}, note = {To appear in } # journal-discreteapplmath } @InProceedings{ GNW05, author = {Jiong Guo and Rolf Niedermeier and Sebastian Wernicke}, title = {Parameterized Complexity of Generalized Vertex Cover Problems}, booktitle = proc-wads-05, series = series-springer-lncs, pages = {36--48}, publisher = publisher-springer, year = {2005} } @PhDThesis{ Guo05, author = {Jiong Guo}, title = {Algorithm Design Techniques for Parameterized Graph Modification Problems}, year = {2005}, school = institution-fsuinf } @InCollection{ HKK05, author = {Illya V. Hicks and Arie M. C. A. Koster and Elif Koloto{\u{g}}lu}, title = {Branch and Tree Decomposition Techniques for Discrete Optimization}, booktitle = {TutORials 2005}, series = {\bibremark{No string.}Tutorials in Operations Research}, pages = {1--29}, publisher = publisher-informs, year = {2005}, myurl = {http://www.zib.de/koster/download/Tutorials2005-chapter01.pdf} } @Article{ HKS05, author = {Eran Halperin and Gad Kimmel and Ron Shamir}, title = {Tag {SNP} selection in genotype data for maximizing {SNP} prediction accuracy}, journal = journal-bioinformatics, publisher = publisher-oxford, year = {2005}, volume = {21}, number = {1}, pages = {i195--i203} } @InProceedings{ HSTV05, author = {Pinar Heggernes and Karol Suchan and Ioan Todinca and Yngve Villanger}, title = {Minimal Interval Completions}, booktitle = proc-esa-05, myeditor = {Gerth St{\o}lting Brodal and Stefano Leonardi}, publisher = publisher-springer, series = series-springer-lncs, volume = {3669}, year = {2005}, pages = {403--414}, myurl = {http://dx.doi.org/10.1007/11561071_37}, doi = {10.1007/11561071_37} } @proceedings{DBLP:conf/esa/2005, editor = {Gerth St{\o}lting Brodal and Stefano Leonardi}, title = {Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings}, booktitle = {ESA}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {3669}, year = {2005}, isbn = {3-540-29118-0}, bibsource = {DBLP, http://dblp.uni-trier.de} } @InProceedings{ Hue05, author = {Falk H{\"u}ffner}, title = {Algorithm Engineering for Optimal Graph Bipartization}, booktitle = proc-wea-05, series = series-springer-lncs, volume = {3503}, pages = {240--252}, publisher = publisher-springer, year = {2005} } @InProceedings{ IIO05, author = {Hiro Ito and Kazuo Iwama and Tsuyoshi Osumi}, title = {Linear-Time Enumeration of Isolated Cliques}, booktitle = proc-esa-05, series = series-springer-lncs, volume = {3669}, pages = {119--131}, publisher = publisher-springer, year = {2005} } @Article{ Joh05, author = {David S. Johnson}, title = {The {NP}-completeness column}, journal = journal-acmtransalgorithms, publisher = publisher-acm, volume = {1}, number = {1}, year = {2005}, pages = {160--176}, myurl = {http://doi.acm.org/10.1145/1077464.1077476} } @InProceedings{ JAS05, author = {Benjamin N. Jackson and Srinivas Aluru and Patrick S. Schnable}, title = {Consensus Genetic Maps: A Graph Theoretic Approach}, booktitle = {\bibremark{No string.}Proceedings of the IEEE Computational Systems Bioinformatics Conference (CSB~'05)}, year = {2005}, publisher = publisher-ieee } @InProceedings{ KL05, author = {William Kennedy and Guohui Lin}, title = {5-th Phylogenetic Root Construction for Strictly Chordal Graphs}, booktitle = proc-isaac-05, myeditor = {Xiaotie Deng and Ding-Zhu Du}, year = {2005}, publisher = publisher-springer, series = series-springer-lncs, volume = {3827}, pages = {738--747}, myurl = {http://dx.doi.org/10.1007/11602613_74}, doi = {10.1007/11602613_74} } @Article{ KMN05, author = {Matthew J. Katz and Joseph S. B. Mitchell and Yuval Nir}, title = {Orthogonal segment stabbing}, journal = journal-computgeom, publisher = publisher-elsevier, volume = {30}, number = {2}, year = {2005}, pages = {197--205}, myurl = {http://dx.doi.org/10.1016/j.comgeo.2004.07.002}, doi = {10.1016/j.comgeo.2004.07.002} } @InProceedings{ KMRR05, author = {Joachim Kneis and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, title = {Algorithms Based on the Treewidth of Sparse Graphs}, booktitle = proc-wg-05, series = series-springer-lncs, volume = {3787}, pages = {385--396}, publisher = publisher-springer, year = {2005}, doi = {10.1007/11604686_34} } @Article{ Kou05, author = {Ioannis Koutis}, title = {A faster parameterized algorithm for set packing}, journal = journal-ipl, volume = {94}, number = {1}, pages = {7--9}, publisher = publisher-elsevier, year = {2005}, doi = {10.1016/j.ipl.2004.12.005} } difficult name @InProceedings{ KRWWZ05, author = {Fabian Kuhn and von Rickenbach, Pascal and Roger Wattenhofer and Emo Welzl and Aaron Zollinger}, title = {Interference in Cellular Networks: The Minimum Membership Set Cover Problem}, booktitle = proc-cocoon-05, pages = {188--198}, year = {2005}, series = series-springer-lncs, volume = {3595}, publisher = publisher-springer } @Book{ KT05, author = {Jon Kleinberg and {\'{E}}va Tardos}, title = {Algorithm Design}, publisher = {\bibremark{No string.}Pearson, Addison Wesley}, year = {2005} } @InProceedings{ LFS05, author = {Vincent Lacroix and Cristina G. Fernandes and Marie-France Sagot}, title = {Reaction Motifs in Metabolic Networks}, booktitle = {\bibremark{No string.}Proceedings of the 5th International Workshop on Algorithms in Bioinformatics (WABI~'05)}, series = series-springer-lncs, volume = {3692}, pages = {178--191}, publisher = publisher-springer, year = {2005} } @Article{ LM05, author = {Stefan Langerman and Pat Morin}, title = {Covering Things with Things}, journal = journal-discretecomputgeom, publisher = publisher-springer, volume = {33}, number = {4}, year = {2005}, pages = {717--729}, myurl = {http://dx.doi.org/10.1007/s00454-004-1108-4}, doi = {10.1007/s00454-004-1108-4} } @InProceedings{ Mar05FOCS, author = {D{\'a}niel Marx}, title = {The {C}losest {S}ubstring problem with small distances}, booktitle = proc-focs-05, pages = {63--72}, publisher = publisher-ieee, year = {2005} } @Article{ Mar05Computational, author = {D{\'a}niel Marx}, title = {Parameterized complexity of constraint satisfaction problems}, journal = {\bibremark{No string.}Computational Complexity\bibremark{No publisher.}}, volume = {14}, number = {2}, pages = {153--183}, year = {2005}, doi = {10.1007/s00037-005-0195-9} } @Book{ MF05, author = {Zbigniew Michalewicz and David B. Fogel}, title = {How to Solve It: Modern Heuristics}, publisher = publisher-springer, year = {2005} } difficult name @Article{ MLL+05, author = {Huaiyu Mi and Betty Lazareva{-}Ulitsky and Rozina Loo and Anish Kejariwal and Jody Vandergriff and Steven Rabkin and Nan Guo and Anushya Muruganujan and Olivier Doremieux and Michael J. Campbell and Hiroaki Kitano and Paul D. Thomas}, title = {The {PANTHER} database of protein families, subfamilies, functions and pathways}, journal = {\bibremark{No string.}Nucleic Acids Research\bibremark{No publisher.}}, volume = {33}, number = {Supplement~1}, pages = {284--288}, year = {2005}, doi = {10.1093/nar/gki078} } @TechReport{ MRR05, author = {Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, title = {A faster algorithm for the {S}teiner Tree problem}, number = {AIB-2005-04}, institution = {\bibremark{No string.}Deptartment of Computer Science, RWTH Aachen}, year = {2005}, month = mar } @InProceedings{ MSW05, author = {Steffen Mecke and Anita Sch{\"o}bel and Dorothea Wagner}, title = {Station Location -- Complexity and Approximation}, booktitle = proc-atmos-05, year = {2005}, myeditor = {Leo G. Kroon and Rolf H. M{\"o}hring}, publisher = publisher-dagstuhl, myurl = {http://drops.dagstuhl.de/opus/volltexte/2006/661} } @Misc{ Mos05, author = {Hannes Moser}, title = {Exact algorithms for generalizations of {V}ertex {C}over}, howpublished = {Diploma thesis, } # institution-fsuinf, year = {2005} } @Book{ MU05, author = {Mitzenmacher, Michael and Upfal, Eli}, title = {{Probability and Computing: Randomized Algorithms and Probabilistic Analysis}}, publisher = publisher-cambridge, year = {2005} } @Article{ NRT05, author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, title = {Fast fixed-parameter tractable algorithms for nontrivial generalizations of {V}ertex {C}over}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {152}, number = {1--3}, year = {2005}, pages = {229--245}, myurl = {http://dx.doi.org/10.1016/j.dam.2005.02.029}, doi = {10.1016/j.dam.2005.02.029} } difficult name @PhDThesis{ Pri05, author = {Elena Prieto{ }Rodr{\'i}guez}, title = {Systematic Kernelization in {FPT} Algorithm Design}, year = {2005}, school = {\bibremark{No string.}School of Electrical Engineering and Computer Science, The University of Newcastle, Australia} } @Unpublished{ RS05, author = {Venkatesh Raman and Saket Saurabh}, title = {Parameterized Algorithms for Feedback Set Problems and Their Duals in Tournaments}, year = {2005} } @InProceedings{ RSSub05, author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian}, title = {Faster algorithms for feedback vertex set}, booktitle = {\bibremark{No string.}Proc.\ 2nd GRACO\bibremark{No publisher.}}, year = {2005}, series = {\bibremark{No string.}Electronic Notes in Discrete Mathematics} } @InProceedings{ RSSik05, author = {Venkatesh Raman and Saket Saurabh and Somnath Sikdar}, title = {Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems}, booktitle = proc-ictcs-05, series = series-springer-lncs, volume = {3701}, pages = {375--389}, publisher = publisher-springer, year = {2005}, note = {To appear under the title ``Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques'' in } # journal-tocs-it } @InProceedings{ SIKS05, author = {Jacob Scott and Trey Ideker and Richard M. Karp and Roded Sharan}, title = {Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks}, booktitle = {\bibremark{No string.}Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB~'05)}, year = {2005}, pages = {1--13}, publisher = publisher-springer, series = series-springer-lncs, volume = {3500} } @InProceedings{ SLMPC05, author = {Yinglei Song and Chunmei Liu and Russell Malmberg and Fangfang Pan and Liming Cai}, title = {Tree Decomposition Based Fast Search of RNA Structures including Pseudoknots in Genomes}, booktitle = {\bibremark{No string.}Proceedings of the IEEE Computational Systems Bioinformatics Conference (CSB~'05)}, year = {2005}, publisher = publisher-ieee } @Article{ SPBPTH05, author = {Michelle S. Scott and Theodore Perkins and Scott Bunnell and Fran{\c{c}}ois Pepin and David Y. Thomas and Michael Hallett}, title = {Identifying Regulatory Subnetworks for a Set of Genes}, journal = {\bibremark{No string.}Molecular\,\&\,Cellular Proteomics\bibremark{No publisher.}}, volume = {4}, number = {5}, pages = {683--692}, year = {2005}, doi = {10.1074/mcp.M400110-MCP200} } @InProceedings{ Spi05, author = {Andreas Spillner}, title = {A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points}, booktitle = proc-acid-05, publisher = publisher-collegepublications, series = series-collegepublications-algorithmics, pages = {135--146}, year = {2005} } @InProceedings{ SS05, author = {Peter Sanders and Dominik Schultes}, title = {Highway Hierarchies Hasten Exact Shortest Path Queries}, booktitle = proc-esa-05, year = {2005}, pages = {568--579}, myurl = {http://dx.doi.org/10.1007/11561071\_51}, doi = {10.1007/11561071\_51}, myeditor = {Gerth St{\o}lting Brodal and Stefano Leonardi}, publisher = publisher-springer, series = series-springer-lncs, volume = {3669}, isbn = {3-540-29118-0} } @Article{ ST05, author = {Maria J. Serna and Dimitrios M. Thilikos}, title = {Parameterized Complexity for Graph Layout Problems}, journal = {\bibremark{No string.}Bulletin of the EATCS}, volume = {86}, year = {2005}, pages = {41--65} } @PhDThesis{ Sud05, author = {Matthew Suderman}, title = {Layered Graph Drawing}, year = {2005}, school = {\bibremark{No string.}School of Computer Science, McGill University Montr{\'e}al, Canada}, myurl = {http://www.mcb.mcgill.ca/{\~{ }}msuder/thesis.pdf} } @article{ SW05, author = {Matthew Suderman and Sue Whitesides}, title = {Experiments with the Fixed-Parameter Approach for Two-Layer Planarization}, journal = journal-jgraphalgorithmsappl # {\bibremark{No publisher.}}, volume = {9}, number = {1}, year = {2005}, pages = {149--163}, myurl = {http://jgaa.info/accepted/2005/SudermanWhitesides2005.9.1.pdf} } @Misc{ Tru05, author = {Anke Tru{\ss}}, title = {{P}arametrisierte {A}lgorithmen f{\"u}r {F}eedback-{S}et-{P}robleme auf {T}urniergraphen}, year = {2005}, howpublished = {Diploma thesis, } # institution-fsuinf, note = {Parameterized algorithms for feedback set problems in tournaments, in German language} } @Article{ TZ05, author = {Mikkel Thorup and Uri Zwick}, title = {Approximate distance oracles}, journal = journal-jacm, publisher = publisher-acm, volume = {52}, number = {1}, year = {2005}, pages = {1--24} } @InProceedings{ Wer05, author = {Sebastian Wernicke}, title = {A Faster algorithm for detecting network motifs}, booktitle = {\bibremark{No string.}Proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI~'05)}, year = {2005}, publisher = publisher-springer, series = series-springer-lncs } @Article{ Wil05, author = {Ryan Williams}, title = {A new algorithm for optimal 2-constraint satisfaction and its implications}, journal = journal-tcs, publisher = publisher-elsevier, volume = {348}, number = {2--3}, pages = {357--365}, year = {2005}, doi = {10.1016/j.tcs.2005.09.023} } @InProceedings{ XJB05, author = {Jinbo Xu and Feng Jiao and Bonnie Berger}, title = {A Tree-Decomposition Approach to Protein Structure Prediction}, booktitle = {\bibremark{No string.}Proceedings of the 4th International Conference on Computational Systems Bioinformatics (CSB~'05)}, pages = {247--256}, publisher = publisher-ieee, year = {2005} } @Article{ ADN04, author = {Jochen Alber and Frederic Dorn and Rolf Niedermeier}, title = { Experimental evaluation of a tree decomposition based algorithm for {V}ertex {C}over on planar graphs}, journal = journal-discreteapplmath, publisher = publisher-elsevier, year = {2004}, note = {To appear} } @Article{ AF04, author = {Jochen Alber and Ji{\v{r}}{\'{i}} Fiala}, title = {Geometric separation and exact solutions for the parameterized independent set problem on disk graphs}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {52}, number = {2}, pages = {134--151}, year = {2004} } difficult name @InProceedings{ ACFLSS04, author = {Faisal N. Abu{-}Khzam and Rebecca L. Collins and Michael R. Fellows and Michael A. Langston and W. Henry Suters and Christof T. Symons}, title = {Kernelization Algorithms for the Vertex Cover problem: Theory and Experiments}, booktitle = proc-alenex-04, pages = {62--69}, publisher = publisher-acmsiam, year = {2004} } @Article{ AFelN04, author = {Jochen Alber and Michael R. Fellows and Rolf Niedermeier}, title = {Polynomial-time data reduction for {D}ominating {S}et}, journal = journal-jacm, publisher = publisher-acm, volume = {51}, number = {3}, year = {2004}, pages = {363--384}, myurl = {http://doi.acm.org/10.1145/990308.990309}, doi = {10.1145/990308.990309} } @Article{ AFerN04, author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, title = {Parameterized complexity: exponential speed-up for planar graph problems}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {52}, number = {1}, pages = {26--56}, year = {2004} } @Article{ AGGN04, author = {Jochen Alber and Jens Gramm and Jiong Guo and Rolf Niedermeier}, title = {Computing the similarity of two sequences with nested arc annotations}, journal = journal-tcs, publisher = publisher-elsevier, volume = {312}, number = {2--3}, pages = {337--358}, year = {2004} } @InProceedings{ AGM04, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi}, title = {Routing with Improved Communication-Space Trade-Off}, booktitle = proc-disc-04, myeditor = {Rachid Guerraoui}, year = {2004}, pages = {305--319}, publisher = publisher-springer, series = series-springer-lncs, volume = {3274}, isbn = {3-540-23306-7} } @InProceedings{ AGMNT04, author = {Ittai Abraham and Cyril Gavoille and Dahlia Malkhi and Noam Nisan and Mikkel Thorup}, title = {Compact Name-Independent Routing with Minimum Stretch}, booktitle = proc-spaa-04, publisher = publisher-acm, pages = {20--24}, year = {2004}, mymonth = {jul} } difficult name @InProceedings{ ALS04, author = {Faisal N. Abu{-}Khzam and Michael A. Langston and Pushkar Shanbhag}, title = {Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization}, booktitle = {\bibremark{No string.}Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN~'04)}, pages = {649--654}, publisher = {\bibremark{No string.}IASTED/ACTA Press}, year = {2004}, myurl = {http://www.cs.utk.edu/~langston/projects/papers/scalable.pdf} } @InProceedings{ AM04, author = {Ittai Abraham and Dahlia Malkhi}, title = {Compact routing on euclidian metrics}, booktitle = proc-podc-04, myeditor = {Soma Chaudhuri and Shay Kutten}, year = {2004}, pages = {141--149}, myurl = {http://doi.acm.org/10.1145/1011789}, publisher = publisher-acm, isbn = {1-58113-802-4} } @Article{ BBC04, author = {Nikhil Bansal and Avrim Blum and Shuchi Chawla}, title = {Correlation Clustering}, journal = {\bibremark{No string.}Machine Learning}, volume = {56}, number = {1--3}, pages = {89--113}, publisher = publisher-springer, year = {2004}, myurl = {http://dx.doi.org/10.1023/B:MACH.0000033116.57574.95}, doi = {10.1023/B:MACH.0000033116.57574.95} } @Article{ BBDHP04, author = {Craig Boutilier and Ronen I. Brafman and Carmel Domshlak and Holger H. Hoos and David Poole}, title = {{CP}-nets: A tool for representing and reasoning with conditional {\it Ceteris Paribus} Preference Statements}, journal = {\bibremark{No string.}Journal of Artificial Intelligence Research\bibremark{No publisher.}}, volume = {21}, pages = {135--191}, year = {2004} } @InCollection{ BF04, author = {Steven Brams and Peter C. Fishburn}, title = {Voting Procedures}, booktitle = {Handbook of Social Choice and Welfare}, editor = {K. Arrow and A. Sen and K. Suzumura}, publisher = publisher-elsevier, year = {2004}, chapter = {4} } @InProceedings{ BGRS04, author = {Vittorio Bil{\`o} and Vineet Goyal and R. Ravi and Mohit Singh}, title = {On the Crossing Spanning Tree Problem}, booktitle = proc-approx-04, myeditor = {Klaus Jansen and Sanjeev Khanna and Jos{\'e} D. P. Rolim and Dana Ron}, year = {2004}, pages = {51--60}, publisher = publisher-springer, series = series-springer-lncs, volume = {3122}, myurl = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3122{\&}spage=51} } @Article{ BM04tcs, author = {Prosenjit Bose and Pat Morin}, title = {Competitive online routing in geometric graphs}, journal = journal-tcs, publisher = publisher-elsevier, volume = {324}, number = {2--3}, year = {2004}, pages = {273--288}, myurl = {http://dx.doi.org/10.1016/j.tcs.2004.05.019}, doi = {10.1016/j.tcs.2004.05.019} } @Article{ BM04siamjcomput, author = {Prosenjit Bose and Pat Morin}, title = {Online Routing in Triangulations}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {33}, number = {4}, year = {2004}, pages = {937--951}, myurl = {http://dx.doi.org/10.1137/S0097539700369387}, doi = {10.1137/S0097539700369387} } @InProceedings{ BNU04, author = {Nadja Betzler and Rolf Niedermeier and Johannes Uhlmann}, title = {Tree decompositions of graphs: saving memory in dynamic programming}, booktitle = {\bibremark{No string.}CTW04}, series = {\bibremark{No string.}Electronic Notes in Discrete Mathematics}, volume = {17}, publisher = publisher-elsevier, year = {2004}, note = {Journal version to appear in } # journal-discreteoptim-it } @Article{ BW04, author = {Rolf Backofen and Sebastian Will}, title = {Local sequence-structure motifs in {RNA}}, journal = {\bibremark{No string.}J.~Bioinform.\ Comput.\ Biol.\bibremark{No publisher.}}, year = {2004}, volume = {2}, number = {4}, pages = {681--698} } @InProceedings{ CC04, author = {Miroslav Chleb{\'{i}}k and Janka Chleb{\'{i}}kov{\'{a}}}, title = {Improvement of {Nemhauser--Trotter} theorem and its applications in parameterized complexity}, booktitle = proc-swat-04, series = series-springer-lncs, volume = {3111}, pages = {174--186}, publisher = publisher-springer, year = {2004} } @Unpublished{ Ces04, author = {Marco Cesati}, title = {Compendium of parameterized problems}, year = {2004}, note = {Available through the author's webpage}, month = jan } @InProceedings{ CF04, author = {Yijia Chen and J{\"o}rg Flum}, title = {On miniaturized problems in parameterized complexity theory}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {108--120}, publisher = publisher-springer, year = {2004}, note = {Journal version to appear in } # journal-tcs-it } @InProceedings{ CFJ04, author = {Benny Chor and Michael R. Fellows and David W. Juedes}, title = {Linear Kernels in Linear Time, or How to Save {$k$} Colors in {$O(n^2)$} Steps}, booktitle = proc-wg-04, series = series-springer-lncs, volume = {3353}, pages = {257--269}, publisher = publisher-springer, year = {2004}, myurl = {http://springerlink.com/content/qkj5rucy82d1vty7} } @Article{ CFJK04, author = {Jianer Chen and Donald K. Friesen and Weijia Jia and Iyad A. Kanj}, title = {Using Nondeterminism to Design Efficient Deterministic Algorithms}, journal = journal-algorithmica, publisher = publisher-springer, volume = {40}, number = {2}, pages = {83--97}, year = {2004}, doi = {10.1007/s00453-004-1096-z} } @InProceedings{ CHKX04, author = {Jianer Chen and Xiuzhen Huang and Iyad A. Kanj and Ge Xia}, title = {Linear {FPT} reductions and computational lower bounds}, booktitle = proc-stoc-04, pages = {212--221}, publisher = publisher-acm, year = {2004} } @Article{ CK04, author = {Jianer Chen and Iyad A. Kanj}, title = {Improved exact algorithms for {Max-Sat}}, journal = journal-discreteapplmath, volume = {142}, number = {1--3}, pages = {17--27}, publisher = publisher-elsevier, year = {2004} } @Article{ Cor04, author = {Derek G. Corneil}, title = {A simple 3-sweep {LBFS} algorithm for the recognition of unit interval graphs}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {138}, number = {3}, year = {2004}, pages = {371--379}, myurl = {http://dx.doi.org/10.1016/j.dam.2003.07.001} } @InProceedings{ CT04, author = {Zhi-Zhong Chen and Tatsuie Tsukiji}, title = {Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs}, booktitle = proc-wg-04, year = {2004}, volume = {3353}, series = series-springer-lncs, pages = {308--319}, publisher = publisher-springer, note = {Journal version appeared in } # journal-jalgorithms-it } @InProceedings{ Dam04, author = {Peter Damaschke}, title = {Parameterized enumeration, transversals, and imperfect phylogeny reconstruction}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {1--12}, publisher = publisher-springer, year = {2004}, note = {Journal version to appear in } # journal-tcs-it } @InProceedings{ DFHT04LATIN, author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {Bidimensional Parameters and Local Treewidth}, booktitle = proc-latin-04, series = series-springer-lncs, volume = {2976}, pages = {109--118}, publisher = publisher-springer, year = {2004} } @InProceedings{ DFHT04SODA, author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {Subexponential parameterized algorithms on graphs of bounded-genus and {$H$}-minor-free graphs}, booktitle = proc-soda-04, pages = {830--839}, publisher = publisher-acmsiam, year = {2004} } @Unpublished{ DFLRS04, author = {Frank Dehne and Michael R. Fellows and Michael A. Langston and Frances A. Rosamond and Kim Stevens}, title = {An {$\mathcal O^*(2^{O(k)})$} {FPT} Algorithm for the Undirected Feedback Vertex Set Problem}, note = {Manuscript}, year = {2004}, mymonth = dec } @InProceedings{ DFRS04, author = {Frank K. H. A. Dehne and Michael R. Fellows and Frances A. Rosamond and Peter Shaw}, title = {Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New {FPT} Techniques, an Improved Algorithm for Set Splitting, and a Novel $2k$~Kernelization for {V}ertex {C}over}, booktitle = proc-iwpec-04, pages = {271--280}, year = {2004}, series = series-springer-lncs, volume = {3162}, publisher = publisher-springer, myurl = {http://springerlink.com/content/tyk254arwhkb71cx} } @InProceedings{ DGHN04, author = {Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Error Compensation in Leaf Root Problems}, booktitle = proc-isaac-04, pages = {389--401}, year = {2004}, series = series-springer-lncs, volume = {3341}, publisher = publisher-springer, note = {Journal version appeared in } # journal-algorithmica-it } @Misc{ Dom04, author = {Michael Dom}, title = {{F}ehler-{K}orrektur bei {L}eaf-{R}oot-{P}roblemen ({E}rror Correction in Leaf Root Problems)}, howpublished = {Diploma thesis, } # institution-tuebingeninf, mymonth = oct, year = {2004}, note = {In German language} } @Article{ DHFT04, author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {Bidimensional Parameters and Local Treewidth}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {18}, number = {3}, pages = {501--511}, year = {2004} } @InProceedings{ DHOW04, author = {Vladimir G. Deineko and Michael Hoffmann and Yoshio Okamoto and Gerhard J. Woeginger}, title = {The Traveling Salesman Problem with Few Inner Points}, booktitle = proc-cocoon-04, series = series-springer-lncs, volume = {3106}, pages = {268--277}, publisher = publisher-springer, year = {2004}, myeditor = {Kyung-Yong Chwa and J. Ian Munro}, myurl = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn={0302}-9743{\&}volume= {3106}{\&}spage= {268}} } @InProceedings{ DHT04, author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {The Bidimensional Theory of Bounded-Genus Graphs}, booktitle = proc-mfcs-04, series = series-springer-lncs, volume = {3153}, pages = {191--203}, publisher = publisher-springer, year = {2004} } @InProceedings{ DK04, author = {Andrew J. Davenport and Jayant Kalagnanam}, title = {A Computational Study of the {K}emeny Rule for Preference Aggregation}, booktitle = {\bibremark{No string.}Proceedings of the 19th National Conference on Artificial Intelligence (AAAI'04)}, pages = {697--702}, publisher = {\bibremark{No string.}AAAI Press}, year = {2004} } @Article{ EFF04, author = {John Ellis and Hongbing Fan and Michael R. Fellows}, title = {The {Dominating Set} Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {52}, number = {2}, pages = {152--168}, year = {2004} } @InProceedings{ Epp04, author = {David Eppstein}, title = {Quasiconvex analysis of backtracking algorithms}, booktitle = proc-soda-05, pages = {788--797}, publisher = publisher-acmsiam, year = {2004} } @TechReport{ Fer04duality, author = {Henning Fernau}, title = {Parametric duality: kernel sizes \& algorithmics}, number = {TR04-027}, institution = institution-eccc, year = {2004} } @TechReport{ Fer04topdown, author = {Henning Fernau}, title = {A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-{H}itting {S}et}, institution = institution-eccc, number = {TR04-073}, year = {2004} } @InProceedings{ FG04LICS, author = {J{\"o}rg Flum and Martin Grohe}, title = {Model-checking problems as a basis for parameterized intractability}, booktitle = {\bibremark{No string.}Proc.\ 19th LICS}, pages = {388--397}, publisher = publisher-ieeecs, year = {2004} } @Article{ FG04Bulletin, author = {J{\"o}rg Flum and Martin Grohe}, title = {Parameterized complexity and subexponential time}, journal = {\bibremark{No string.}Bulletin of the European Association for Theoretical Computer Science\bibremark{No publisher.}}, volume = {84}, pages = {71--100}, year = {2004} } @Article{ FG04siamjcomput, author = {J{\"o}rg Flum and Martin Grohe}, title = {The Parameterized Complexity of Counting Problems}, journal = journal-siamjcomput, volume = {33}, number = {4}, pages = {892--922}, publisher = publisher-siam, year = {2004} } @InProceedings{ FGW04, author = {J{\"o}rg Flum and Martin Grohe and Mark Weyer}, title = {Bounded fixed-parameter tractability and {$\log^2 n$} nondeterministic bits}, booktitle = proc-icalp-04, series = series-springer-lncs, volume = {3142}, pages = {555--567}, publisher = publisher-springer, year = {2004} } @InProceedings{ FHRST04, author = {Michael R. Fellows and Pinar Heggernes and Frances A. Rosamond and Christian Sloper and Jan Arne Telle}, title = {Finding {$k$} Disjoint Triangles in an Arbitrary Graph}, booktitle = proc-wg-04, series = series-springer-lncs, volume = {3353}, pages = {235--244}, publisher = publisher-springer, year = {2004} } @InProceedings{ FK04, author = {Sergey Fedin and Alexander Kulikov}, title = {Automated proofs of upper bounds on the running time of splitting algorithms}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {248--259}, publisher = publisher-springer, year = {2004} } @Article{ FKH04, author = {Ariel Felner and Richard E. Korf and Sarit Hanan}, title = {Additive Pattern Database Heuristics}, journal = {\bibremark{No string.}Journal of Artificial Intelligence Research\bibremark{No publisher.}}, volume = {21}, pages = {1--39}, year = {2004} } @InProceedings{ FKNRRSTW04, author = {Michael R. Fellows and Christian Knauer and Naomi Nishimura and Prabhakar Ragde and Frances A. Rosamond and Ulrike Stege and Dimitrios M. Thilikos and Sue Whitesides}, title = {Faster fixed-parameter tractable algorithms for matching and packing Problems}, booktitle = proc-esa-04, series = series-springer-lncs, volume = {3221}, pages = {311--322}, publisher = publisher-springer, year = {2004}, myurl = {http://springerlink.com/content/577a0dnbx2fycp0j}, doi = {10.1007/s00453-007-9146-y}, note = {Journal version to appear in } # journal-algorithmica-it } @inproceedings{ FKW04, author = {Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger}, title = {Exact (Exponential) Algorithms for the Dominating Set Problem}, booktitle = proc-wg-04, myeditor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, series = series-springer-lncs, volume = {3353}, publisher = publisher-springer, year = {2004}, pages = {245--256}, myurl = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3353{\&}spage=245} } @InProceedings{ FSW04, author = {Michael R. Fellows and Stefan Szeider and Graham Wrightson}, title = {On finding short resolution refutations and small unsatisfiable subsets}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {223--234}, publisher = publisher-springer, year = {2004}, note = {Journal version to appear in } # journal-tcs-it } @InProceedings{ FT04ICALP, author = {Fedor V. Fomin and Dimitrios M. Thilikos}, title = {Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up}, booktitle = proc-icalp-04, series = series-springer-lncs, volume = {3142}, pages = {581--592}, publisher = publisher-springer, year = {2004} } @InProceedings{ FT04STACS, author = {Fedor V. Fomin and Dimitrios M. Thilikos}, title = {A Simple and Fast Approach for Solving Problems on Planar Graphs}, booktitle = proc-stacs-04, series = series-springer-lncs, volume = {2996}, pages = {56--67}, publisher = publisher-springer, year = {2004} } @Article{ GGHN04, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems}, journal = journal-algorithmica, publisher = publisher-springer, volume = {39}, number = {4}, pages = {321--347}, year = {2004}, doi = {10.1007/s00453-004-1090-5} } @Article{ GGMZ04, author = {Nal{\^a}n G{\"u}lpinar and Gregory Gutin and Gautam Mitra and Alexey Zverovich}, title = {Extracting pure network submatrices in linear programs using signed graphs}, journal = journal-discreteapplmath, volume = {137}, number = {3}, pages = {359--372}, publisher = publisher-elsevier, year = {2004}, doi = {10.1016/S0166-218X(03)00361-5} } @InProceedings{ GHN04, author = {Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {A Structural View on Parameterizing Problems: Distance from Triviality}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {162--173}, publisher = publisher-springer, year = {2004}, myurl = {http://springerlink.com/content/fn1e0vbklrbvc0v6} } @Article{ GL04, author = {Jean-Loup Guillaume and Matthieu Latapy}, title = {Bipartite structure of all complex networks}, journal = journal-ipl, volume = {90}, number = {5}, pages = {215--221}, publisher = publisher-elsevier, year = {2004} } @Book{ Gol04, author = {Martin C. Golumbic}, title = {Algorithmic Graph Theory and Perfect Graphs}, publisher = publisher-elsevier, series = series-elsevier-anndiscretemath, volume = {57}, year = {2004}, edition = {2nd}, note = {First edition } # publisher-academic # {, 1980} } @Article{ GPPR04, author = {Cyril Gavoille and David Peleg and St{\'e}phane P{\'e}rennes and Ran Raz}, title = {Distance labeling in graphs}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {53}, number = {1}, year = {2004}, pages = {85--112}, myurl = {http://dx.doi.org/10.1016/j.jalgor.2004.05.002}, doi = {10.1016/j.jalgor.2004.05.002} } @Article{ Gra04, author = {Jens Gramm}, title = {A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns}, journal = {\bibremark{No string.}IEEE/ACM Transactions on Computational Biology and Bioinformatics\bibremark{No publisher.}}, volume = {4}, number = {1}, pages = {171--180}, year = {2004} } @Article{ Gro04, author = {Martin Grohe}, title = {Computing crossing numbers in quadratic time}, journal = journal-jcss, volume = {68}, number = {2}, pages = {285--302}, publisher = publisher-elsevier, year = {2004} } @InProceedings{ HO04, author = {Michael Hoffmann and Yoshio Okamoto}, title = {The Minimum Weight Triangulation Problem with Few Inner Points}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {200--212}, publisher = publisher-springer, year = {2004} } difficult name @Article{ HBLSVCI04, author = {Bjarni V. Halldorsson and Vineet Bafna and Ross Lippert and Russell Schwartz and de{ }la Vega, Francisco M. and Andrew G. Clark and Sorin Istrail}, title = {Optimal Haplotype Block-Free Selection of Tagging {SNPs} for Genome-Wide Association Studies}, journal = {\bibremark{No string.}Genome Research\bibremark{No publisher.}}, year = {2004}, volume = {14}, number = {8}, pages = {1633--1640} } @Article{ IN04, author = {Garth Isaak and Darren A. Narayan}, title = {A classification of tournaments having an acyclic tournament as a minimum feedback arc set}, journal = journal-ipl, volume = {92}, number = {3}, pages = {107--111}, publisher = publisher-elsevier, year = {2004}, doi = {10.1016/j.ipl.2004.07.001} } @Article{ JLMZ04, author = {Tao Jiang and Guohui Lin and Bin Ma and Kaizhong Zhang}, title = {The longest common subsequence problem for arc-annotated sequences}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, volume = {2}, number = {2}, pages = {257--270}, year = {2004} } @Article{ JZC04, author = {Weijia Jia and Chuanlin Zhang and Jianer Chen}, title = {An efficient parameterized algorithm for {$m$}-set packing}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {50}, number = {1}, pages = {106--117}, year = {2004} } @Article{ KIMA04, author = {N. Kashtan and S. Itzkovitz and R. Milo and U. Alon}, title = {Efficient Sampling Algorithm for Estimating Subgraph Concentrations and Detecting Network Motifs}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {20}, number = {11}, pages = {1746--1758}, year = {2004} } @InProceedings{ KMPSY04, author = {Lutz Kettner and Kurt Mehlhorn and Sylvain Pion and Stefan Schirra and Chee Yap}, title = {Classroom Examples of Robustness Problems in Geometric Computations}, booktitle = proc-esa-04, year = {2004}, pages = {702--713}, myeditor = {Susanne Albers and Tomasz Radzik}, publisher = publisher-springer, series = series-springer-lncs, volume = {3221}, isbn = {3-540-23025-4} } @TechReport{ KMRR04, author = {Joachim Kneis and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, title = {Parameterized power domination complexity}, number = {AIB-2004-09}, institution = {\bibremark{No string.}Deptartment of Computer Science, RWTH Aachen}, year = {2004}, month = dec } @Book{ Knu04, author = {Donald E. Knuth}, title = {The Art of Computer Programming}, volume = {4}, publisher = publisher-addisonwesley, year = {2004}, myurl = {http://www-cs-faculty.stanford.edu/~knuth/fasc2a.ps.gz} } @article{ Koe04, author = {Ekkehard K{\"o}hler}, title = {Recognizing graphs without asteroidal triples}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, volume = {2}, number = {4}, year = {2004}, pages = {439--452}, myurl = {http://dx.doi.org/10.1016/j.jda.2004.04.005}, doi = {10.1016/j.jda.2004.04.005} } @Book{ KPP04, author = {Hans Kellerer and Ulrich Pferschy and David Pisinger}, title = {Knapsack Problems}, publisher = publisher-springer, year = {2004} } @conference{ KPS04, author = {Iyad Kanj and Michael Pelsmajer and Marcus Schaefer}, title = {Parameterized Algorithms for Feedback Vertex Set}, booktitle = proc-iwpec-04, pages = {235--247}, series = series-springer-lncs, volume = {3162}, publisher = publisher-springer, year = {2004} } @InProceedings{ KS04, author = {Sofia Kovaleva and Frits C. R. Spieksma}, title = {Approximation of Rectangle Stabbing and Interval Stabbing Problems}, booktitle = proc-esa-04, myeditor = {Susanne Albers and Tomasz Radzik}, year = {2004}, pages = {426--435}, publisher = publisher-springer, series = series-springer-lncs, volume = {3221} } @InProceedings{ Lau04, author = {Lap Chi Lau}, title = {Bipartite roots of graphs}, booktitle = proc-soda-04, pages = {952--961}, year = {2004}, publisher = publisher-acmsiam, note = {Journal version to appear in } # journal-acmtransalgorithms-it } @Article{ LC04, author = {Lap Chi Lau and Derek G. Corneil}, title = {Recognizing powers of proper interval, split, and chordal graphs}, journal = journal-siamjdiscretemath, publisher = publisher-siam, year = {2004}, volume = {18}, number = {1}, pages = {83--102} } @InCollection{ LJRR04, author = {Frauke Liers and Michael J{\"u}nger and Gerhard Reinelt and Giovanni Rinaldi}, title = {Computing Exact Ground States of Hard {Ising} Spin Glass Problems by Branch-and-Cut}, booktitle = {New Optimization Algorithms in Physics}, editor = {Alexander K. Hartmann and Heiko Rieger}, pages = {47--70}, publisher = {\bibremark{No string.}Wiley-VCH}, year = {2004}, doi = {10.1002/3527603794.ch4} } @Manual{ Mak04, author = {Andrew Makhorin}, title = {{GNU} Linear Programming Kit Reference Manual Version 4.8}, year = {2004}, organization = {\bibremark{No string.}Department of Applied Informatics, Moscow Aviation Institute} } @InProceedings{ Mar04CCC, author = {D{\'a}niel Marx}, title = {Parameterized complexity of constraint satisfaction problems}, booktitle = {\bibremark{No string.}Proc.\ 19th CCC}, pages = {139--149}, publisher = publisher-ieee, year = {2004} } @Unpublished{ Mar04Manuscript, author = {D{\'a}niel Marx}, title = {Chordal deletion is fixed-parameter tractable}, note = {Manuscript, } # institution-budapesttecs, year = {2004}, mymonth = aug } @InProceedings{ Mar04IWPEC, author = {D{\'a}niel Marx}, title = {Parameterized coloring problems on chordal graphs}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {83--95}, publisher = publisher-springer, year = {2004}, note = {Journal version to appear in } # journal-tcs-it } @InProceedings{ McC04, author = {Ross M. Mc{C}onnell}, title = {A certifying algorithm for the consecutive-ones property}, booktitle = proc-soda-04, pages = {768--777}, year = {2004}, publisher = publisher-acm, } @Book{ MF04, author = {Zbigniew Michalewicz and David B. Fogel}, title = {How to Solve it: Modern Heuristics}, publisher = publisher-springer, year = {2004}, edition = {2nd}, mynote = {First edition~2000} } @InProceedings{ MPS04, author = {Luke Mathieson and Elena Prieto and Peter Shaw}, title = {Packing Edge Disjoint Triangles: A Parameterized View}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {127--137}, publisher = publisher-springer, year = {2004}, myurl = {http://springerlink.com/content/tvttbagtkgghjfhr} } @InProceedings{ MW04, author = {Steffen Mecke and Dorothea Wagner}, title = {Solving Geometric Covering Problems by Data Reduction}, booktitle = proc-esa-04, myeditor = {Susanne Albers and Tomasz Radzik}, year = {2004}, pages = {760--771}, publisher = publisher-springer, series = series-springer-lncs, volume = {3221}, isbn = {3-540-23025-4}, myurl = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3221{\&}spage=760} } @InProceedings{ Nie04, author = {Rolf Niedermeier}, title = {Ubiquitous Parameterization---Invitation to Fixed-Parameter Algorithms}, booktitle = proc-mfcs-04, pages = {84--103}, year = {2004}, volume = {3153}, series = series-springer-lncs, publisher = publisher-springer } @Article{ OKMFMK04, author = {Kanae Oda and Tomomi Kimura and Yukiko Matsuoka and Akira Funahashi and Masaaki Muramatsu and Hiroaki Kitano}, title = {Molecular Interaction Map of a Macrophage}, journal = {\bibremark{No string.}AfCS Research Reports\bibremark{No publisher.}}, volume = {2}, year = {2004}, eid = {14}, myurl = {http://www.afcs.org/reports/v2/DA0014/DA0014.htm} } @Article{ Pie04, author = {Hans-Peter Piepho}, title = {An Algorithm for a Letter-Based Representation of All-Pairwise Comparisons}, journal = {\bibremark{No string.}Journal of Computational and Graphical Statistics\bibremark{No publisher.}}, volume = {13}, number = {2}, pages = {456--466}, year = {2004} } @Article{ PKS04, author = {Mihai Pop and Daniel S. Kosack and Steven L. Salzberg}, title = {Hierarchical Scaffolding With {B}ambus}, journal = {\bibremark{No string.}Genome Research\bibremark{No publisher.}}, volume = {14}, number = {1}, pages = {149--159}, year = {2004} } @InProceedings{ PanS04, author = {Alessandro Panconesi and Mauro Sozio}, title = {Fast Hare: A Fast Heuristic for Single Individual {SNP} Haplotype Reconstruction}, booktitle = {\bibremark{No string.}Proceedings of the 4th International Workshop on Algorithms in Bioinformatics (WABI~'04)}, series = series-springer-lncs, volume = {3240}, pages = {266--277}, publisher = publisher-springer, year = {2004}, myurl = {http://springerlink.com/content/4ke1y4lt9xve97d7} } @InProceedings{ PriS04, author = {Elena Prieto and Christian Sloper}, title = {Looking at the Stars}, booktitle = proc-iwpec-04, series = series-springer-lncs, volume = {3162}, pages = {138--148}, publisher = publisher-springer, year = {2004} } @Unpublished{ Rau04, author = {Dieter Rautenbach}, title = {4-Leafroots}, note = {Manuscript, } # institution-bonndiskretemathematik, year = {2004}, mymonth = jun, } @Article{ RufS04, author = {Nikolaus Ruf and Anita Sch{\"o}bel}, title = {Set covering with almost consecutive ones property}, journal = journal-discreteoptim, volume = {1}, number = {2}, year = {2004}, pages = {215--228}, publisher = publisher-elsevier } @InProceedings{ RamS04, author = {Venkatesh Raman and Saket Saurabh}, title = {Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments}, booktitle = proc-iwpec-04, pages = {260--270}, year = {2004}, volume = {3162}, series = series-springer-lncs, publisher = publisher-springer } @Misc{ Ray04, author = {Dominik Raymann}, title = {Implementation of {A}lon-{Y}uster-{Z}wick's Color-Coding Algorithm}, year = {2004}, howpublished = {Diploma thesis, \bibremark{No string.}Institut f{\"u}r Theoretische Informatik, ETH Z{\"u}rich, Switzerland} } @Article{ RSV04, author = {Bruce Reed and Kaleigh Smith and Adrian Vetta}, title = {Finding odd cycle transversals}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {32}, number = {4}, pages = {299--301}, year = {2004}, doi = {10.1016/j.orl.2003.10.009} } @InProceedings{ Sin04, author = {Carsten Sinz}, title = {Visualizing the Internal Structure of {SAT} Instances (Preliminary Report)}, booktitle = {\bibremark{No string.}Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT~'04)\bibremark{No publisher.}}, year = {2004} } @Article{ SST04, author = {Ron Shamir and Roded Sharan and Dekel Tsur}, title = {Cluster graph modification problems}, journal = journal-discreteapplmath, volume = {144}, number = {1--2}, pages = {173--182}, publisher = publisher-elsevier, year = {2004}, doi = {10.1016/j.dam.2004.01.007} } @Article{ Sze04jcss, author = {Stefan Szeider}, title = {Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable}, journal = journal-jcss, volume = {69}, number = {4}, pages = {656--674}, publisher = publisher-elsevier, year = {2004} } @InProceedings{ Sze04SAT, author = {Stefan Szeider}, title = {On fixed-parameter tractable parameterizations of {SAT}}, booktitle = {\bibremark{No string.}Proc.\ 6th SAT}, series = series-springer-lncs, volume = {2919}, pages = {188--202}, publisher = publisher-springer, year = {2004} } @Article{ Tho04, author = {Mikkel Thorup}, title = {Compact oracles for reachability and approximate distances in planar digraphs}, journal = journal-jacm, publisher = publisher-acm, volume = {51}, number = {6}, year = {2004}, pages = {993--1024} } @InProceedings{ TC04, author = {Tatsuie Tsukiji and Zhi-Zhong Chen}, title = {Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard}, booktitle = proc-cocoon-04, year = {2004}, volume = {3106}, series = series-springer-lncs, pages = {450--461}, publisher = publisher-springer, note = {Journal version appeared in } # journal-tcs-it } @Misc{ Tez04, author = {{Tezzaron Semiconductor}}, title = {Soft errors in electronic memory}, year = {2004}, howpublished = {White paper} } @InProceedings{ TZ04, author = {Jinsong Tan and Louxin Zhang}, title = {Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices}, booktitle = proc-isaac-04, year = {2004}, publisher = publisher-springer, series = series-springer-lncs, volume = {3341}, isbn = {3-540-24131-0}, pages = {835--846}, note = {Journal version to appear in } # journal-algorithmica-it } @Article{ Vol04, author = {Erik Volz}, title = {Random networks with tunable degree distribution and clustering}, journal = {\bibremark{No string.}Physical Review~E\bibremark{No publisher.}}, volume = {70}, number = {5}, year = {2004}, eid = {056115} } @Article{ Wes04, author = {Mark Weston}, title = {A fixed-parameter tractable algorithm for matrix domination}, journal = journal-ipl, volume = {90}, number = {5}, pages = {267--272}, publisher = publisher-elsevier, year = {2004} } @InProceedings{ Wil04, author = {Ryan Williams}, title = {A New Algorithm for Optimal Constraint Satisfaction and Its Implications}, booktitle = proc-icalp-04, series = series-springer-lncs, volume = {3142}, pages = {1227--1237}, publisher = publisher-springer, year = {2004} } @Article{ AA03, author = {Eric J. Alm and Adam P. Arkin}, title = {Biological networks}, journal = {\bibremark{No string.}Current Opinion in Structural Biology\bibremark{No publisher.}}, volume = {13}, number = {2}, pages = {193--202}, year = {2003} } @InProceedings{ ABN03, author = {Jochen Alber and Nadja Betzler and Rolf Niedermeier}, title = {Experiments on data reduction for optimal domination in networks}, booktitle = {\bibremark{No string.}Proc.\ International Network Optimization Conference (INOC~'03)\bibremark{No publisher.}}, pages = {1--6}, year = {2003}, note = {Journal version to appear in } # journal-annoperres-it } @InProceedings{ ACLRT03, author = {Marta Arias and Lenore Cowen and Kofi A. Laing and Rajmohan Rajaraman and Orjeta Taka}, title = {Compact routing with name independence}, booktitle = proc-spaa-03, year = {2003}, pages = {184--192}, publisher = publisher-acm, note = {Journal version appeared in } # journal-siamjdiscretemath-it } @Article{ AFN03, author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, title = {Graph Separators: {A} Parameterized View}, journal = journal-jcss, volume = {67(4)}, pages = {808--832}, publisher = publisher-elsevier, year = {2003} } @PhDThesis{ Alb03, author = {Jochen Alber}, title = {Exact Algorithms for NP-hard Problems on Networks: Design, Analysis, and Implementation}, year = {2003}, school = institution-tuebingeninf } @Article{ Bla03, author = {Markus Bl{\"a}ser}, title = {Computing small partial coverings}, journal = journal-ipl, publisher = publisher-elsevier, volume = {85}, number = {6}, year = {2003}, pages = {327--331}, myurl = {http://dx.doi.org/10.1016/S0020-0190(02)00434-9}, doi = {10.1016/S0020-0190(02)00434-9} } @TechReport{ BBKRS03, author = {Hans L. Bodlaender and Andreas Brandst{\"a}dt and Dieter Kratsch and Micha{\"e}l Rao and Jeremy P. Spinrad}, title = {On Algorithms for ({$P_5$},Gem)-Free Graphs}, institution = institution-utrechtcs, year = {2003}, number = {UU-CS-2003-038} } @Article{ BCRC03, author = {Joel S. Bader and Amitabha Chaudhuri and Jonathan M. Rothberg and John Chant}, title = {Gaining confidence in high-throughput protein interaction networks}, journal = {\bibremark{No string.}Nature Biotechnology\bibremark{No publisher.}}, volume = {22}, number = {1}, pages = {78--85}, year = {2003}, doi = {10.1038/nbt924} } @Article{ BW03, author = {Alexander I. Barvinok and Kevin Woods}, title = {Short rational generating functions for lattice point problems}, journal = {\bibremark{No string.}Journal of the American Mathematical Society\bibremark{No publisher.}}, volume = {16}, number = {4}, pages = {957--979}, year = {2003} } @Article{ Cai03, author = {Leizhen Cai}, title = {Parameterized Complexity of {V}ertex {C}olouring}, journal = journal-discreteapplmath, volume = {127}, number = {1}, pages = {415--429}, publisher = publisher-elsevier, year = {2003} } difficult name @Article{ CDRST03, author = {James Cheetham and Frank Dehne and Andrew Rau{-}Chaplin and Ulrike Stege and Peter J. Taillon}, title = {Solving large {FPT} problems on coarse-grained parallel machines}, journal = journal-jcss, volume = {67}, number = {4}, pages = {691--706}, publisher = publisher-elsevier, year = {2003}, doi = {10.1016/S0022-0000(03)00075-8} } @Article{ Ces03, author = {Marco Cesati}, title = {The {T}uring way to parameterized complexity}, journal = journal-jcss, volume = {67}, number = {4}, pages = {654--685}, publisher = publisher-elsevier, year = {2003} } @InProceedings{ CFG03, author = {Yijia Chen and J{\"o}rg Flum and Martin Grohe}, title = {Bounded Nondeterminism and Alternation in Parameterized Complexity Theory}, booktitle = proc-ccc-03, pages = {13--29}, publisher = publisher-ieeecs, year = {2003} } @InProceedings{ CGW03, author = {Moses Charikar and Venkatesan Guruswami and Anthony Wirth}, title = {Clustering with Qualitative Information}, booktitle = proc-focs-03, publisher = publisher-ieee, year = {2003}, pages = {524--533}, note = {Journal version appeared in } # journal-jcss-it } @Article{ CJ03, author = {Liming Cai and David W. Juedes}, title = {On the existence of subexponential parameterized algorithms}, journal = journal-jcss, volume = {64}, number = {4}, pages = {789--807}, publisher = publisher-elsevier, year = {2003}, doi = {10.1016/S0022-0000(03)00074-6}, myurl = {http://dx.doi.org/10.1016/S0022-0000(03)00074-6} } @Article{ CJL03, author = {Zhi-Zhong Chen and Tao Jiang and Guohui Lin}, title = {Computing Phylogenetic Roots with Bounded Degrees and Errors}, journal = journal-siamjcomput, publisher = publisher-siam, year = {2003}, volume = {32}, number = {4}, pages = {864--879} } @Article{ CJLWXXX03, author = {Zhi-Zhong Chen and Tao Jiang and Guo-Hui Lin and Jianjun Wen and Dong Xu and Jinbo Xu and Ying Xu}, title = {Approximation algorithms for NMR spectral peak assignment}, journal = journal-tcs, publisher = publisher-elsevier, volume = {1--3}, number = {299}, year = {2003}, pages = {211--229} } @Article{ CK03, author = {Jianer Chen and Iyad A. Kanj}, title = {Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms}, journal = journal-jcss, volume = {67}, pages = {833--847}, publisher = publisher-elsevier, year = {2003} } @InProceedings{ CKPSX03, author = {Jianer Chen and Iyad A. Kanj and Ljubomir Perkovic and Eric Sedgwick and Ge Xia}, title = {Genus Characterizes the Complexity of Graph Problems: Some Tight Results}, booktitle = proc-icalp-03, series = series-springer-lncs, volume = {2719}, pages = {845--856}, publisher = publisher-springer, year = {2003} } @InProceedings{ CMS03, author = {Chandra Chekuri and Marcelo Mydlarz and F. Bruce Shepherd}, title = {Multicommodity Demand Flow in a Tree}, booktitle = proc-icalp-03, series = series-springer-lncs, volume = {2719}, pages = {410--425}, publisher = publisher-springer, year = {2003} } @Article{ DEFPR03, author = {Rodney G. Downey and Vladimir Estivill-Castro and Michael R. Fellows and Elena Prieto and Frances A. Rosamond}, title = {Cutting Up is Hard to Do: the Parameterized Complexity of $k$-Cut and Related Problems}, journal = {\bibremark{No string.}Electronic Notes in Theoretical Computer Science\bibremark{No publisher.}}, volume = {78}, year = {2003} } @InProceedings{ DFHT03, author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, title = {Fixed-Parameter Algorithms for the {$(k, r)$}-Center in Planar Graphs and Map Graphs}, booktitle = proc-icalp-03, series = series-springer-lncs, volume = {2719}, pages = {829--844}, publisher = publisher-springer, year = {2003} } difficult name @Unpublished{ DFPR03, author = {Rod G. Downey and Michael R. Fellows and Elena Prieto{-}Rodriguez and Frances A. Rosamond}, title = {Fixed-parameter tractability and completeness~{V}: parametric miniatures}, year = {2003}, note = {Manuscript} } @Article{ DLLLMW03, author = {X. Deng and G. Li and Z. Li and B. Ma and L. Wang}, title = {Genetic design of drugs without side-effects}, journal = journal-siamjcomput, volume = {32}, number = {4}, pages = {1073--1090}, publisher = publisher-siam, year = {2003} } @InProceedings{ Dow03, author = {Rodney G. Downey}, title = {Parameterized complexity for the skeptic}, booktitle = proc-ccc-03, pages = {147--169}, year = {2003} } @Article{ EGP03, author = {Tamar Eilam and Cyril Gavoille and David Peleg}, title = {Compact routing schemes with low stretch factor}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {46}, number = {2}, year = {2003}, pages = {97--114}, myurl = {http://dx.doi.org/10.1016/S0196-6774(03)00002-6}, doi = {10.1016/S0196-6774(03)00002-6} } @InProceedings{ Fel03WADS, author = {Michael R. Fellows}, title = {New Directions and New Challenges in Algorithm Design and Complexity, Parameterized}, booktitle = proc-wads-03, pages = {505--520}, year = {2003}, volume = {2748}, series = series-springer-lncs, publisher = publisher-springer } @InProceedings{ Fel03WG, author = {Michael R. Fellows}, title = {Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in {FPT}}, booktitle = proc-wg-03, pages = {1--12}, year = {2003}, volume = {2880}, series = series-springer-lncs, publisher = publisher-springer } @Unpublished{ FK03, author = {S. S. Fedin and A. S. Kulikov}, title = {Automated proofs of upper bounds on the running time of splitting algorithms}, year = {2003}, note = {Manuscript}, month = sep } @Article{ FLL03, author = {Corinne Feremans and Martine Labb{\'e} and Gilbert Laporte}, title = {Generalized network design problems}, journal = journal-europeanjoperres, publisher = publisher-elsevier, volume = {148}, number = {1}, pages = {1--13}, year = {2003}, myurl = {http://dx.doi.org/10.1016/S0377-2217(02)00404-6}, doi = {10.1016/S0377-2217(02)00404-6} } @InProceedings{ FT03, author = {Fedor V. Fomin and Dimitrios M. Thilikos}, title = {Dominating sets in planar graphs: branch-width and exponential speed-up}, booktitle = proc-soda-03, pages = {168--177}, publisher = publisher-acmsiam, year = {2003} } @Article{ GBBC+03, author = {L. Giot and J. S. Bader and C. Brouwer and A. Chaudhuri and others}, title = {A Protein Interaction Map of {D}rosophila melanogaster}, journal = {\bibremark{No string.}Science\bibremark{No publisher.}}, volume = {302}, number = {5651}, pages = {1727--1736}, year = {2003}, doi = {10.1126/science.1090289} } @InProceedings{ GGHN03ESA, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Automated generation of search tree algorithms for graph modification problems}, booktitle = proc-esa-03, series = series-springer-lncs, volume = {2832}, pages = {642--653}, publisher = publisher-springer, year = {2003} } @InProceedings{ GGHN03CIAC, author = {Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation}, booktitle = proc-ciac-03, pages = {108--119}, year = {2003}, series = series-springer-lncs, volume = {2653}, publisher = publisher-springer, note = {Journal version to appear in } # journal-tocs-it } @InProceedings{ GGN03, author = {Jens Gramm and Jiong Guo and Rolf Niedermeier}, title = {On Exact and Approximation Algorithms for {Distinguishing Substring Selection}}, booktitle = proc-fct-03, series = series-springer-lncs, volume = {2751}, pages = {261--272}, publisher = publisher-springer, year = {2003}, note = {Journal version to appear in } # journal-tocs-it } @Article{ GHKO03, author = {Sudipto Guha and Refael Hassin and Samir Khuller and Einat Or}, title = {Capacitated Vertex Covering}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {48}, number = {1}, year = {2003}, pages = {257--270}, myurl = {http://dx.doi.org/10.1016/S0196-6774(03)00053-1}, doi = {10.1016/S0196-6774(03)00053-1} } @Article{ GHNR03, author = {Jens Gramm and Edward A. Hirsch and Rolf Niedermeier and Peter Rossmanith}, title = {Worst-case upper bounds for {MAX-2-SAT} with an application to {MAX-CUT}}, journal = journal-discreteapplmath, volume = {130}, number = {2}, pages = {139--155}, publisher = publisher-elsevier, year = {2003} } @Book{ GK03, editor = {Fred W. Glover and Gary A. Kochenberger}, title = {Handbook of Metaheuristics}, publisher = publisher-springer, series = {\bibremark{No string.}International Series in Operations Research \& Management Science}, volume = {57}, year = {2003} } @Article{ GN03, author = {Jens Gramm and Rolf Niedermeier}, title = {A fixed-parameter algorithm for {M}inimum {Q}uartet {I}nconsistency}, journal = journal-jcss, volume = {67}, number = {4}, pages = {723--741}, publisher = publisher-elsevier, year = {2003}, myurl = {http://dx.doi.org/10.1016/S0022-0000(03)00077-1}, doi = {10.1016/S0022-0000(03)00077-1} } @Article{ GNR03, author = {Jens Gramm and Rolf Niedermeier and Peter Rossmanith}, title = {Fixed-parameter algorithms for {C}losest {S}tring and related problems}, journal = journal-algorithmica, publisher = publisher-springer, volume = {37}, number = {1}, pages = {25--42}, year = {2003} } @Article{ GP03, author = {Cyril Gavoille and David Peleg}, title = {Compact and localized distributed data structures}, journal = {\bibremark{No string.}Distributed Computing\bibremark{No publisher.}}, volume = {16}, number = {2--3}, year = {2003}, pages = {111--120}, myurl = {http://www.springerlink.com/index/10.1007/s00446-002-0073-5} } @PhDThesis{ Gra03, author = {Jens Gramm}, title = {Fixed-Parameter Algorithms for the Consensus Analysis of Genomic Sequences}, year = {2003}, school = institution-tuebingeninf } @Article{ HM03tcs, author = {Wen-Lian Hsu and Ross M. Mc{C}onnell}, title = {{PC} trees and circular-ones arrangements}, journal = journal-tcs, volume = {296}, number = {1}, year = {2003}, pages = {99--116}, myurl = {http://dx.doi.org/10.1016/S0304-3975(02)00435-8}, doi = {10.1016/S0304-3975(02)00435-8}, publisher = publisher-elsevier } @InCollection{ HM03Handbook, author = {Wen-Lian Hsu and Ross M. Mc{C}onnell}, title = {{PQ}~Trees, {PC}~Trees, and Planar Graphs}, booktitle = {Handbook of Data Structures and Applications}, editor = {Dinesh P. Mehta and Sartaj Sahni}, publisher = publisher-chapmanhall, year = {2003} } @Misc{ Hue03, author = {Falk H{\"u}ffner}, title = {Graph Modification Problems and Automated Search Tree Generation}, year = {2003}, school = {Diploma thesis, } # institution-tuebingeninf } @TechReport{ IT03, author = {Kazuo Iwama and Suguru Tamaki}, title = {Improved Upper Bounds for 3-{SAT}}, number = {TR03-053}, institution = institution-eccc, year = {2003}, note = {Also appears in } # proc-soda-04-it } @InProceedings{ KMMS03, author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy Spinrad}, title = {Certifying algorithms for recognizing interval graphs and permutation graphs}, booktitle = proc-soda-03, publisher = publisher-acm, year = {2003}, pages = {158--167}, myurl = {http://doi.acm.org/10.1145/644108.644137}, note = {Journal version appeared in } # journal-siamjcomput-it } @InProceedings{ KR03, author = {Subhash Khot and Oded Regev}, title = {{V}ertex {C}over Might be Hard to Approximate to within {$2-\epsilon$}}, booktitle = proc-ccc-03, year = {2003}, pages = {379--386}, publisher = publisher-ieee } @Article{ LH03ComputationalBiology, author = {Wei-Fu Lu and Wen-Lian Hsu}, title = {A Test for the Consecutive Ones Property on Noisy Data -- Application to Physical Mapping and Sequence Assembly}, journal = journal-jcomputbiol, publisher = publisher-maryannliebert, volume = {10}, number = {5}, year = {2003}, pages = {709--735}, myurl = {http://dx.doi.org/10.1089/106652703322539051}, doi = {10.1089/106652703322539051} } @InProceedings{ LH03WEA, author = {Wei-Fu Lu and Wen-Lian Hsu}, title = {A Clustering Algorithm for Interval Graph Test on Noisy Data}, booktitle = proc-wea-03, myeditor = {Klaus Jansen and Marian Margraf and Monaldo Mastrolilli and Jos{\'e} D. P. Rolim}, year = {2003}, pages = {195--208}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2647/26470195.htm}, series = series-springer-lncs, volume = {2647}, publisher = publisher-springer } @Article{ LLMWZ03, author = {J. Kevin Lanctot and Ming Li and Bin Ma and Shaojiu Wang and Louxin Zhang}, title = {Distinguishing string selection problems}, journal = {\bibremark{No string.}Information and Computation\bibremark{No publisher.}}, volume = {185}, number = {1}, pages = {41--55}, year = {2003} } @Article{ McC03, author = {Ross M. McConnell}, title = {Linear-Time Recognition of Circular-Arc Graphs}, journal = journal-algorithmica, publisher = publisher-springer, volume = {37}, number = {2}, year = {2003}, pages = {93--147}, myurl = {http://dx.doi.org/10.1007/s00453-003-1032-7}, doi = {10.1007/s00453-003-1032-7} } @Article{ NR03jdiscretealgorithms, author = {Rolf Niedermeier and Peter Rossmanith}, title = {An efficient fixed-parameter algorithm for 3-{H}itting {S}et}, journal = journal-jdiscretealgorithms, publisher = publisher-elsevier, volume = {1}, number = {1}, pages = {89--102}, year = {2003}, doi = {10.1016/S1570-8667(03)00009-1} } @Article{ NR03jalgorithms, author = {Rolf Niedermeier and Peter Rossmanith}, title = {On efficient fixed-parameter algorithms for {W}eighted {V}ertex {C}over}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {47}, number = {2}, pages = {63--77}, year = {2003} } @InProceedings{ NS03, author = {S. I. Nikolenko and A. V. Sirotkin}, title = {Worst-case upper bounds for {SAT}: automated proof}, booktitle = {\bibremark{No string.}15th European Summer School in Logic Language and Information (ESSLLI~'03)}, year = {2003} } @inproceedings{ OR03Aussois, author = {Marcus Oswald and Gerhard Reinelt}, title = {Constructing New Facets of the Consecutive Ones Polytope}, booktitle = proc-aussois-01, myeditor = {Michael J{\"u}nger and Gerhard Reinelt and Giovanni Rinaldi}, series = series-springer-lncs, volume = {2570}, pages = {147--157}, year = {2003}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2570/25700147.htm} } @article{ OR03operreslett, author = {Marcus Oswald and Gerhard Reinelt}, title = {The weighted consecutive ones problem for a fixed number of rows or columns}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {31}, number = {3}, year = {2003}, pages = {350--356}, myurl = {http://dx.doi.org/10.1016/S0167-6377(03)00024-5}, doi = {10.1016/S0167-6377(03)00024-5} } @Article{ Pee03, author = {Ren\'e Peeters}, title = {The maximum edge biclique problem is {NP}-complete}, journal = journal-discreteapplmath, publisher = publisher-elsevier, year = {2003}, volume = {131}, number = {3}, pages = {651--654} } @Article{ Pie03, author = {Krzysztof Pietrzak}, title = {On the parameterized complexity of the fixed alphabet {S}hortest {C}ommon {S}upersequence and {L}ongest {C}ommon {S}ubsequence problems}, journal = journal-jcss, volume = {67}, number = {4}, pages = {757--771}, publisher = publisher-elsevier, year = {2003} } @InProceedings{ PS03, author = {Elena Prieto and Christian Sloper}, title = {Either/or: using vertex cover structure in designing {FPT}-algorithms---the case of $k$-{I}nternal {S}panning {T}ree}, booktitle = proc-wads-03, series = series-springer-lncs, volume = {2748}, pages = {474--483}, publisher = publisher-springer, year = {2003} } @InProceedings{ RS03, author = {Venkatesh Raman and Saket Saurabh}, title = {Parameterized Complexity of Directed Feedback Set Problems in Tournaments}, booktitle = proc-wads-03, pages = {484--492}, year = {2003}, volume = {2748}, series = series-springer-lncs, publisher = publisher-springer } @Article{ SKK03, author = {Carsten Sinz and Andreas Kaiser and Wolfgang K{\"u}chlin}, title = {Formal Methods for the Validation of Automotive Product Configuration Data}, journal = {\bibremark{No string.}Artificial Intelligence for Engineering Design, Analysis and Manufacturing}, volume = {17}, number = {1}, pages = {75--97}, publisher = publisher-cambridge, year = {2003} } @InProceedings{ SW03, author = {Matthew Suderman and Sue Whitesides}, title = {Experiments with the Fixed-Parameter Approach for Two-Layer Planarization}, booktitle = proc-gd-03, myeditor = {Giuseppe Liotta}, publisher = publisher-springer, series = series-springer-lncs, volume = {2912}, year = {2003}, pages = {345--356}, myurl = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2912{\&}spage=345} } @Misc{ Wer03, author = {Sebastian Wernicke}, title = {On the Algorithmic Tractability of Single Nucleotide Polymorphism ({SNP}) Analysis and Related Problems}, howpublished = {Diploma thesis, } # institution-tuebingeninf, year = {2003}}, myurl = {http://theinf1.informatik.uni-jena.de/publications/wernicke-dipl.pdf} } @InProceedings{ Woe03, author = {Gerhard J. Woeginger}, title = {Exact Algorithms for {NP}-Hard Problems: A Survey}, booktitle = proc-aussois-01, myeditor = {Michael J{\"u}nger and Gerhard Reinelt and Giovanni Rinaldi}, series = series-springer-lncs, volume = {2570}, pages = {185--208}, publisher = publisher-springer, year = {2003} } @InProceedings{ ZP03, author = {Xiaotong Zhuang and Santosh Pande}, title = {Resolving Register Bank Conflicts for a Network Processor}, booktitle = {\bibremark{No string.}Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques (PACT~'03)}, pages = {269--278}, publisher = publisher-ieee, year = {2003}, doi = {10.1109/PACT.2003.1238022} } @Article{ ABFKN02, author = {Jochen Alber and Hans L. Bodlaender and Henning Fernau and Ton Kloks and Rolf Niedermeier}, title = {Fixed Parameter Algorithms for {DOMINATING SET} and Related Problems on Planar Graphs}, journal = journal-algorithmica, publisher = publisher-springer, volume = {33}, number = {4}, year = {2002}, pages = {461--493}, myurl = {http://link.springer.de/link/service/journals/00453/contents/01/0116/index.html} } @InProceedings{ AFN02, author = {Jochen Alber and Michael R. Fellows and Rolf Niedermeier}, title = {Efficient Data Reduction for {D}ominating {S}et: {A} Linear Problem Kernel for the Planar Case}, booktitle = proc-swat-02, series = series-springer-lncs, volume = {2368}, pages = {150--159}, publisher = publisher-springer, year = {2002}, note = {Journal version to appear in } # journal-jacm-it } @PhDThesis{ Alb02, author = {Jochen Alber}, title = {Exact Algorithms for {NP}-hard Problems on Networks: Design, Analysis, and Implementation}, year = {2002}, school = institution-tuebingeninf, myurl = {http://deposit.ddb.de/cgi-bin/dokserv?idn= {966206584}} } @InProceedings{ AN02, author = {Jochen Alber and Rolf Niedermeier}, title = {Improved Tree Decomposition Based Algorithms for Domination-like Problems}, booktitle = proc-latin-02, series = series-springer-lncs, volume = {2286}, pages = {613--628}, publisher = publisher-springer, year = {2002}, myurl = {http://springerlink.com/content/9c4wqrwjytxvwlxw} } @InProceedings{ AR02FOCS, author = {Michael Alekhnovich and Alexander A. Razborov}, title = {Satisfiability, branch-width and {T}seitin tautologies}, booktitle = proc-focs-02, pages = {593--603}, publisher = publisher-ieeecs, year = {2002} } @InProceedings{ AR02ISAAC, author = {V. Arvind and Venkatesh Raman}, title = {Approximation algorithms for some parameterized counting problems}, booktitle = proc-isaac-02, series = series-springer-lncs, volume = {2518}, pages = {453--464}, publisher = publisher-springer, year = {2002} } @InProceedings{ BBC02, author = {Nikhil Bansal and Avrim Blum and Shuchi Chawla}, title = {Correlation Clustering}, booktitle = proc-focs-02, publisher = publisher-ieeecs, pages = {238--247}, year = {2002} } difficult name @Book{ BG02, author = {J{\o}rgen Bang{-}Jensen and Gregory Gutin}, title = {Digraphs: Theory, Algorithms and Applications}, publisher = publisher-springer, year = {2002} } @InCollection{ BGS02, author = {Alexander Barvinok and Edward Kh. Gimadi and Anatoliy I. Serdyukov}, title = {The {M}aximum {T}raveling {S}alesman {P}roblem}, booktitle = {The Traveling Salesman Problem and its Variations}, pages = {585--607}, editor = {Gregory Gutin and Abraham P. Punnen}, publisher = publisher-kluwer, year = {2002} } @Article{ Bix02, author = {Robert E. Bixby}, title = {Solving real-world linear programs: A decade and more of progress}, journal = journal-operres, publisher = publisher-informs, volume = {50}, number = {1}, pages = {3--15}, year = {2002}, doi = {10.1287/opre.50.1.3.17780} } @Article{ BS02, author = {Michael O'Boyle and Elena St{\"o}hr}, title = {Compile Time Barrier Synchronization Minimization}, journal = {\bibremark{No string.}IEEE Transactions on Parallel and Distributed Systems\bibremark{No publisher.}}, volume = {13}, number = {6}, pages = {529--543}, year = {2002} } @Article{ BST02, author = {Mathieu Blanchette and Benno Schwikowski and Martin Tompa}, title = {Algorithms for phylogenetic footprinting}, journal = journal-jcomputbiol, publisher = publisher-maryannliebert, volume = {9}, number = {2}, year = {2002}, pages = {211--223} } @Article{ CDZ02, author = {Mao-Cheng Cai and Xiaotie Deng and Wenan Zang}, title = {A Min-Max Theorem on Feedback Vertex Sets}, journal = {\bibremark{No string.}Mathematics of Operations Research\bibremark{No publisher.}}, volume = {27}, number = {2}, pages = {361--371}, year = {2002} } @Article{ CIMPS02, author = {Alberto Caprara and Giuseppe F. Italiano and G. Mohan and Alessandro Panconesi and Aravind Srinivasan}, title = {Wavelength rerouting in optical networks, or the {V}enetian Routing problem}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {45}, number = {2}, year = {2002}, pages = {93--125}, } @InProceedings{ CKX02, author = {Jianer Chen and Iyad A. Kanj and Ge Xia}, title = {Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for {NP}-hard Problems}, booktitle = proc-isaac-02, series = series-springer-lncs, volume = {2906}, pages = {148--157}, publisher = publisher-springer, year = {2002}, note = {Journal version to appear in } # journal-algorithmica-it } @Article{ DGHKKPRS02, author = {Evgeny Dantsin and Andreas Goerdt and Edward A. Hirsch and Ravi Kannan and Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan and Uwe Sch{\"o}ning}, title = {A deterministic $(2-2/(k+1))^n$ algorithm for {$k$}-{SAT} based on local search}, journal = journal-tcs, publisher = publisher-elsevier, volume = {289}, number = {1}, pages = {69--83}, year = {2002} } @InProceedings{ DS02, author = {Irit Dinur and Shmuel Safra}, title = {On the importance of Being Biased}, booktitle = proc-stoc-02, pages = {33--42}, publisher = publisher-acm, year = {2002} } @InProceedings{ EFF02, author = {John Ellis and Hongbing Fan and Michael R. Fellows}, title = {The {D}ominating {S}et Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus}, booktitle = proc-swat-02, series = series-springer-lncs, volume = {2368}, pages = {180--189}, publisher = publisher-springer, year = {2002} } @InProceedings{ Fel02, author = {Michael R. Fellows}, title = {Parameterized Complexity: The Main Ideas and Connections to Practical Computing}, booktitle = {Experimental Algorithmics}, series = series-springer-lncs, volume = {2547}, pages = {51--77}, publisher = publisher-springer, year = {2002} } @InProceedings{ Fer02, author = {Henning Fernau}, title = {On Parameterized Enumeration}, booktitle = proc-cocoon-02, myeditor = {Oscar H. Ibarra and Louxin Zhang}, publisher = publisher-springer, series = series-springer-lncs, volume = {2387}, year = {2002}, pages = {564--573}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2387/23870564.htm} } @InProceedings{ FGN02, author = {Fellows, Michael R. and Gramm, Jens and Niedermeier, Rolf}, title = {On the parameterized intractability of {Closest Substring} and related problems}, booktitle = proc-stacs-02, series = series-springer-lncs, volume = {2285}, pages = {262--273}, publisher = publisher-springer, year = {2002}, note = {Journal version to appear in } # journal-combinatorica-it } @InProceedings{ FluG02, author = {J{\"o}rg Flum and Martin Grohe}, title = {The Parameterized Complexity of Counting Problems}, booktitle = proc-focs-02, pages = {538--550}, publisher = publisher-ieeecs, year = {2002} } @InProceedings{ FOW02, author = {Uriel Feige and Eran Ofek and Udi Wieder}, title = {Approximating Maximum Edge Coloring in Multigraphs}, booktitle = proc-approx-02, series = series-springer-lncs, volume = {2462}, pages = {108--121}, publisher = publisher-springer, year = {2002}, myurl = {http://springerlink.com/content/4wl6hhytafcrph2n} } @Article{ FPRR02, author = {Paola Festa and Panos M. Pardalos and Mauricio G. C. Resende and Celso C. Ribeiro}, title = {Randomized Heuristics for the Max-Cut Problem}, journal = {\bibremark{No string.}Optimization Methods and Software\bibremark{No publisher.}}, volume = {17}, number = {6}, pages = {1033--1058}, year = {2002}, doi = {10.1080/1055678021000090033} } @InProceedings{ FraG02, author = {Pierre Fraigniaud and Cyril Gavoille}, title = {A Space Lower Bound for Routing in Trees}, booktitle = proc-stacs-02, year = {2002}, pages = {65--75}, publisher = publisher-springer, series = series-springer-lncs, volume = {2285} } @InProceedings{ FriG02, author = {Markus Frick and Martin Grohe}, title = {The complexity of first-order and monadic second-order logic revisited}, booktitle = {\bibremark{No string.}Proc.\ Logic in Computer Science}, pages = {215--224}, publisher = publisher-ieeecs, year = {2002} } @InProceedings{ GGN02, author = {Jens Gramm and Jiong Guo and Rolf Niedermeier}, title = {Pattern-matching in arc-annotated sequences}, booktitle = proc-fsttcs-02, series = series-springer-lncs, volume = {2556}, pages = {182--193}, publisher = publisher-springer, year = {2002}, note = {Journal version to appear in } # journal-acmtransalgorithms-it } @Misc{ GHN02, author = {Jens Gramm and Falk H{\"u}ffner and Rolf Niedermeier}, title = {Closest Strings, Primer Design, and Motif Search}, year = {2002}, howpublished = {Presented at \bibremark{No string.}\textit{6th Annual International Conference on Computational Molecular Biology (RECOMB~'02)}, poster session} } @Article{ GIK02, author = {Daya Ram Gaur and Toshihide Ibaraki and Ramesh Krishnamurti}, title = {Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {43}, number = {1}, year = {2002}, pages = {138--152}, myurl = {http://dx.doi.org/10.1006/jagm.2002.1221}, doi = {10.1006/jagm.2002.1221} } @Article{ GN02, author = {Jens Gramm and Rolf Niedermeier}, title = {Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach}, journal = journal-bioinformatics, publisher = publisher-oxford, volume = {18}, number = {Supplement~2}, pages = {S128--S139}, year = {2002} } @Article{ Gro02, author = {Martin Grohe}, title = {Parameterized complexity for the database theorist}, journal = {\bibremark{No string.}SIGMOD Record\bibremark{No publisher.}}, volume = {31}, number = {4}, pages = {86--96}, year = {2002} } @Article{ GSS02, author = {Georg Gottlob and Francesco Scarcello and Martha Sideri}, title = {Fixed-parameter complexity in {AI} and nonmonotonic reasoning}, journal = {\bibremark{No string.}Artifical Intelligence\bibremark{No publisher.}}, volume = {138}, number = {1--2}, pages = {55--86}, year = {2002} } @Article{ Had02, author = {Salim Haddadi}, title = {A note on the {NP}-hardness of the consecutive block minimization problem}, journal = journal-inttransoperres, publisher = publisher-wileyblackwell, volume = {9}, number = {6}, pages = {775--777}, year = {2002}, doi = {10.1111/1475-3995.00387} } @Article{ HG02, author = {MohammadTaghi Hajiaghayi and Yashar Ganjali}, title = {A note on the Consecutive Ones Submatrix problem}, journal = journal-ipl, publisher = publisher-elsevier, volume = {83}, number = {3}, year = {2002}, pages = {163--166}, myurl = {http://dx.doi.org/10.1016/S0020-0190(01)00325-8}, doi = {10.1016/S0020-0190(01)00325-8} } @Article{ HHHH02, author = {Teresa W. Haynes and Sandra M. Hedetniemi and Stephen T. Hedetniemi and Michael A. Henning}, title = {Domination in Graphs Applied to Electric Power Networks}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {15}, number = {4}, pages = {519--529}, year = {2002} } @Article{ HLW02, author = {Frank Harary and Meng-Hiot Lim and Donald C. Wunsch}, title = {Signed graphs for portfolio analysis in risk management}, journal = {\bibremark{No string.}IMA Journal of Management Mathematics\bibremark{No publisher.}}, volume = {13}, number = {3}, pages = {201--210}, year = {2002}, doi = {10.1093/imaman/13.3.201} } @Book{ Hro02, author = {Juraj Hromkovi{\v{c}}}, title = {Algorithmics for Hard Problems}, publisher = publisher-springer, year = {2002}, edition = {2nd} } @InProceedings{ HS02, author = {Eran Halperin and Aravind Srinivasan}, title = {Improved Approximation Algorithms for the {P}artial {V}ertex {C}over Problem}, booktitle = proc-approx-02, myeditor = {Klaus Jansen and Stefano Leonardi and Vijay V. Vazirani}, publisher = publisher-springer, series = series-springer-lncs, volume = {2462}, year = {2002}, pages = {161--174}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2462/24620161.htm} } @Article{ Hsu02, author = {Wen-Lian Hsu}, title = {A Simple Test for the Consecutive Ones Property}, journal = journal-jalgorithms, year = {2002}, volume = {43}, number = {1}, pages = {1--16}, publisher = publisher-elsevier, myurl = {http://dx.doi.org/10.1006/jagm.2001.1205}, doi = {10.1006/jagm.2001.1205}, } @article{ HT02, author = {Dorit S. Hochbaum and Paul A. Tucker}, title = {Minimax problems with bitonic matrices}, journal = journal-networks, publisher = publisher-wiley, volume = {40}, number = {3}, year = {2002}, pages = {113--124}, myurl = {http://dx.doi.org/10.1002/net.10038}, doi = {10.1002/net.10038} } @Misc{ Hue02, author = {Falk H{\"u}ffner}, title = {Finding Optimal Solutions to {A}tomix}, year = {2002}, howpublished = {Studienarbeit, } # institution-tuebingeninf } @InProceedings{ Joh02, author = {David S. Johnson}, editor = {Michael H. Goldwasser and David S. Johnson and Catherine C. McGeoch}, booktitle = {Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges}, title = {A Theoretician's Guide to the Experimental Analysis of Algorithms}, publisher = publisher-ams, year = {2002}, volume = {59}, series = series-ams-dimacsmonographs, pages = {215--250} } @InProceedings{ Kho02, author = {Subhash Khot}, title = {On the power of unique 2-prover 1-round games}, booktitle = proc-stoc-02, pages = {767--775}, publisher = publisher-acm, year = {2002}, doi = {10.1145/509907.510017} } @Article{ Khu02, author = {Samir Khuller}, title = {The {Vertex Cover} Problem}, journal = {\bibremark{No string.}SIGACT News\bibremark{No publisher.}}, volume = {33}, number = {2}, pages = {31--33}, year = {2002} } @InProceedings{ KLL02, author = {Ton Kloks and Chuan-Min Lee and Jiping Liu}, title = {New Algorithms for $k$-Face Cover, {$k$}-Feedback Vertex Set, and $k$-Disjoint Cycles on Plane and Planar Graphs}, booktitle = proc-wg-02, pages = {282--295}, year = {2002}, volume = {2573}, series = series-springer-lncs, publisher = publisher-springer } @Article{ KR02, author = {Subhash Khot and Venkatesh Raman}, title = {Parameterized complexity of finding subgraphs with hereditary properties}, journal = journal-tcs, publisher = publisher-elsevier, volume = {289}, number = {2}, pages = {997--1008}, year = {2002}, doi = {10.1016/S0304-3975(01)00414-5} } difficult name @InProceedings{ KSPS02, author = {Farinaz Koushanfar and Sasha Slijepcevic and Miodrag Potkonjak and Alberto Sangiovanni{-}Vincentelli}, title = {Error-Tolerant Multimodal Sensor Fusion}, booktitle = {\bibremark{No string.}Proceedings of the IEEE CAS Workshop on Wireless Communications and Networking}, publisher = publisher-ieeecas, year = {2002} } @Book{ KV02, author = {Bernhard Korte and Jens Vygen}, title = {Combinatorial Optimization}, year = {2002}, publisher = publisher-springer } @Article{ LCJW02, author = {Guo-Hui Lin and Zhi-Zhong Chen and Tao Jiang and Jianjun Wen}, title = {The longest common subsequence problem for sequences with nested arc annotations}, journal = journal-jcss, volume = {65}, number = {3}, pages = {465--480}, publisher = publisher-elsevier, year = {2002} } @Article{ LMW02jacm, author = {Ming Li and Bin Ma and Lusheng Wang}, title = {On the closest string and substring problems}, journal = journal-jacm, publisher = publisher-acm, volume = {49}, number = {2}, pages = {157--171}, year = {2002} } @Article{ LMW02jcss, author = {Ming Li and Bin Ma and Lusheng Wang}, title = {Finding Similar Regions in Many Sequences}, journal = journal-jcss, volume = {65}, number = {1}, pages = {73--96}, publisher = publisher-elsevier, year = {2002} } @Article{ LSLI02, author = {Ross Lippert and Russell Schwartz and Giuseppe Lancia and Sorin Istrail}, title = {Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem}, journal = {\bibremark{No string.}Briefings in Bioinformatics\bibremark{No publisher.}}, volume = {3}, number = {1}, year = {2002}, pages = {23--31} } @InProceedings{ Lu02, author = {Hsueh-I Lu}, title = {Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees}, booktitle = proc-cocoon-02, publisher = publisher-springer, series = series-springer-lncs, volume = {2387}, year = {2002}, isbn = {3-540-43996-X}, pages = {57--66}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2387/23870057.htm} } @InProceedings{ McC02, author = {Catherine McCartin}, title = {Parameterized Counting Problems}, booktitle = proc-mfcs-02, series = series-springer-lncs, volume = {2420}, pages = {556--567}, publisher = publisher-springer, year = {2002} } @Article{ MKS+02, author = {von Mering, Christian and Roland Krause and Berend Snel and Michael Cornell and Stephen G. Oliver and Stanley Fields and Peer Bork}, title = {Comparative assessment of large-scale data sets of protein-protein interactions}, journal = {\bibremark{No string.}Nature\bibremark{No publisher.}}, volume = {417}, pages = {399--403}, year = {2002}, doi = {10.1038/nature750} } @Misc{ Nie02, author = {Niedermeier, Rolf}, title = {Invitation to fixed-parameter algorithms}, year = {2002}, month = sep, howpublished = {Habilitation thesis, } # institution-tuebingeninf } @Article{ NRT02, author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, title = {On Graph Powers for Leaf-Labeled Trees}, journal = journal-jalgorithms, publisher = publisher-elsevier, year = {2002}, volume = {42}, number = {1}, pages = {69--108} } @Book{ PS02, author = {Hans-J{\"u}rgen Pr{\"o}mel and Angelika Steger}, title = {The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity}, series = {\bibremark{No string.}Advanced Lectures in Mathematics}, publisher = {\bibremark{No string.}Vieweg}, year = {2002} } @InProceedings{ RBIL02, author = {Romeo Rizzi and Vineet Bafna and Sorin Istrail and Giuseppe Lancia}, title = {Practical algorithms and fixed-parameter tractability for the single individual {SNP} haplotyping problem}, booktitle = {\bibremark{No string.}Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics (WABI~'02)}, series = series-springer-lncs, volume = {2452}, pages = {29--43}, publisher = publisher-springer, year = {2002}, myurl = {http://springerlink.com/content/4gkqmq44tyjhblpy} } @InProceedings{ RSS02, author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian}, title = {Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set}, booktitle = proc-isaac-02, pages = {241--248}, year = {2002}, volume = {2518}, series = series-springer-lncs, publisher = publisher-springer } @PhDThesis{ Sha02, author = {Roded Sharan}, title = {Graph Modification Problems and their Applications to Genomic Research}, year = {2002}, school = {\bibremark{No string.}Sackler Faculty of Exact Sciences, School of Computer Science, Tel-Aviv University}, myurl = {http://acgt.cs.tau.ac.il/theses/roded_phd.ps.gz} } difficult name @Article{ SMMA02, author = {S. S. Shen{-}Orr and R. Milo and S. Mangan and U. Alon}, title = {Network Motifs in the Transcriptional Regulation Network of Escherichia Coli}, journal = {\bibremark{No string.}Nature Genetics\bibremark{No publisher.}}, volume = {31}, number = {1}, pages = {64--68}, year = {2002} } @Article{ SPADC02, author = {Martin Steffen and Allegra Petti and John Aach and Patrik D'haeseleer and George Church}, title = {Automated modelling of signal transduction networks}, journal = {\bibremark{No string.}BMC Bioinformatics\bibremark{No publisher.}}, volume = {2}, year = {2002}, eid = {34}, doi = {10.1186/1471-2105-3-34} } @Article{ SS02, author = {Benno Schwikowski and Ewald Speckenmeyer}, title = {On enumerating all minimal solutions of feedback problems}, journal = journal-discreteapplmath, volume = {117}, number = {1--3}, pages = {253--265}, publisher = publisher-elsevier, year = {2002}, doi = {10.1016/S0166-218X(00)00339-5} } @InProceedings{ SST02, author = {Ron Shamir and Roded Sharan and Dekel Tsur}, title = {Cluster Graph Modification Problems}, booktitle = proc-wg-02, series = series-springer-lncs, volume = {2573}, pages = {379--390}, publisher = publisher-springer, year = {2002}, note = {Journal version appeared in } # journal-discreteapplmath-it } @InProceedings{ AFFNRS01, author = {Jochen Alber and Hongbing Fan and Michael R. Fellows and Henning Fernau and Rolf Niedermeier and Frances A. Rosamond and Ulrike Stege}, title = {Refined search tree technique for {D}ominating {S}et on planar graphs}, booktitle = proc-mfcs-01, series = series-springer-lncs, volume = {2136}, pages = {111--122}, publisher = publisher-springer, year = {2001}, note = {Journal version to appear in } # journal-jcss-it } @Article{ AGN01, author = {Jochen Alber and Jens Gramm and Rolf Niedermeier}, title = {Faster exact algorithms for hard problems: {A}~parameterized point of view}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {229}, number = {1--3}, pages = {3--27}, year = {2001} } @InProceedings{ Bla01, author = {Mathieu Blanchette}, title = {Algorithms for phylogenetic footprinting}, booktitle = {\bibremark{No string.}Proceedings of the fifth Annual International Conference on Computational Biology (RECOMB~'01)}, year = {2001}, pages = {49--58}, isbn = {1-58113-353-7}, publisher = publisher-acm, myurl = {http://doi.acm.org/10.1145/369133.369170} } @Article{ CDZ01, author = {Mao-Cheng Cai and Xiaotie Deng and Wenan Zang}, title = {An Approximation Algorithm for Feedback Vertex Sets in Tournaments}, journal = journal-siamjcomput, volume = {30}, number = {6}, pages = {1993--2007}, publisher = publisher-siam, year = {2001}, doi = {10.1137/S0097539798338163} } @Article{ CKJ01, author = {Jianer Chen and Iyad A. Kanj and Weijia Jia}, title = {Vertex {C}over: Further Observations and Further Improvements}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {41}, number = {2}, pages = {280--301}, year = {2001}, doi = {10.1006/jagm.2001.1186} } @Book{ CLRS01, author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest and Clifford Stein}, title = {Introduction to Algorithms}, publisher = publisher-mit, year = {2001}, edition = {2nd} } @InProceedings{ CM01, author = {Maw-Shang Chang and Haiko M{\"u}ller}, title = {On the Tree-Degree of Graphs}, booktitle = proc-wg-01, series = series-springer-lncs, volume = {2204}, pages = {44--54}, publisher = publisher-springer, year = {2001} } @Article{ DGHK01, author = {Evgeny Dantsin and Michael Gavrilovich and Edward A. Hirsch and Boris Konev}, title = {{MAX SAT} approximation beyond the limits of polynomial-time approximation}, journal = {\bibremark{No string.}Annals of Pure and Applied Logic\bibremark{No publisher.}}, volume = {113}, number = {1--3}, pages = {81--94}, year = {2001} } @TechReport{ DHIV01, author = {Evgeny Dantsin and Edward A. Hirsch and Sergei Ivanov and Maxim Vsemirnov}, title = {Algorithms for {SAT} and Upper Bounds on Their Complexity}, number = {TR01-012}, institution = institution-eccc, year = {2001} } @InProceedings{ DKNS01, author = {Cynthia Dwork and Ravi Kumar and Moni Naor and D. Sivakumar}, title = {Rank aggregation methods for the {W}eb}, booktitle = {\bibremark{No string.}Proceedings of the 10th International Conference on World Wide Web (WWW~'01)}, pages = {613--622}, publisher = publisher-acm, year = {2001}, url = {http://doi.acm.org/10.1145/371920.372165} } @Unpublished{ EW01, author = {Patricia Evans and Todd Wareham}, title = {Practical non-polynomial time algorithms for designing universal {DNA} oligonucleotides: a systematic approach}, year = {2001}, month = apr } @InProceedings{ FraG01, author = {Pierre Fraigniaud and Cyril Gavoille}, title = {Routing in Trees}, booktitle = proc-icalp-01, year = {2001}, pages = {757--772}, publisher = publisher-springer, series = series-springer-lncs, volume = {2076} } @Article{ FriG01, author = {Markus Frick and Martin Grohe}, title = {Deciding first-order properties of locally tree-decomposable structures}, journal = journal-jacm, publisher = publisher-acm, volume = {48}, number = {6}, pages = {1184--1206}, year = {2001} } @Article{ FN01, author = {Henning Fernau and Rolf Niedermeier}, title = {An Efficient, Exact Algorithm for Constraint Bipartite Vertex Cover}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {38}, number = {2}, pages = {374--410}, year = {2001} } @Article{ Gav01, author = {Gavoille, Cyril}, title = {Routing in Distributed Networks: Overview and Open Problems}, journal = {\bibremark{No string.}ACM SIGACT News - Distributed Computing Column\bibremark{No publisher.}}, volume = {32}, number = {1}, pages = {36--52}, year = {2001}, mymonth = mar, } @Article{ GG01, author = {Gavoille, Cyril and Gengler, Marc}, title = {Space-Efficiency for Routing Schemes of Stretch Factor Three}, journal = {\bibremark{No string.}Journal of Parallel and Distributed Computing\bibremark{No publisher.}}, volume = {61}, number = {5}, pages = {679--687}, myurl = {http://dx.doi.org/10.1006/jpdc.2000.1705}, doi = {10.1006/jpdc.2000.1705}, year = {2001} } @Article{ GLV01, author = {Anna Galluccio and Martin Loebl and Jan Vondr{\'a}k}, title = {Optimization via enumeration: a new algorithm for the Max Cut Problem}, journal = journal-mathprogram, publisher = publisher-springer, volume = {90}, number = {2}, pages = {273--290}, year = {2001}, doi = {10.1007/PL00011425} } @Article{ Gue01, author = {Bertrand Guenin}, title = {A Characterization of Weakly Bipartite Graphs}, journal = journal-jcombintheoryB, publisher = publisher-elsevier, volume = {83}, number = {1}, pages = {112--168}, year = {2001}, doi = {10.1006/jctb.2001.2051} } @Article{ Has01, author = {Johan H{\r a}stad}, title = {Some optimal inapproximability results}, journal = journal-jacm, publisher = publisher-acm, year = {2001}, volume = {48}, number = {4}, pages = {798--859}, doi = {10.1145/502090.502098} } @InProceedings{ HEFN01, author = {Falk H{\"u}ffner and Stefan Edelkamp and Henning Fernau and Rolf Niedermeier}, title = {Finding Optimal Solutions to {A}tomix}, booktitle = {\bibremark{No string.}Proceedings of the German Conference on Artificial Intelligence (KI~'01)}, series = series-springer-lncs, volume = {2174}, pages = {229--243}, publisher = publisher-springer, year = {2001}, myurl = {http://springerlink.com/content/bru4a1yr4lytrjt5} } @Book{ HMU01, author = {John E. Hopcroft and Rajeev Motwani and Jeffrey D. Ullman}, title = {Introduction to Automata Theory, Languages, and Computation}, publisher = publisher-addisonwesley, year = {2001}, edition = {2nd} } @Book{ HMU01, author = {John E. Hopcroft and R. Motwani and Jeffrey D. Ullman}, title = {Introduction to Automata Theory, Languages, and Computation}, publisher = publisher-addisonwesley, year = {2001}, edition = {2nd} } @Article{ HP01, author = {Yehuda Hassin and David Peleg}, title = {Sparse communication networks and efficient routing in the plane}, journal = {\bibremark{No string.}Distributed Computing\bibremark{No publisher.}}, volume = {14}, number = {4}, year = {2001}, pages = {205--215}, myurl = {http://link.springer.de/link/service/journals/00446/bibs/1014004/10140205.htm} } @InProceedings{ Hsu01, author = {Wen-Lian Hsu}, title = {{PC}-Trees vs.\ {PQ}-Trees}, booktitle = proc-cocoon-01, myeditor = {Jie Wang}, year = {2001}, pages = {207--217}, series = series-springer-lncs, volume = {2108}, isbn = {3-540-42494-6}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2108/21080207.htm} } @Article{ IPZ01, author = {Russell Impagliazzo and Ramamohan Paturi and Francis Zane}, title = {Which Problems Have Strongly Exponential Complexity?}, journal = journal-jcss, volume = {63}, number = {4}, pages = {512--530}, publisher = publisher-elsevier, year = {2001} } @Article{ ITR+01, author = {Trey Ideker and Vesteinn Thorsson and Jeffrey A. Ranish and Rowan Christmas and Jeremy Buhler and Jimmy K. Eng and Roger Bumgarner and David R. Goodlett and Ruedi Aebersold and Leroy Hood}, title = {Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metabolic Network}, journal = {\bibremark{No string.}Science\bibremark{No publisher.}}, volume = {292}, number = {5518}, pages = {929--934}, year = {2001}, doi = {10.1126/science.292.5518.929} } @Article{ Koc01, author = {Ina Koch}, title = {Enumerating all connected maximal common subgraphs in two graphs}, journal = journal-tcs, publisher = publisher-elsevier, volume = {250}, number = {1--2}, pages = {1--30}, year = {2001} } @TechReport{ KS01TechReport, author = {Sofia Kovaleva and Frits C. R. Spieksma}, title = {Primal-Dual Approximation Algorithms for a packing-covering pair of problems}, year = {2001} } @InProceedings{ KS01ISAAC, author = {Sofia Kovaleva and Frits C. R. Spieksma}, title = {Approximation of a Geometric Set Covering Problem}, booktitle = proc-isaac-01, publisher = publisher-springer, series = series-springer-lncs, volume = {2223}, year = {2001}, pages = {493--501} } @InProceedings{ KVZ01, author = {Andrew B. Kahng and Shailesh Vaya and Alexander Zelikovsky}, title = {New Graph Bipartizations for Double-Exposure, Bright Field Alternating Phase-Shift Mask Layout}, booktitle = {\bibremark{No string.}Proc.\ Asia and South Pacific Design Automation Conference\bibremark{No publisher.}}, pages = {133--138}, year = {2001} } difficult name @InProceedings{ LBILS01, author = {Giuseppe Lancia and Vineet Bafna and Sorin Istrail and Ross Lippert and Russell Schwartz}, title = {{SNP}s Problems, Complexity, and Algorithms}, booktitle = proc-esa-01, myeditor = {Friedhelm Meyer{ }auf{ }der{ }Heide}, publisher = publisher-springer, series = series-springer-lncs, volume = {2161}, year = {2001}, pages = {182--193}, myurl = {http://link.springer.de/link/service/series/0558/bibs/2161/21610182.htm} } @InProceedings{ McC01, author = {Ross M. McConnell}, title = {Linear-time Recognition of Circular-arc Graphs}, booktitle = proc-focs-01, publisher = publisher-ieee, year = {2001}, pages = {386--394}, note = {Journal version appeared in } # journal-algorithmica-it } @InProceedings{ NRT01, author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, title = {Fast fixed-parameter tractable algorithms for nontrivial generalizations of {V}ertex {C}over}, booktitle = proc-wads-01, series = series-springer-lncs, volume = {2125}, pages = {75--86}, publisher = publisher-springer, year = {2001} } @Article{ NSS01, author = {Assaf Natanzon and Ron Shamir and Roded Sharan}, title = {Complexity classification of some edge modification problems}, journal = journal-discreteapplmath, publisher = publisher-elsevier, year = {2001}, volume = {113}, pages = {109--128} } @MastersThesis{ Osm01, author = {Dritan Osmani}, title = {Matrices with the consecutive ones property, interval graphs and their applications}, school = institution-kaiserslautern, year = {2001} } @Article{ PD01, author = {Tobias Polzin and Siavash Vahdati Daneshmand}, title = {Improved algorithms for the {S}teiner problem in networks}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {112}, number = {1--3}, year = {2001}, pages = {263--300} } @TechReport{ Rob01, author = {John M. Robson}, title = {Finding a maximum independent set in time {$O(2^{n/4})$}}, number = {1251-01}, institution = {\bibremark{No string.}Universit\'{e} Bordeaux, LaBRI}, year = {2001} } @Article{ RRMRAT01, author = {Subramanian Rajagopalan and Sreeranga P. Rajan and Sharad Malik and Sandro Rigo and Guido Araujo and Koichiro Takayama}, title = {A Re-Targetable {VLIW} Compiler Framework for {DSP}s with Instruction Level Parallelism}, journal = {\bibremark{No string.}IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\bibremark{No publisher.}}, volume = {20}, number = {11}, pages = {1319--1328}, year = {2001} } @InProceedings{ Tho01, author = {Mikkel Thorup}, title = {Compact Oracles for Reachability and Approximate Distances in Planar Digraphs}, booktitle = proc-focs-01, year = {2001}, pages = {242--251}, note = {Journal version appeared in } # journal-jacm-it } @InProceedings{ TZ01STOC, author = {Mikkel Thorup and Uri Zwick}, title = {Approximate distance oracles}, booktitle = proc-stoc-01, year = {2001}, pages = {183--192}, publisher = publisher-acm, note = {Journal version appeared in } # journal-jacm-it } @InProceedings{ TZ01SPAA, author = {Mikkel Thorup and Uri Zwick}, title = {Compact routing schemes}, booktitle = proc-spaa-01, year = {2001}, pages = {1--10} } @Book{ Vaz01, author = {Vijay V. Vazirani}, title = {Approximation Algorithms}, publisher = publisher-springer, year = {2001} } @Book{ Wes01, author = {Douglas B. West}, title = {Introduction to Graph Theory}, edition = {2nd}, publisher = publisher-prenticehall, year = {2001} } @Article{ BBG00, author = {Ann Becker and Reuven Bar-Yehuda and Dan Geiger}, title = {Randomized algorithms for the {L}oop {C}utset problem}, journal = {\bibremark{No string.}Journal of Artificial Intelligence Research\bibremark{No publisher.}}, volume = {12}, pages = {219--234}, year = {2000} } @Article{ BG00, author = {Vincent Berry and Olivier Gascuel}, title = {Inferring evolutionary trees with strong combinatorial evidence}, journal = journal-tcs, publisher = publisher-elsevier, volume = {240}, number = {2}, pages = {271--298}, year = {2000} } difficult name @Article{ BHY00, author = {J{\o}rgen Bang{-}Jensen and Jing Huang and Anders Yeo}, title = {Convex-Round and Concave-Round Graphs}, journal = journal-siamjdiscretemath, volume = {13}, number = {2}, year = {2000}, pages = {179--193}, myurl = {http://epubs.siam.org/sam-bin/dbq/article/32215}, publisher = publisher-siam } @Article{ BJ00, author = {Hans L. Bodlaender and Klaus Jansen}, title = {On the Complexity of the Maximum Cut Problem}, journal = {\bibremark{No string.}Nordic Journal of Computing\bibremark{No publisher.}}, volume = {7}, number = {1}, pages = {14--31}, year = {2000}, myurl = {http://citeseer.ist.psu.edu/bodlaender00complexity.html} } @InProceedings{ CDKM00, author = {Robert D. Carr and Srinivas Doddi and Goran Konjevod and Madhav V. Marathe}, title = {On the red-blue set cover problem}, booktitle = proc-soda-00, publisher = publisher-acm, year = {2000}, pages = {345--353}, myurl = {http://doi.acm.org/10.1145/338219.338271} } @Article{ CTF00, author = {Alberto Caprara and Paolo Toth and Matteo Fischetti}, title = {Algorithms for the Set Covering Problem}, journal = journal-annoperres, publisher = publisher-springer, volume = {98}, pages = {353--371}, year = {2000} } @Article{ Epp00, author = {David Eppstein}, title = {Diameter and Treewidth in Minor-Closed Graph Families}, journal = journal-algorithmica, publisher = publisher-springer, volume = {27}, number = {3}, pages = {275--291}, year = {2000} } @InProceedings{ FLG00, author = {Gary William Flake and Steve Lawrence and C. Lee Giles}, title = {Efficient identification of Web communities}, booktitle = {\bibremark{No string.}Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD~'00)}, pages = {150--160}, publisher = publisher-acm, year = {2000} } @Article{ Gab00, author = {Harold N. Gabow}, title = {Path-based depth-first search for strong and biconnected components}, journal = journal-ipl, volume = {74}, number = {3--4}, pages = {107--114}, publisher = publisher-elsevier, year = {2000} } @Article{ Gav00, author = {Cyril Gavoille}, title = {A survey on interval routing}, journal = journal-tcs, publisher = publisher-elsevier, volume = {245}, number = {2}, year = {2000}, pages = {217--253}, myurl = {http://dx.doi.org/10.1016/S0304-3975(99)00283-2}, doi = {10.1016/S0304-3975(99)00283-2} } @InProceedings{ GM00, author = {Carsten Gutwenger and Petra Mutzel}, title = {A Linear Time Implementation of {SPQR}-Trees}, booktitle = {\bibremark{No string.}Proceedings of the 8th International Symposium on Graph Drawing (GD~'00)}, series = series-springer-lncs, volume = {1984}, pages = {77--90}, publisher = publisher-springer, year = {2000} } @Article{ GN00, author = {Emden R. Gansner and Stephen C. North}, title = {An open graph visualization system and its applications to software engineering}, journal = {\bibremark{No string.}Software: Practice and Experience\bibremark{No publisher.}}, volume = {30}, number = {11}, pages = {1203--1233}, year = {2000}, doi = {10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N} } @Unpublished{ Haj00, author = {MohammadTaghi Hajiaghayi}, title = {Consecutive ones property}, note = {Manuscript, } # institution-waterloocs, year = {2000} } @Article{ Hir00, author = {Edward A. Hirsch}, title = {New worst-case upper bounds for {SAT}}, journal = {\bibremark{No string.}Journal of Automated Reasoning\bibremark{No publisher.}}, volume = {24}, number = {4}, pages = {397--420}, year = {2000} } @Article{ HMPV00, author = {Michel Habib and Ross M. Mc{C}onnell and Christophe Paul and Laurent Viennot}, title = {LEX-{BFS} and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing}, journal = journal-tcs, publisher = publisher-elsevier, year = {2000}, volume = {234}, pages = {59--84}, number = {1--2} } @Article{ HR00, author = {Refael Hassin and Shlomi Rubinstein}, title = {Better approximations for max~{TSP}}, journal = journal-ipl, volume = {75}, number = {4}, year = {2000}, pages = {181--186}, myurl = {http://dx.doi.org/10.1016/S0020-0190(00)00097-1}, doi = {10.1016/S0020-0190(00)00097-1}, publisher = publisher-elsevier } @Article{ HRG00, author = {Monika R. Henzinger and Satish Rao and Harold N. Gabow}, title = {Computing Vertex Connectivity: New Bounds from Old Techniques}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {43}, number = {2}, pages = {222--250}, year = {2000} } @Article{ JKL00, author = {Tao Jiang and Paul E. Kearney and Ming Li}, title = {A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application}, journal = journal-siamjcomput, volume = {30}, number = {6}, pages = {1942--1961}, publisher = publisher-siam, year = {2000} } @Unpublished{ JLX00, author = {Tao Jiang and Guohui Lin and Jinbo Xu}, title = {On the closest tree {$k$}th root problem}, note = {Manuscript, } # institution-waterloocs, year = {2000} } @InProceedings{ Koe00, author = {Ekkehard K{\"o}hler}, title = {Recognizing Graphs without Asteroidal Triples}, booktitle = proc-wg-00, myeditor = {Ulrik Brandes and Dorothea Wagner}, publisher = publisher-springer, series = series-springer-lncs, volume = {1928}, year = {2000}, pages = {255--266}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1928/19280255.htm} } @InProceedings{ KR00, author = {Subhash Khot and Venkatesh Raman}, title = {Parameterized Complexity of Finding Subgraphs with Hereditary Properties}, booktitle = proc-cocoon-00, year = {2000}, publisher = publisher-springer, series = series-springer-lncs, volume = {1858}, isbn = {3-540-67787-9}, pages = {137--147}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1858/18580137.htm}, } @Article{ KS00, author = {Wolfgang K{\"u}chlin and Carsten Sinz}, title = {Proving Consistency Assertions for Automotive Product Data Management}, journal = {\bibremark{No string.}Journal of Automated Reasoning\bibremark{No publisher.}}, volume = {24}, number = {1--2}, pages = {145--163}, publisher = publisher-kluwer, year = {2000} } @InProceedings{ LKJ00, author = {Guohui Lin and Paul E. Kearney and Tao Jiang}, title = {Phylogenetic $k$-Root and {S}teiner {$k$}-Root}, booktitle = proc-isaac-00, pages = {539--551}, year = {2000}, volume = {1969}, series = series-springer-lncs, publisher = publisher-springer } @Book{ MF00, author = {Zbigniew Michalewicz and David B. Fogel}, title = {How to Solve it: Modern Heuristics}, publisher = publisher-springer, year = {2000} } @Book{ MN00, author = {John N. Mordeson and Premchand S. Nair}, title = {Fuzzy Graphs and Fuzzy Hypergraphs}, publisher = {\bibremark{No string.}Physica-Verlag Heidelberg}, year = {2000} } @Article{ NR00ipl, author = {Rolf Niedermeier and Peter Rossmanith}, title = {A general method to speed up fixed-parameter-tractable algorithms}, journal = journal-ipl, volume = {73}, number = {3--4}, pages = {125--129}, publisher = publisher-elsevier, year = {2000}, doi = {10.1016/S0020-0190(00)00004-1} } @Article{ NR00jalgorithms, author = {Rolf Niedermeier and Peter Rossmanith}, title = {New upper bounds for {M}aximum {S}atisfiability}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {36}, pages = {63--88}, year = {2000} } @inproceedings{ OR00, author = {Marcus Oswald and Gerhard Reinelt}, title = {Polyhedral Aspects of the Consecutive Ones Problem}, booktitle = proc-cocoon-00, myeditor = {Ding-Zhu Du and Peter Eades and Vladimir Estivill-Castro and Xuemin Lin and Arun Sharma}, publisher = publisher-springer, series = series-springer-lncs, volume = {1858}, year = {2000}, pages = {373--382}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1858/18580373.htm} } @Book{ Pel00, author = {David Peleg}, title = {Distributed Computing: A Locality-Sensitive Approach}, publisher = publisher-siam, series = series-siam-monographsdiscretemathappl, year = {2000} } @Article{ PW00, author = {Florian A. Potra and Stephen J. Wright}, title = {Interior-point methods}, journal = journal-computapplmath, publisher = publisher-elsevier, year = {2000}, volume = {124}, pages = {281--302} } @InProceedings{ RVM00, author = {Subramanian Rajagopalan and Manish Vachharajani and Sharad Malik}, title = {Handling irregular {ILP} within conventional {VLIW} schedulers using artificial resource constraints}, booktitle = {\bibremark{No string.}Proceedings of the 2000 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES~'00)}, pages = {157--164}, publisher = publisher-acm, year = {2000}, doi = {10.1145/354880.354902} } @InProceedings{ Wei00, author = {Karsten Weihe}, title = {On the differences between ``practical'' and ``applied''}, booktitle = {\bibremark{No string.}Proc.\ WAE~'00}, series = series-springer-lncs, volume = {1982}, pages = {1--10}, publisher = publisher-springer, year = {2000} } @InProceedings{ WR00, author = {Stephan Weis and R{\"u}diger Reischuk}, title = {The Complexity of Physical Mapping with Strict Chimerism}, booktitle = proc-cocoon-00, myeditor = {Ding-Zhu Du and Peter Eades and Vladimir Estivill-Castro and Xuemin Lin and Arun Sharma}, pages = {383--395}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1858/18580383.htm}, publisher = publisher-springer, series = series-springer-lncs, volume = {1858}, year = {2000}, isbn = {3-540-67787-9} } @Article{ Ans99, author = {Kurt M. Anstreicher}, title = {Linear Programming in {$O(\frac{n^3}{\ln n}L)$}~Operations}, journal = journal-siamjoptim, publisher = publisher-siam, year = {1999}, volume = {9}, number = {4}, pages = {803--812} } difficult name @Book{ ACGKMP99, author = {Giorgio Ausiello and Pierluigi Crescenzi and Giorgio Gambosi and Viggo Kann and Alberto Marchetti{-}Spaccamela and Marco Protasi}, title = {Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties}, publisher = publisher-springer, year = {1999}, } @Book{ Ata99, title = {Algorithms and Theory of Computation Handbook}, editor = {Michael J. Atallah}, publisher = {\bibremark{No string.}CRC Press}, year = {1999} } @Article{ BBF99, author = {Vineet Bafna and Piotr Berman and Toshihiro Fujito}, title = {A 2-approximation algorithm for the undirected feedback vertex set problem}, journal = journal-siamjdiscretemath, publisher = publisher-siam, year = {1999}, volume = {3}, number = {2}, pages = {289--297} } @InProceedings{ BF99, author = {Paul Beame and Faith E. Fich}, title = {Optimal Bounds for the Predecessor Problem}, booktitle = proc-stoc-99, year = {1999}, pages = {295--304}, myurl = {http://doi.acm.org/10.1145/301250.301323}, publisher = publisher-acm } @InProceedings{ BJKLW99, author = {Vincent Berry and Tao Jiang and Paul E. Kearney and Ming Li and Todd Wareham}, title = {Quartet Cleaning: Improved Algorithms and Simulations}, booktitle = proc-esa-99, series = series-springer-lncs, volume = {1643}, pages = {313--324}, publisher = publisher-springer, year = {1999} } @Book{ BLS99, author = {Andreas Brandst{\"a}dt and Van Bang Le and Jeremy P. Spinrad}, title = {Graph Classes: A Survey}, publisher = publisher-siam, series = series-siam-monographsdiscretemathappl, volume = {3}, year = {1999} } @InProceedings{ BR99, author = {Nikhil Bansal and Venkatesh Raman}, title = {Upper bounds for {MaxSat}: further improved}, booktitle = proc-isaac-99, series = series-springer-lncs, volume = {1741}, pages = {247--258}, publisher = publisher-springer, year = {1999} } @InProceedings{ Cap99, author = {Alberto Caprara}, title = {Formulations and hardness of multiple sorting by reversals}, booktitle = {\bibremark{No string.}Proc.\ 3rd RECOMB}, pages = {84--94}, publisher = publisher-acm, year = {1999} } @InProceedings{ Cow99, author = {Lenore Cowen}, title = {Compact Routing with Minimum Stretch}, booktitle = proc-soda-99, year = {1999}, pages = {255--260}, publisher = publisher-acmsiam } @Book{ DF99, author = {Rodney G. Downey and Michael R. Fellows}, title = {Parameterized Complexity}, publisher = publisher-springer, year = {1999} } @InCollection{ DFS99, author = {Rodney G. Downey and Michael R. Fellows and Ulrike Stege}, title = {Parameterized complexity: A framework for systematically confronting computational intractability}, booktitle = {Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future}, editor = {Ronald L. Graham and Jan Kratochv{\'i}l and Jaroslav Nesetril and Fred S. Roberts}, series = {\bibremark{No string.}DIMACS: Series in Discrete Mathematics and Theoretical Computer Science}, volume = {49}, pages = {49--99}, publisher = publisher-ams, year = {1999} } @TechReport{ DHL99, author = {Oliver Dolezal and Thomas Hofmeister and Hanno Lefmann}, title = {A Comparison of Approximation Algorithms for the MaxCut-Problem}, number = {CI-57/99}, institution = {\bibremark{No string.}Universit{\"a}t Dortmund, Informatik~2}, year = {1999}, myurl = {http://hdl.handle.net/2003/5366} } @InProceedings{ Eva99CPM, author = {Particia A. Evans}, title = {Finding common subsequences with arcs and pseudoknots}, booktitle = {\bibremark{No string.}Proc.\ 10th CPM}, series = series-springer-lncs, volume = {1645}, pages = {270--280}, publisher = publisher-springer, year = {1999} } @PhDThesis{ Eva99PhDThesis, author = {Particia A. Evans}, title = {Algorithms and Complexity for Annotated Sequence Analysis}, year = {1999}, school = {\bibremark{No string.}University of Victoria, Canada} } @InCollection{ FPR99, author = {Paola Festa and Panos M. Pardalos and Mauricio G. C. Resende}, title = {Feedback set problems}, booktitle = {Handbook of Combinatorial Optimization}, editor = {Ding-Zhu Du and Panos M. Pardalos}, volume = {Supplement~A}, pages = {209--259}, publisher = publisher-kluwer, year = {1999} } @Article{ Gan99, author = {Joseph L. Ganley}, title = {Computing optimal rectilinear {S}teiner trees: A survey and experimental evaluation}, journal = journal-discreteapplmath, volume = {90}, number = {1--3}, pages = {161--171}, publisher = publisher-elsevier, year = {1999}, doi = {10.1016/S0166-218X(98)00089-4} } @InProceedings{ GH99, author = {Cyril Gavoille and Nicolas Hanusse}, title = {Compact Routing Tables for Graphs of Bounded Genus}, booktitle = proc-icalp-99, publisher = publisher-springer, series = series-springer-lncs, volume = {1644}, year = {1999}, isbn = {3-540-66224-3}, pages = {351--360}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1644/16440351.htm} } @Article{ Has99, author = {Johan H{\aa}stad}, title = {Clique is hard to approximate within~{$n^{1-\epsilon}$}}, journal = journal-actamath, publisher = publisher-springer, volume = {182}, pages = {105--142}, year = {1999} } @Article{ HM99, author = {Wen-Lian Hsu and Tze-Heng Ma}, title = {Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs}, journal = journal-siamjcomput, volume = {28}, number = {3}, year = {1999}, pages = {1004--1020} } @Article{ KS99, author = {Haim Kaplan and Ron Shamir}, title = {Bounded Degree Interval Sandwich Problems}, journal = journal-algorithmica, publisher = publisher-springer, volume = {24}, number = {2}, year = {1999}, pages = {96--104}, myurl = {http://link.springer.de/link/service/journals/00453/bibs/24n2p96.html} } @Article{ KST99, author = {Haim Kaplan and Ron Shamir and Robert E. Tarjan}, title = {Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs}, journal = journal-siamjcomput, publisher = publisher-siam, year = {1999}, volume = {28}, number = {5}, pages = {1906--1922} } @Article{ Kul99, author = {Oliver Kullmann}, title = {New methods for {$3$}-{SAT} decision and worst-case analysis}, journal = journal-tcs, publisher = publisher-elsevier, volume = {223}, number = {1--2}, pages = {1--72}, year = {1999}, issn = {0304-3975}, myurl = {http://www.elsevier.com/cas/tree/store/tcs/sub/1999/223/1-2/2848.pdf} } @Book{ MM99, author = {Terry A. McKee and Fred R. McMorris}, title = {Topics in Intersection Graph Theory}, series = series-siam-monographsdiscretemathappl, volume = {2}, publisher = publisher-siam, year = {1999} } @Book{ MN99, author = {Kurt Mehlhorn and Stefan N{\"a}her}, title = {{LEDA}: {A} Platform of Combinatorial and Geometric Computing}, publisher = publisher-cambridge, year = {1999} } @Article{ Moh99, author = {Bojan Mohar}, title = {A linear time algorithm for embedding graphs in an arbitrary surface}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {12}, number = {1}, pages = {6--26}, year = {1999} } @Article{ MR99, author = {Meena Mahajan and Venkatesh Raman}, title = {Parameterizing above guaranteed values: {MaxSat} and {MaxCut}}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {31}, number = {2}, pages = {335--354}, year = {1999} } @MastersThesis{ Nat99, author = {Assaf Natanzon}, title = {Complexity and Approximation of Some Graph Modification Problems}, school = institution-telavivcs, year = {1999} } @InProceedings{ NR99, author = {Rolf Niedermeier and Peter Rossmanith}, title = {Upper bounds for {V}ertex {C}over further improved}, booktitle = proc-stacs-99, series = series-springer-lncs, volume = {1563}, pages = {561--570}, publisher = publisher-springer, year = {1999} } @Book{ Pad99, author = {Manfred Padberg}, title = {Linear Optimization and Extensions}, year = {1999}, publisher = publisher-springer } @InProceedings{ Pel99, author = {David Peleg}, title = {Proximity-Preserving Labeling Schemes and Their Applications}, booktitle = proc-wg-99, publisher = publisher-springer, series = series-springer-lncs, volume = {1665}, year = {1999}, isbn = {3-540-66731-8}, pages = {30--41}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1665/16650030.htm} } @Article{ PY99, author = {Christos H. Papadimitriou and Mihalis Yannakakis}, title = {On the complexity of database queries}, journal = journal-jcss, volume = {58}, number = {3}, pages = {407--427}, publisher = publisher-elsevier, year = {1999} } @Article{ Seg99, author = {Michael Segal}, title = {On Piercing Sets of Axis-Parallel Rectangles and Rings}, journal = journal-internatjcomputgeomappl, publisher = publisher-worldscientific, volume = {9}, number = {3}, year = {1999}, pages = {219--233} } @Article{ SH99, author = {Wei-Kuan Shih and Wen-Lian Hsu}, title = {A new planarity test}, journal = journal-tcs, volume = {223}, number = {1--2}, year = {1999}, pages = {179--191}, myurl = {http://dx.doi.org/10.1016/S0304-3975(98)00120-0}, doi = {10.1016/S0304-3975(98)00120-0}, publisher = publisher-elsevier } @Article{ ABH98, author = {Jonathan E. Atkins and Erik G. Boman and Bruce Hendrickson}, title = {A Spectral Algorithm for Seriation and the Consecutive Ones Problem}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {28}, number = {1}, year = {1998}, pages = {297--310} } @article{ AS98, author = {Pankaj K. Agarwal and Micha Sharir}, title = {Efficient Algorithms for Geometric Optimization}, journal = journal-csur, publisher = publisher-acm, volume = {30}, number = {4}, year = {1998}, pages = {412--458}, myurl = {http://doi.acm.org/10.1145/299917.299918} } @Article{ AVJ98, author = {J{\'e}r{\^o}me Amilhastre and Marie-Catherine Vilarem and Philippe Janssen}, title = {Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs}, journal = journal-discreteapplmath, volume = {86}, number = {2--3}, pages = {125--144}, publisher = publisher-elsevier, year = {1998}, doi = {10.1016/S0166-218X(98)00039-0} } @Article{ BFR98, author = {R. Balasubramanian and Michael R. Fellows and Venkatesh Raman}, title = {An Improved Fixed-Parameter Algorithm for Vertex Cover}, journal = journal-ipl, volume = {65}, number = {3}, pages = {163--168}, publisher = publisher-elsevier, year = {1998} } @Article{ BGNR98, author = {Reuven Bar-Yehuda and Dan Geiger and Joseph Naor and Ron M. Roth}, title = {Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and {B}ayesian inference}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {27}, number = {4}, pages = {942--959}, year = {1998} } @Article{ BGS98, author = {Mihir Bellare and Oded Goldreich and Madhu Sudan}, title = {Free bits, {PCPs}, and non-approximability---towards tight results}, journal = journal-siamjcomput, publisher = publisher-siam, year = {1998}, volume = {27}, pages = {804--915} } @Article{ Bod98, author = {Hans L. Bodlaender}, title = {A partial {$k$}-arboretum of graphs with bounded treewidth}, journal = journal-tcs, publisher = publisher-elsevier, volume = {209}, pages = {1--45}, year = {1998} } @Book{ CCPS98, author = {William J. Cook and William H. Cunningham and William R. Pulleyblank and Alexander Schrijver}, title = {Combinatorial Optimization}, year = {1998}, publisher = publisher-wiley } @Article{ CGHW98, author = {Fabi{\'a}n A. Chudak and Michel X. Goemans and Dorit S. Hochbaum and David P. Williamson}, title = {A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs}, journal = journal-operreslett, publisher = publisher-elsevier, year = {1998}, volume = {22}, pages = {111--118} } @InProceedings{ Cho98, author = {Benny Chor}, title = {From Quartets to Phylogenetic Trees}, booktitle = proc-sofsem-98, pages = {36--53}, publisher = publisher-springer, series = series-springer-lncs, volume = {1521}, year = {1998}, isbn = {3-540-65260-4}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1521/15210036.htm} } @Article{ CK98, author = {Pierluigi Crescenzi and Viggo Kann}, title = {How to find the best approximation results---a follow-up to {Garey} and {Johnson}}, journal = {\bibremark{No string.}ACM SIGACT News\bibremark{No publisher.}}, volume = {29}, number = {4}, pages = {90--97}, year = {1998} } @InProceedings{ COR98, author = {Thomas Christof and Marcus Oswald and Gerhard Reinelt}, title = {Consecutive Ones and a Betweenness Problem in Computational Biology}, booktitle = proc-ipco-98, myeditor = {Robert E. Bixby and E. Andrew Boyd and Roger Z. R{\'{\i}}os-Mercado}, year = {1998}, pages = {213--228}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1412/14120213.htm}, publisher = publisher-springer, series = series-springer-lncs, volume = {1412}, isbn = {3-540-64590-X} } @InProceedings{ COS98, author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart}, title = {The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract)}, booktitle = proc-soda-98, year = {1998}, pages = {175--180}, publisher = publisher-acmsiam } @Article{ CS98, author = {Benny Chor and Madhu Sudan}, title = {A Geometric Approach to Betweenness}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {11}, number = {4}, pages = {511--523}, year = {1998} } @InProceedings{ EGP98, author = {Tamar Eilam and Cyril Gavoille and David Peleg}, title = {Compact Routing Schemes with Low Stretch Factor}, booktitle = proc-podc-98, year = {1998}, pages = {11--20}, note = {Journal version appeared in } # journal-jalgorithms-it } @Article{ ENSS98, author = {Guy Even and Joseph Naor and Baruch Schieber and Madhu Sudan}, title = {Approximating Minimum Feedback Sets and Multicuts in Directed Graphs}, journal = journal-algorithmica, publisher = publisher-springer, volume = {20}, number = {2}, pages = {151--174}, year = {1998}, doi = {10.1007/PL00009191} } @Article{ Fei98, author = {Uriel Feige}, title = {A Threshold of ln~\textit{n} for Approximating {S}et {C}over}, journal = journal-jacm, publisher = publisher-acm, volume = {45}, number = {4}, year = {1998}, pages = {634--652}, myurl = {http://doi.acm.org/10.1145/285055.285059} } @Article{ Gol98, author = {Martin Charles Golumbic}, title = {Matrix sandwich problems}, journal = journal-linearalgebraappl, publisher = publisher-elsevier, year = {1998}, volume = {277}, pages = {239--251} } @Article{ GolW98, author = {Martin Charles Golumbic and Amir Wassermann}, title = {Complexity and Algorithms for Graph and Hypergraph Sandwich Problems}, journal = journal-graphscombin, publisher = publisher-springer, year = {1998}, volume = {14}, pages = {223--239} } @Article{ GoeW98, author = {Michel X. Goemans and David P. Williamson}, title = {Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs}, journal = journal-combinatorica, publisher = publisher-springer, year = {1998}, volume = {18}, number = {1}, pages = {37--59}, doi = {10.1007/PL00009810} } @Article{ Gua98, author = {Dah-Jyh Guan}, title = {Generalized {Gray} Codes with Applications}, journal = {\bibremark{No string.}Proceedings of the National Science Council, Republic of China~(A)\bibremark{No publisher.}}, volume = {22}, number = {6}, pages = {841--848}, year = {1998} } @Book{ HHS98fundamentals, author = {Teresa W. Haynes and Stephen T. Hedetniemi and Peter J. Slater}, title = {Fundamentals of Domination in Graphs}, series = {\bibremark{No string.}Pure and Applied Mathematics}, volume = {208}, publisher = {\bibremark{No string.}Marcel Dekker}, year = {1998} } @Book{ HHS98advanced, author = {Teresa W. Haynes and Stephen T. Hedetniemi and Peter J. Slater}, title = {Domination in Graphs: Advanced Topics}, series = {\bibremark{No string.}Pure and Applied Mathematics}, volume = {209}, publisher = {\bibremark{No string.}Marcel Dekker}, year = {1998} } @Article{ KC98, author = {Paul E. Kearney and Derek G. Corneil}, title = {Tree Powers}, journal = journal-jalgorithms, publisher = publisher-elsevier, year = {1998}, volume = {29}, number = {1}, pages = {111--131} } @inproceedings{ KMP98, author = {Sanjeev Khanna and S. Muthukrishnan and Mike Paterson}, title = {On Approximating Rectangle Tiling and Packing}, booktitle = proc-soda-98, year = {1998}, pages = {384--393}, publisher = publisher-acmsiam } @article{ KMSV98, author = {Sanjeev Khanna and Rajeev Motwani and Madhu Sudan and Umesh V. Vazirani}, title = {On Syntactic versus Computational Views of Approximability}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {28}, number = {1}, year = {1998}, pages = {164--191} } @Book{ MN98, author = {Ji{\v{r}}{\'{i}} Matou{\v{s}}ek and Jaroslav Ne{\v{s}}et{\v{r}}il}, title = {Invitation to Discrete Mathematics}, series = {Oxford University Press\bibremark{Publisher or series?}}, publisher = publisher-clarendon, year = {1998} } @Article{ MPT98, author = {Jo{\~a}o Meidanis and Oscar Porto and Guilherme P. Telles}, title = {On the consecutive ones property}, journal = journal-discreteapplmath, publisher = publisher-elsevier, year = {1998}, volume = {88}, pages = {325--354}, } @InProceedings{ Nie98, author = {Rolf Niedermeier}, title = {Some Prospects for Efficient Fixed Parameter Algorithms}, booktitle = proc-sofsem-98, series = series-springer-lncs, volume = {1521}, pages = {168--185}, publisher = publisher-springer, year = {1998} } @InProceedings{ OG98, author = {Chris Okasaki and Andy Gill}, title = {Fast Mergeable Integer Maps}, booktitle = {\bibremark{No string.}Proceedings of the ACM SIGPLAN Workshop on ML\bibremark{No publisher.}}, pages = {77--86}, year = {1998} } @Book{ PS98, author = {Christos H. Papadimitriou and Kenneth Steiglitz}, title = {Combinatorial Optimization: Algorithms and Complexity}, publisher = publisher-dover, year = {1998}, edition = {Corrected}, note = {First edition } # publisher-prenticehall # {, 1982} } @Book{ Sch98, author = {Alexander Schrijver}, title = {Theory of Linear and Integer Programming}, publisher = publisher-wiley, year = {1998}, note = {First edition 1986} } @Book{ Ski98, author = {Steven S. Skiena}, title = {The Algorithm Design Manual}, publisher = publisher-springer, year = {1998} } @Article{ TV98, author = {Paul Thagard and Karsten Verbeurgt}, title = {Coherence as constraint satisfaction}, journal = {\bibremark{No string.}Cognitive Science\bibremark{No publisher.}}, volume = {22}, number = {1}, pages = {1--24}, year = {1998}, doi = {10.1016/S0364-0213(99)80033-0} } @InProceedings{ Wei98, author = {Karsten Weihe}, title = {Covering Trains by Stations or The Power of Data Reduction}, booktitle = {\bibremark{No string.}Proceedings of the 1st Workshop on Algorithms and Experiments (ALEX~'98)\bibremark{No publisher.}}, pages = {1--8}, year = {1998}, myurl = {http://rtm.science.unitn.it/alex98/book/weihe.ps.gz} } @Article{ WS98, author = {Duncan J. Watts and Steven H. Strogatz}, title = {Collective dynamics of `small-world' networks}, journal = {\bibremark{No string.}Nature\bibremark{No publisher.}}, volume = {393}, pages = {440--442}, year = {1998}, doi = {10.1038/30918} } @Article{ Zas98, author = {Thomas Zaslavsky}, title = {Bibliography of Signed and Gain Graphs}, journal = {\bibremark{No string.}Electronic Journal of Combinatorics\bibremark{No publisher.}}, volume = {DS8}, year = {1998}, note = {Updated version available at http://www.math.binghamton.edu/zaslav/Bsg/} } @InProceedings{ AK97, author = {Paola Alimonti and Viggo Kann}, title = {Hardness of Approximating Problems on Cubic Graphs}, booktitle = proc-ciac-97, myeditor = {Gian Carlo Bongiovanni and Daniel P. Bovet and Giuseppe Di Battista}, pages = {288--298}, publisher = publisher-springer, series = series-springer-lncs, volume = {1203}, year = {1997}, isbn = {3-540-62592-5} } @Article{ BK97, author = {Binay K. Bhattacharya and Damon Kaller}, title = {An {$O(m + n \log n)$} Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs}, journal = journal-jalgorithms, volume = {25}, number = {2}, year = {1997}, pages = {336--358} } @InProceedings{ Bod97, author = {Hans L. Bodlaender}, title = {Treewidth: Algorithmic Techniques and Results}, booktitle = proc-mfcs-97, series = series-springer-lncs, volume = {1295}, pages = {19--36}, publisher = publisher-springer, year = {1997} } @Article{ CC97, author = {Liming Cai and Jianer Chen}, title = {On Fixed-Parameter Tractability and Approximability of {NP} Optimization Problems}, journal = journal-jcss, volume = {54}, number = {3}, pages = {465--474}, publisher = publisher-elsevier, year = {1997} } @Article{ CCDF97, author = {Liming Cai and Jianer Chen and Rodney G. Downey and Michael R. Fellows}, title = {Advice classes of parameterized tractability}, journal = {\bibremark{No string.}Annals of Pure and Applied Logic\bibremark{No publisher.}}, volume = {84}, number = {1}, pages = {119--138}, year = {1997}, doi = {10.1016/S0168-0072(95)00020-8} } @InProceedings{ CMNR97, author = {K. Cirino and S. Muthu Muthukrishnan and N. S. Narayanaswamy and H. Ramesh}, title = {Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds}, booktitle = proc-fsttcs-97, myeditor = {S. Ramesh and G. Sivakumar}, publisher = publisher-springer, series = series-springer-lncs, volume = {1346}, year = {1997}, pages = {37--53}, myurl = {http://link.springer.de/link/service/series/0558/bibs/1346/13460037.htm} } @Article{ CT97, author = {Marco Cesati and Luca Trevisan}, title = {On the efficiency of polynomial time approximation schemes}, journal = journal-ipl, volume = {64}, number = {4}, pages = {165--171}, publisher = publisher-elsevier, year = {1997} } difficult name @InProceedings{ DF97, author = {Rong{-}chii Duh and Martin F{\"u}rer}, title = {Approximation of \textit{k}-{S}et {C}over by Semi-Local Optimization}, booktitle = proc-stoc-97, year = {1997}, pages = {256--264}, myurl = {http://doi.acm.org/10.1145/258533.258599}, publisher = publisher-acm, isbn = {0-89791-888-6} } @Article{ FL97, author = {M. Frances and A. Litman}, title = {On Covering Problems of Codes}, journal = journal-tocs, volume = {30}, number = {2}, pages = {113--119}, publisher = publisher-springer, year = {1997} } @InProceedings{ GG97, author = {Gavoille, Cyril and Gengler, Marc}, title = {An {O}mega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three}, booktitle = proc-sirocco-97, pages = {162--175}, publisher = publisher-carletonsc, year = {1997}, note = {Journal version appeared in \bibremark{No string.}\textit{Journal of Parallel and Distributed Computing}} } @Article{ GVY97, author = {Garg, Naveen and Vazirani, Vijay V. and Yannakakis, Mihalis}, title = {{Primal-dual approximation algorithms for integral flow and multicut in trees}}, journal = journal-algorithmica, volume = {18}, number = {1}, pages = {3--20}, publisher = publisher-springer, year = {1997} } @Book{ Hoc97, title = {Approximation Algorithms for {NP}-hard Problems}, editor = {Dorit S. Hochbaum}, publisher = {\bibremark{No string.}PWS Publishing Company}, year = {1997} } @InProceedings{ Hsu97, author = {Wen-Lian Hsu}, title = {On Physical Mapping Algorithms -- An Error-Tolerant Test for the Consecutive Ones Property}, booktitle = proc-cocoon-97, myeditor = {Tao Jiang and D. T. Lee}, year = {1997}, publisher = publisher-springer, series = series-springer-lncs, volume = {1276}, pages = {242--250} } @Article{ JSW97, author = {Klaus Jansen and Petra Scheffler and Gerhard J. Woeginger}, title = {The disjoint cliques problem}, journal = {\bibremark{No string.}RAIRO Recherche op{\'e}rationnelle\bibremark{No publisher.}}, volume = {31}, number = {1}, pages = {45--66}, year = {1997}, myurl = {http://citeseer.ist.psu.edu/cache/papers/cs/20246/http:zSzzSzwww.informatik.uni-kiel.dezSzinfzSzJansenzSzkjzSzFCT93_L.pdf/the-disjoint-cliques-problem.pdf} } @TechReport{ Kea97, author = {Paul E. Kearney}, title = {The relationship between a phylogeny and its ordinal assertions}, institution = institution-torontocs, year = {1997}, number = {308/97} } @InProceedings{ KKM97, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller}, title = {Asteroidal Sets in Graphs}, booktitle = proc-wg-97, publisher = publisher-springer, series = series-springer-lncs, volume = {1335}, pages = {229--241}, year = {1997} } @Article{ KMR97, author = {David R. Karger and Rajeev Motwani and G. D. S. Ramkumar}, title = {On approximating the longest path in a graph}, journal = journal-algorithmica, publisher = publisher-springer, volume = {18}, number = {1}, pages = {82--98}, year = {1997}, doi = {10.1007/BF02523689} } @Article{ KanW97, author = {Sampath Kannan and Tandy Warnow}, title = {A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies}, journal = journal-siamjcomput, publisher = publisher-siam, pages = {1749--1763}, year = {1997}, volume = {26}, number = {6} } @Book{ KalW97, author = {Josef Kallrath and John M. Wilson}, title = {Business Optimization Using Mathematical Programming}, publisher = {\bibremark{No string.}MacMillan Press}, year = {1997} } @Article{ LC97, author = {Y. Daniel Liang and Maw-Shang Chang}, title = {Minimum Feedback Vertex Sets in Comparability Graphs and Convex Bipartite Graphs}, journal = journal-actainform, publisher = publisher-springer, volume = {34}, number = {5}, year = {1997}, pages = {337--346} } @Article{ LSW97, author = {In-Jen Lin and Malay K. Sen and Douglas B. West}, title = {Classes of Interval Digraphs and 0,1-Matrices}, journal = journal-congrnumer#{ ({P}roc.\ 28th {SE})}, volume = {125}, year = {1997}, pages = {201--209} } @InProceedings{ MT97, author = {Christos Makris and Athanasios K. Tsakalidis}, title = {Fast piercing of iso-oriented rectangles}, booktitle = proc-cccg-97, year = {1997} } @InProceedings{ Nus97, author = {Doron Nussbaum}, title = {Rectilinear p-Piercing Problems}, booktitle = proc-issac-97, myeditor = {Wolfgang K{\"u}chlin}, year = {1997}, pages = {316--323}, publisher = publisher-acm } @InProceedings{ Pap97, author = {Christos H. Papadimitriou}, title = {{NP}-Completeness: A Retrospective}, booktitle = proc-icalp-97, pages = {2--6}, publisher = publisher-springer, series = series-springer-lncs, volume = {1256}, year = {1997}, isbn = {3-540-63165-8} } @InProceedings{ Ram97, author = {Venkatesh Raman}, title = {Parameterized complexity}, booktitle = {\bibremark{No string.}Proc.\ 7th National Seminar on Theoretical Computer Science (Chennai, India)\bibremark{No publisher.}}, pages = {I-1--I-18}, year = {1997} } @InProceedings{ RS97, author = {Ran Raz and Shmuel Safra}, title = {A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP}, booktitle = proc-stoc-97, year = {1997}, pages = {475--484}, publisher = publisher-acm, myurl = {http://doi.acm.org/10.1145/258533.258641} } @Article{ RSST97, author = {Neil Robertson and Daniel P. Sanders and Paul D. Seymour and Robin Thomas}, title = {The four-color theorem}, journal = journal-jcombintheoryB, publisher = publisher-elsevier, volume = {70}, number = {1}, pages = {2--44}, year = {1997} } @InProceedings{ SMVS97, author = {Heiko Schr{\"o}der and A. E. May and Imrich Vrto and Ondrej S{\'y}kora}, title = {Approximation Algorithms for the Vertex Bipartization Problem}, booktitle = proc-sofsem-97, year = {1997}, series = series-springer-lncs, volume = {1338}, pages = {547--554}, publisher = publisher-springer } @Article{ TP97, author = {Jan Arne Telle and Andrzej Proskurowski}, title = {Algorithms for Vertex Partitioning Problems on Partial $k$-Trees}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {10}, number = {4}, pages = {529--550}, year = {1997} } @Article{ AM96, author = {Jonathan E. Atkins and Martin Middendorf}, title = {On Physical Mapping and the Consecutive Ones Property for Sparse Matrices}, journal = journal-discreteapplmath, volume = {71}, number = {1--3}, year = {1996}, pages = {23--40}, myurl = {http://dx.doi.org/10.1016/S0166-218X(96)00055-8}, doi = {10.1016/S0166-218X(96)00055-8}, publisher = publisher-elsevier } @Article{ BHH96, author = {Binay K. Bhattacharya and Pavol Hell and Jing Huang}, title = {A Linear Algorithm for Maximum Weight Cliques in ProperCircular Arc Graphs}, journal = journal-siamjdiscretemath, volume = {9}, number = {2}, year = {1996}, pages = {274--289}, myurl = {http://epubs.siam.org/sam-bin/dbq/article/24275} } @Article{ Bod96, author = {Hans L. Bodlaender}, title = {A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth}, journal = journal-siamjcomput, volume = {25}, number = {6}, pages = {1305--1317}, publisher = publisher-siam, year = {1996}, doi = {10.1137/S0097539793251219} } @Article{ Cai96, author = {Leizhen Cai}, title = {Fixed-parameter tractability of graph modification problems for hereditary properties}, journal = journal-ipl, publisher = publisher-elsevier, year = {1996}, volume = {58}, number = {4}, pages = {171--176}, myurl = {http://dx.doi.org/10.1016/0020-0190(96)00050-6}, doi = {10.1016/0020-0190(96)00050-6} } @Article{ CDP96, author = {Artur Czumaj and Krzysztof Diks and Teresa M. Przytycka}, title = {Parallel Maximum Independent Set in Convex Bipartite Graphs}, journal = journal-ipl, publisher = publisher-elsevier, volume = {59}, number = {6}, year = {1996}, pages = {289--294}, myurl = {http://dx.doi.org/10.1016/0020-0190(96)00131-7}, doi = {10.1016/0020-0190(96)00131-7} } @Article{ DHH96, author = {Xiaotie Deng and Pavol Hell and Jing Huang}, title = {Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {25}, number = {2}, year = {1996}, pages = {390--403} } @Article{ FGS96, author = {Michele Flammini and Giorgio Gambosi and Sandro Salomone}, title = {Interval routing schemes}, journal = journal-algorithmica, publisher = publisher-springer, volume = {16}, number = {6}, pages = {549--568}, year = {1996} } @InProceedings{ GP96, author = {Cyril Gavoille and St\'{e}phane P\'{e}renn\`{e}s}, title = {Memory Requirements for Routing in Distributed Networks}, booktitle = proc-podc-96, year = {1996}, pages = {125--133}, publisher = publisher-acm, mymonth = {may} } @Article{ GVY96, author = {Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis}, title = {Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications}, journal = journal-siamjcomput, volume = {25}, number = {2}, pages = {235--251}, publisher = publisher-siam, year = {1996}, doi = {10.1137/S0097539793243016} } @InProceedings{ HP96, author = {Sridhar Hannenhalli and Pavel A. Pevzner}, title = {To Cut\ldots or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution)}, booktitle = proc-soda-96, pages = {304--313}, publisher = publisher-acmsiam, year = {1996} } @inproceedings{ KN96, author = {Matthew J. Katz and Frank Nielsen}, title = {On Piercing Sets of Objects}, booktitle = proc-socg-96, publisher = publisher-acm, year = {1996}, pages = {113--121}, myurl = {http://doi.acm.org/10.1145/237218.237253} } @InProceedings{ KS96ISTCS, author = {Haim Kaplan and Ron Shamir}, title = {Physical Maps and Interval Sandwich Problems: Bounded Degrees Help}, booktitle = proc-istcs-96 # {\bibremark{No publisher.}}, year = {1996}, pages = {195--201} } @Article{ KS96siamjomput, author = {Haim Kaplan and Ron Shamir}, title = {Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {25}, number = {3}, year = {1996}, pages = {540--561} } @Misc{ LVD+96, author = {Xavier Leroy and J{\'e}r{\^o}me Vouillon and Damien Doligez and others}, title = {The {Objective Caml} System}, year = {1996}, howpublished = {Available on the web}, note = {\biburl{http://caml.inria.fr/ocaml/}} } @Article{ PY96, author = {Christos H. Papadimitriou and Mihalis Yannakakis}, title = {On limited nondeterminism and the complexity of the {V-C} dimension}, journal = journal-jcss, volume = {53}, number = {2}, pages = {161--170}, publisher = publisher-elsevier, year = {1996} } @InProceedings{ RSST96, author = {Neil Robertson and Daniel P. Sanders and Paul D. Seymour and Robin Thomas}, title = {Efficiently four-coloring planar graphs}, booktitle = proc-stoc-96, pages = {571--575}, publisher = publisher-acm, year = {1996} } @Book{ Sie96, author = {Gerard Sierksma}, title = {Linear and Integer Programming}, publisher = {\bibremark{No string.}Marcel Dekker}, year = {1996} } @Book{ Stu96, author = {Bernd Sturmfels}, title = {Gr{\"o}bner Bases and Convex Polytopes}, series = {\bibremark{No string.}University Lecture Series}, volume = {8}, publisher = publisher-ams, year = {1996} } @InProceedings{ SW96, author = {Micha Sharir and Emo Welzl}, title = {Rectilinear and Polygonal {\it p}-Piercing and {\it p}-Center Problems}, booktitle = proc-socg-96, year = {1996}, publisher = publisher-acm, pages = {122--132}, url = {http://doi.acm.org/10.1145/237218.237255} } @Article{ SY96, author = {G. Steiner and J. S. Yeomans}, title = {A linear time algorithm for maximum matchings in convex bipartite graphs}, journal = journal-computmathappl, publisher = publisher-elsevier, volume = {31}, pages = {91--96}, year = {1996} } @incollection{ AS95, author = {Pankaj K. Agarwal and Micha Sharir}, title = {Algorithmic Techniques for Geometric Optimization}, booktitle = {Computer Science Today: Recent Trends and Developments}, editor = {Jan van Leeuwen}, publisher = publisher-springer, series = series-springer-lncs, volume = {1000}, year = {1995}, pages = {234--253} } @Article{ AYZ95, author = {Noga Alon and Raphael Yuster and Uri Zwick}, title = {Color-coding}, journal = journal-jacm, publisher = publisher-acm, volume = {42}, number = {4}, pages = {844--856}, year = {1995}, doi = {10.1145/210332.210337} } @Unpublished{ BDFHW95, author = {Hans Bodlaender and Rodney G. Downey and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham}, title = {Parameterized Complexity Analysis in Computational Biology}, year = {1995}, note = {Manuscript} } @Article{ BDFW95, author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and H. Todd Wareham}, title = {The parameterized complexity of the longest common subsequence problem}, journal = journal-tcs, publisher = publisher-elsevier, volume = {147}, pages = {31--54}, year = {1995} } @Article{ CC95, author = {Michele Conforti and G{\'e}rard Cornu{\'e}jols}, title = {Balanced $0,\pm 1$-matrices, bicoloring and total dual integrality}, journal = journal-mathprogram, publisher = publisher-springer, volume = {71}, year = {1995}, pages = {249--258} } @Article{ DF95siamjcomput, author = {Rodney G. Downey and Michael R. Fellows}, title = {Fixed-Parameter Tractability and Completeness~{I}: Basic Results}, journal = journal-siamjcomput, volume = {24}, number = {4}, pages = {873--921}, publisher = publisher-siam, year = {1995}, doi = {10.1137/S0097539792228228} } @Article{ DF95tcs, author = {Rodney G. Downey and Michael R. Fellows}, title = {Fixed-Parameter Tractability and Completeness~{II}: On Completeness for {W}[1]}, journal = journal-tcs, publisher = publisher-elsevier, volume = {141}, number = {1{\&}2}, year = {1995}, pages = {109--131}, myurl = {http://dx.doi.org/10.1016/0304-3975(94)00097-3}, doi = {10.1016/0304-3975(94)00097-3} } @InProceedings{ DF95Feasible, author = {Rod G. Downey and Michael R. Fellows}, title = {Parameterized computational feasibility}, booktitle = {Feasible Mathematics~{II}}, pages = {219--244}, publisher = {\bibremark{No string.}Birkh{\"a}user}, year = {1995} } @Article{ FR95, author = {Alan M. Frieze and Bruce Reed}, title = {Covering the Edges of a Random Graph by Cliques}, journal = journal-combinatorica, publisher = publisher-springer, volume = {15}, number = {4}, pages = {489--497}, year = {1995} } @Article{ GGKS95, author = {Paul W. Goldberg and Martin Charles Golumbic and Haim Kaplan and Ron Shamir}, title = {Four Strikes Against Physical Mapping of {DNA}}, journal = journal-jcomputbiol, publisher = publisher-maryannliebert, volume = {2}, number = {1}, year = {1995}, pages = {139--152} } @Article{ GPRS95, author = {B. Gamble and W. Pulleybank and B. Reed and B. Shepherd}, title = {Right angle free subsets in the plane}, journal = journal-graphscombin, volume = {11}, number = {2}, year = {1995}, pages = {121--129}, publisher = publisher-springer } @Article{ GW95, author = {Michel X. Goemans and David P. Williamson}, title = {Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming}, journal = journal-jacm, publisher = publisher-acm, volume = {42}, number = {6}, pages = {1115--1145}, year = {1995}, doi = {10.1145/227683.227684} } @Book{ Hof95, author = {Hofri, Micha}, title = {{Analysis of Algorithms: Computational Methods and Mathematical Tools}}, publisher = publisher-oxford, year = {1995} } @Article{ Hsu95, author = {Wen-Lian Hsu}, title = {{$O(M*N)$}~Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {24}, number = {3}, year = {1995}, pages = {411--439} } @InCollection{ Lag95, author = {Jeffrey C. Lagarias}, title = {Point lattices}, booktitle = {Handbook of Combinatorics}, editor = {Ronald~L.~Graham et al.}, pages = {919--966}, publisher = publisher-mit, year = {1995} } @Article{ LB95, author = {Y. Daniel Liang and Norbert Blum}, title = {Circular Convex Bipartite Graphs: Maximum Matching and {H}amiltonian Circuits}, journal = journal-ipl, publisher = publisher-elsevier, volume = {56}, number = {4}, year = {1995}, pages = {215--219}, myurl = {http://dx.doi.org/10.1016/0020-0190(95)00145-3}, doi = {10.1016/0020-0190(95)00145-3} } @Article{ LS95, author = {Yaw Ling Lin and Steven S. Skiena}, title = {Algorithms for Square Roots of Graphs}, journal = journal-siamjdiscretemath, publisher = publisher-siam, year = {1995}, volume = {8}, number = {1}, pages = {99--118} } @Book{ MR95, author = {Motwani, Rajeev and Raghavan, Prabhakar}, title = {Randomized Algorithms}, publisher = publisher-cambridge, year = {1995} } @Article{ LY95, author = {Carsten Lund and Mihalis Yannakakis}, title = {On the Hardness of Approximating Minimization Problems}, journal = journal-jacm, publisher = publisher-acm, volume = {41}, number = {5}, year = {1995}, pages = {960--981}, myurl = {db/journals/jacm/LundY94.html, http://doi.acm.org/10.1145/185675.306789} } @InProceedings{ Pri95, author = {Erich Prisner}, title = {Graphs with Few Cliques}, booktitle = {\bibremark{No string.}Proceedings of the 7th Conference on the Theory and Applications of Graphs}, pages = {945--956}, publisher = publisher-wiley, year = {1995} } @Article{ Sey95, author = {Paul D. Seymour}, title = {Packing directed circuits fractionally}, journal = journal-combinatorica, publisher = publisher-springer, volume = {15}, number = {2}, pages = {281--288}, year = {1995}, doi = {10.1007/BF01200760} } @InProceedings{ Sri95, author = {Aravind Srinivasan}, title = {Improved approximations of packing and covering problems}, booktitle = proc-stoc-95, year = {1995}, pages = {268--276}, myurl = {http://doi.acm.org/10.1145/225058.225138}, publisher = publisher-acm, } @Article{ YC95, author = {Chang-Wu Yu and Gen-Huey Chen}, title = {Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs}, journal = journal-tcs, publisher = publisher-elsevier, volume = {147}, number = {1{\&}2}, year = {1995}, pages = {249--265}, myurl = {http://dx.doi.org/10.1016/0304-3975(94)00220-D}, doi = {10.1016/0304-3975(94)00220-D} } @Article{ AF94, author = {Richa Agarwala and David Fern\'{a}ndez-Baca}, title = {A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed}, journal = journal-siamjcomput, publisher = publisher-siam, pages = {1216--1224}, year = {1994}, volume = {23}, number = {6} } @Article{ Bak94, author = {Brenda S. Baker}, title = {Approximation Algorithms for {NP}-Complete Problems on Planar Graphs}, journal = journal-jacm, publisher = publisher-acm, volume = {41}, number = {1}, pages = {153--180}, year = {1994} } @Conference{ BecG94, author = {Ann Becker and Dan Geiger}, title = {Approximation algorithms for the {Loop Cutset} problem}, booktitle = {\bibremark{No string.}Proc.\ 10th Conference on Uncertainty in Artificial Intelligence}, pages = {60--68}, publisher = publisher-morgankaufmann, year = {1994} } @Article{ BelG94, author = {Mihir Bellare and Shafi Goldwasser}, title = {The Complexity of Decision Versus Search}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {23}, number = {1}, year = {1994}, pages = {97--119} } @Article{ Bod94, author = {Hans Leo Bodlaender}, title = {On disjoint cycles}, journal = {\bibremark{No string.}International Journal of Foundations of Computer Science\bibremark{No publisher.}}, year = {1994}, volume = {5}, pages = {59--68} } @InProceedings{ CRS94, author = {Jun Dong Cho and Salil Raje and Majid Sarrafzadeh}, title = {Approximation algorithm on multi-way maxcut partitioning}, booktitle = proc-esa-94, pages = {148--158}, year = {1994}, volume = {855}, series = series-springer-lncs } @Article{ GKS94, author = {Martin Charles Golumbic and Haim Kaplan and Ron Shamir}, title = {On the Complexity of {DNA} Physical Mapping}, journal = journal-advapplmath, publisher = publisher-elsevier, volume = {15}, year = {1994}, pages = {251--261} } @InProceedings{ GVY94, author = {Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis}, title = {Multiway cuts in directed and node weighted graphs}, booktitle = proc-icalp-94, series = series-springer-lncs, volume = {820}, pages = {487--498}, publisher = publisher-springer, year = {1994}, doi = {10.1007/3-540-58201-0_92} } @InProceedings{ KST94, author = {Haim Kaplan and Ron Shamir and Robert Endre Tarjan}, title = {Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping}, booktitle = proc-focs-94, publisher = publisher-ieee, year = {1994}, pages = {780--791} } @Book{ Klo94, author = {Ton Kloks}, title = {Treewidth. Computations and Approximations}, series = series-springer-lncs, volume = {842}, publisher = publisher-springer, year = {1994}, isbn = {978-3-540-58356-1} } @InProceedings{ LMRM94, author = {Y. Daniel Liang and Glenn K. Manacher and Chong Jye Rhee and Terrance A. Mankus}, title = {A linear algorithm for {H}amiltonian circuits in circular arc graphs}, booktitle = proc-acmsoutheast-94, publisher = publisher-acm, year = {1994}, pages = {15--22} } difficult name @InProceedings{ LT94, author = {van Leeuwen, Jan and Richard B. Tan}, title = {Compact Routing Methods: A Survey}, booktitle = proc-sirocco-94, year = {1994}, pages = {99--110}, publisher = publisher-carletonup, isbn = {0-88629-253-0} } @Article{ LY94, author = {Carsten Lund and Mihalis Yannakakis}, title = {On the hardness of approximating minimization problems}, journal = journal-jacm, publisher = publisher-acm, volume = {41}, number = {5}, pages = {960--981}, year = {1994}, doi = {10.1145/185675.306789} } @Article{ MS94, author = {Rajeev Motwani and Madhu Sudan}, title = {Computing Roots of Graphs Is Hard}, journal = journal-discreteapplmath, publisher = publisher-elsevier, year = {1994}, volume = {54}, number = {1}, pages = {81--88} } @Article{ Nil94, author = {Alon Nilli}, title = {Perfect Hashing and Probability}, journal = {\bibremark{No string.}Combinatorics, Probability and Computing\bibremark{No publisher.}}, volume = {3}, pages = {407--409}, year = {1994} } @Book{ Pap94, author = {Christos M. Papadimitriou}, title = {Computational Complexity}, ISBN = {0201530821}, publisher = publisher-addisonwesley, year = {1994} } @Article{ ST94, author = {Paul D. Seymour and Robin Thomas}, title = {Call Routing and the Ratcatcher}, journal = journal-combinatorica, publisher = publisher-springer, volume = {14}, number = {2}, pages = {217--241}, year = {1994} } @Article{ AAAS93, author = {Pankaj K. Agarwal and Noga Alon and Boris Aronov and Subhash Suri}, title = {Can visibility graphs be represented compactly?}, journal = journal-discretecomputgeom, publisher = publisher-springer, volume = {12}, number = {1}, pages = {347--365}, year = {1994}, doi = {10.1007/BF02574385} } @Book{ AMO93, author = {Ravindra K. Ahuja and Thomas L. Magnanti and James B. Orlin}, title = {Network Flows: Theory, Algorithms, and Applications}, year = {1993}, publisher = publisher-prenticehall } @Article{ BG93, author = {Jonathan F. Buss and Judy Goldsmith}, title = {Nondeterminism within {$P$}}, journal = journal-siamjcomput, volume = {22}, number = {3}, pages = {560--572}, publisher = publisher-siam, year = {1993} } @Article{ Bod93Acta, author = {Hans L. Bodlaender}, title = {A Tourist Guide through Treewidth}, journal = {\bibremark{No string.}Acta Cybernetica\bibremark{No publisher.}}, volume = {11}, number = {1--2}, pages = {1--22}, year = {1993} } @Article{ Bod93jalgorithms, author = {Hans L. Bodlaender}, title = {On Linear Time Minor Tests with Depth-First Search}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {14}, number = {1}, pages = {1--23}, year = {1993} } @Article{ CP93, author = {Nicos Christofides and Jos{\'{e}} M. P. Paix{\~{a}}o}, title = {Algorithms for large scale set covering problems}, journal = journal-annoperres, publisher = publisher-springer, volume = {43}, number = {5}, year = {1993}, doi = {10.1007/BF02025297}, pages = {259--277} } @InProceedings{ ES93, author = {Elaine M. Eschen and Jeremy Spinrad}, title = {An {$O(n^2)$} Algorithm for Circular-Arc Graph Recognition}, booktitle = proc-soda-93, year = {1993}, pages = {128--137}, publisher = publisher-acmsiam } @InProceedings{ FHW93, author = {Michael R. Fellows and Michael T. Hallett and Harold T. Wareham}, title = {DNA Physical Mapping: Three Ways Difficult}, booktitle = proc-esa-93, myeditor = {Thomas Lengauer}, pages = {157--168}, publisher = publisher-springer, series = series-springer-lncs, volume = {726}, year = {1993}, isbn = {3-540-57273-2}, } @TechReport{ KS93, author = {Haim Kaplan and Ron Shamir}, title = {Pathwidth, Bandwidth and Completion Problems to Proper Interval Graphs with Small Cliques}, year = {1993} } @Article{ LR93, author = {Y. Daniel Liang and Chongkye Rhee}, title = {Finding a Maximum Matching in a Circular-Arc Graph}, journal = journal-ipl, publisher = publisher-elsevier, volume = {45}, number = {4}, year = {1993}, pages = {185--190} } @InProceedings{ LY93, author = {Carsten Lund and Mihalis Yannakakis}, title = {The Approximation of Maximum Subgraph Problems}, booktitle = proc-icalp-93, series = series-springer-lncs, volume = {700}, pages = {40--51}, publisher = publisher-springer, year = {1993}, myurl = {http://springerlink.com/content/725748582qhk62r1} } @InProceedings{ Ree93, author = {Bruce Reed}, title = {Finding approximate separators and computing tree-width quickly}, booktitle = proc-stoc-93, pages = {221--228}, publisher = publisher-acm, year = {1993} } @Article{ ST93, author = {Paul D. Seymour and Robin Thomas}, title = {Graph Searching and a Min-Max Theorem for Tree-Width}, journal = journal-jcombintheoryB, publisher = publisher-elsevier, volume = {58}, number = {1}, pages = {22--33}, year = {1993}, doi = {10.1006/jctb.1993.1027} } @InProceedings{ TP93, author = {Jan Arne Telle and Andrzej Proskurowski}, title = {Practical algorithms on partial {$k$}-trees with an application to domination-like problems}, booktitle = proc-wads-93, series = series-springer-lncs, volume = {709}, pages = {610--621}, publisher = publisher-springer, year = {1993} } @InProceedings{ Abd92, author = {Ahsan Abdullah}, title = {On graph bipartization}, booktitle = {\bibremark{No string.}Proceedings of the 1992 IEEE International Symposium on Circuits and Systems (ISCAS~'92)\bibremark{No publisher.}}, volume = {4}, pages = {1847--1850}, year = {1992} } difficult name @Article{ BTT92, author = {John J. Bartholdi~{III} and Craig A. Tovey and Michael A. Trick}, title = {How hard is it to control an election}, journal = {\bibremark{No string.}Mathematical and Computer Modelling\bibremark{No publisher.}}, volume = {16}, number = {8--9}, pages = {27--40}, year = {1992} } @Article{ CW92, author = {Maw-Shang Chang and Fu-Hsing Wang}, title = {Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs}, journal = journal-ipl, volume = {43}, number = {6}, pages = {293--295}, publisher = publisher-elsevier, year = {1992}, doi = {10.1016/0020-0190(92)90114-B} } @Article{ DF92, author = {Rodney G. Downey and Michael R. Fellows}, title = {Fixed-parameter tractability and completeness}, journal = journal-congrnumer, publisher = publisher-utilitas, year = {1992}, volume = {87}, pages = {161--187} } @Article{ FMU92, author = {Jean Fonlupt and Ali Ridha Mahjoub and Jean-Pierre Uhry}, title = {Compositions in the bipartite subgraph polytope}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {105}, number = {1--3}, pages = {73--91}, year = {1992}, doi = {10.1016/0012-365X(92)90133-Z} } Dagstuhl? @Article{ Hoo92, author = {D. N. Hoover}, title = {Complexity of graph covering problems for graphs of low degree}, journal = {\bibremark{No string.}Journal of Combinatorial Mathematics and Combinatorial Computing\bibremark{No publisher.}}, volume = {11}, pages = {187--208}, year = {1992} } @InProceedings{ Hsu92ISAAC, author = {Wen-Lian Hsu}, title = {A Simple Test for the Consecutive Ones Property}, booktitle = proc-isaac-92, myeditor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita}, year = {1992}, pages = {459--468}, publisher = publisher-springer, series = series-springer-lncs, volume = {650}, note = {Journal version appeared in } # journal-jalgorithms-it } @InProceedings{ Hsu92WG, author = {Wen-Lian Hsu}, title = {A Simple Test for Interval Graphs}, booktitle = proc-wg-92, myeditor = {Ernst W. Mayr}, year = {1992}, pages = {11--16}, publisher = publisher-springer, series = series-springer-lncs, volume = {657} } @PhDThesis{ Kan92, author = {Viggo Kann}, title = {On the Approximability of {NP}-complete Optimization Problems}, year = {1992}, school = {\bibremark{No string.}Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm} } @Article{ SCH92, author = {Wei-Kuan Shih and T. C. Chern and Wen-Lian Hsu}, title = {An {$O(n^2 \log n)$} algorithm for the {H}amiltonian cycle problem on circular-arc graphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {21}, number = {6}, year = {1992}, pages = {1026--1046} } @Article{ Ste92, author = {Mike A. Steel}, title = {The complexity of reconstructing trees from qualitative characters and subtrees}, journal = {\bibremark{No string.}Journal of Classification\bibremark{No publisher.}}, volume = {9}, pages = {91--116}, year = {1992} } @Article{ BH91, author = {Endre Boros and Peter L. Hammer}, title = {The max-cut problem and quadratic 0--1 optimization; polyhedral aspects, relaxations and bounds}, journal = journal-annoperres, publisher = publisher-springer, volume = {33}, number = {3}, pages = {151--180}, year = {1991}, doi = {10.1007/BF02115753} } @Article{ HM91, author = {Refael Hassin and Nimrod Megiddo}, title = {Approximation algorithms for hitting objects with straight lines}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {30}, pages = {29--42}, year = {1991} } @Article{ HNZ91, author = {Irith Ben-Arroyo Hartman and Ilan Newman and Ran Ziv}, title = {On grid intersection graphs}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {87}, pages = {41--52}, year = {1991} } @Article{ HT91, author = {Wen-Lian Hsu and Kuo-Hui Tsai}, title = {Linear time algorithms on circular-arc graphs}, journal = journal-ipl, volume = {40}, number = {3}, pages = {123--129}, publisher = publisher-elsevier, year = {1991} } @Article{ PY91, author = {Christos H. Papadimitriou and Mihalis Yannakakis}, title = {Optimization, Approximation, and Complexity Classes}, journal = journal-jcss, volume = {43}, number = {3}, pages = {425--440}, publisher = publisher-elsevier, year = {1991}, doi = {10.1016/0022-0000(91)90023-X} } difficult name @InProceedings{ RAK91, author = {R. Ravi and Ajit Agrawal and Philip N. Klein}, title = {Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion}, booktitle = proc-icalp-91, myeditor = {Javier Leach Albert and Burkhard Monien and Mario Rodr{\'{\i}}guez{-}Artalejo}, year = {1991}, pages = {751--762}, publisher = publisher-springer, series = series-springer-lncs, volume = {510} } @Article{ ABLP90, author = {Baruch Awerbuch and Amotz Bar-Noy and Nathan Linial and David Peleg}, title = {Improved Routing Strategies with Succinct Tables}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {11}, number = {3}, year = {1990}, pages = {307--341} } @InProceedings{ AP90, author = {Baruch Awerbuch and David Peleg}, title = {Sparse Partitions}, booktitle = proc-focs-90, year = {1990}, pages = {503--513}, publisher = publisher-ieeecs } difficult name @InCollection{ BS90, author = {Ravi B. Boppana and Michael Sipser}, title = {The Complexity of Finite Functions}, booktitle = {Handbook of Theoretical Computer Science, Volume~A}, editor = {Jan van Leeuwen}, pages = {757--804}, publisher = publisher-elsevier, year = {1990} } @Article{ CW90, author = {Don Coppersmith and Shmuel Winograd}, title = {Matrix Multiplication via Arithmetic Progressions}, journal = {\bibremark{No string.}Journal of Symbolic Computations\bibremark{No publisher.}}, volume = {9}, pages = {251--280}, year = {1990} } @Article{ DMK90, author = {Peter Damaschke and Haiko M{\"u}ller and Dieter Kratsch}, title = {Domination in Convex and Chordal Bipartite Graphs}, journal = journal-ipl, publisher = publisher-elsevier, volume = {36}, number = {5}, year = {1990}, pages = {231--236} } @Article{ Gya90, author = {Andr{\'a}s Gy{\'a}rf{\'a}s}, title = {A simple lower bound on edge coverings by cliques}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {85}, number = {1}, pages = {103--104}, year = {1990}, doi = {10.1016/0012-365X(90)90168-H} } difficult name @InProceedings{ HBH90, author = {Pavol Hell and J{\o}rgen Bang{-}Jensen and Jing Huang}, title = {Local Tournaments and Proper Circular Arc Gaphs}, booktitle = {\bibremark{No string.}Proceedings of the SIGAL International Symposium on Algorithms}, myeditor = {Tetsuo Asano and Toshihide Ibaraki and Hiroshi Imai and Takao Nishizeki}, year = {1990}, pages = {101--108}, publisher = publisher-springer, series = series-springer-lncs, volume = {450} } @InProceedings{ PV90, author = {J{\"u}rgen Plehn and Bernd Voigt}, title = {Finding Minimally Weighted Subgraphs}, booktitle = proc-wg-90, series = series-springer-lncs, volume = {484}, pages = {18--29}, publisher = publisher-springer, year = {1990} } difficult name @Article{ SH90, author = {R. E. Stearns and H. B. Hunt~{III}}, title = {Power indices and easier hard problems}, journal = {\bibremark{No string.}Mathematical Systems Theory\bibremark{No publisher.}}, volume = {23}, pages = {209--225}, year = {1990} } @InProceedings{ ABLP89, author = {Baruch Awerbuch and Amotz Bar-Noy and Nathan Linial and David Peleg}, title = {Compact Distributed Data Structures for Adaptive Routing}, booktitle = proc-stoc-89, pages = {479--489}, year = {1989}, publisher = publisher-acm } @Article{ BEHW89, author = {Anselm Blummer and Andrzej Ehrenfeucht and David Haussler and Manfred K. Warmuth}, title = {Learnability and the {V}apnik-{C}hervonenkis dimension}, journal = journal-jacm, publisher = publisher-acm, volume = {36}, pages = {929--965}, year = {1989} } @Book{ Big89, author = {Norman L. Biggs}, title = {Discrete Mathematics}, series = {\bibremark{No string.}Oxford Science Publications\bibremark{Publisher or series?}}, publisher = publisher-clarendon, year = {1989}, edition = {Revised} } @Article{ BM89, author = {Francisco Barahona and Ali {Ridha Mahjoub}}, title = {Facets of the balanced (acyclic) induced subgraph polytope}, journal = journal-mathprogram, publisher = publisher-springer, volume = {45}, number = {1--3}, pages = {21--33}, year = {1989}, doi = {10.1007/BF01589094} } @Article{ CNR89, author = {Hyeong-Ah Choi and Kazuo Nakajima and Chong S. Rim}, title = {Graph Bipartization and Via Minimization}, journal = journal-siamjdiscretemath, publisher = publisher-siam, volume = {2}, number = {1}, pages = {38--47}, year = {1989} } Albert Maurice Erisman John Ker Reid @Book{ DER89, author = {Iain S. Duff and Albert M. Erisman and John K. Reid}, title = {Direct Methods for Sparse Matrices}, publisher = publisher-oxford, series = {\bibremark{No string.}Monographs on Numerical Analysis}, year = {1989} } @Article{ FJ89, author = {Greg N. Frederickson and Ravi Janardan}, title = {Efficient Message Routing in Planar Networks}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {18}, number = {4}, year = {1989}, pages = {843--857} } @InProceedings{ FL89, author = {Michael R. Fellows and Michael A. Langston}, title = {An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations}, booktitle = proc-focs-89, pages = {520--525}, publisher = publisher-ieee, year = {1989} } @Article{ GT89, author = {Harold N. Gabow and Robert E. Tarjan}, title = {Faster Scaling Algorithms for Network Problems}, journal = journal-siamjcomput, volume = {18}, number = {5}, pages = {1013--1036}, publisher = publisher-siam, year = {1989}, doi = {10.1137/0218069} } @Article{ KM89, author = {Norbert Korte and Rolf H. M{\"o}hring}, title = {An Incremental Linear-Time Algorithm for Recognizing Interval Graphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {18}, number = {1}, year = {1989}, pages = {68--81} } @Article{ MWW89, author = {S. Ma and Walter D. Wallis and J. Wu}, title = {Clique covering of chordal graphs}, journal = {\bibremark{No string.}Utilitas Mathematica\bibremark{No publisher.}}, volume = {36}, pages = {151--152}, year = {1989} } @Article{ PU89, author = {David Peleg and Eli Upfal}, title = {A trade-off between space and efficiency for routing tables}, journal = journal-jacm, volume = {36}, number = {3}, year = {1989}, pages = {510--530}, publisher = publisher-acm } @Article{ SH89, author = {Wei-Kuan Shih and Wen-Lian Hsu}, title = {An {$O(n^{1.5})$} algorithm to color proper circular arcs}, journal = journal-discreteapplmath, publisher = publisher-elsevier, volume = {25}, year = {1989}, pages = {321--323} } @InProceedings{ Spe89, author = {Ewald Speckenmeyer}, title = {On Feedback Problems in Digraphs}, booktitle = {\bibremark{No string.}Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science (WG~'89)}, series = series-springer-lncs, volume = {411}, pages = {218--231}, publisher = publisher-springer, year = {1989} } @Article{ BGJR88, author = {Francisco Barahona and Martin Gr{\"o}tschel and Michael J{\"u}nger and Gerhard Reinelt}, title = {An application of combinatorial optimization to statistical physics and circuit layout design}, journal = journal-operres, publisher = publisher-informs, volume = {36}, number = {3}, pages = {493--513}, year = {1988}, myurl = {http://www.zib.de/groetschel/pubnew/paper/barahonagroetscheljuengeretal1988.pdf} } difficult name @Article{ EC88, author = {Ehab S. El{-}Mallah and Charles J. Colbourn}, title = {The Complexity of Some Edge Deletion Problems}, journal = {\bibremark{No string.}IEEE Transactions on Circuits and Systems\bibremark{No publisher.}}, volume = {35}, number = {3}, pages = {354--362}, year = {1988}, doi = {10.1109/31.1748} } @Book{ NW88, author = {George L. Nemhauser and Laurence A. Wolsey}, title = {Integer and Combinatorial Optimization}, year = {1988}, publisher = publisher-wiley, series = series-wiley-dmo } @InProceedings{ PU88, author = {David Peleg and Eli Upfal}, title = {A Tradeoff between Space and Efficiency for Routing Tables}, booktitle = proc-stoc-88, pages = {43--52}, year = {1988}, publisher = publisher-acm, note = {Journal version appeared in } # journal-jacm-it } @Article{ ACP87, author = {Stefan Arnborg and Derek G. Corneil and Andrzej Proskurowski}, title = {Complexity of finding embeddings in a {$k$}-tree}, journal = {\bibremark{No string.}SIAM Journal on Algebraic Discrete Methods\bibremark{No publisher.}}, volume = {8}, pages = {277--284}, year = {1987} } @Article{ AH87, author = {Alberto Appostolico and Susanne E. Hambrusch}, title = {Finding maximum cliques on circular-arc graphs}, journal = journal-ipl, publisher = publisher-elsevier, volume = {26}, number = {4}, pages = {209--215}, year = {1987} } @Article{ FT87, author = {Michael L. Fredman and Robert E. Tarjan}, title = {Fibonacci heaps and their uses in improved network optimization algorithms}, journal = journal-jacm, publisher = publisher-acm, volume = {34}, number = {3}, pages = {596--615}, year = {1987}, doi = {10.1145/28869.28874} } @InCollection{ GJR87, author = {Martin Gr{\"o}tschel and Michael J{\"u}nger and Gerhard Reinelt}, title = {Calculating exact ground states of spin glasses: A polyhedral approach}, booktitle = {Heidelberg Colloquium on Glassy Dynamics}, series = {\bibremark{No string.}Lecture Notes in Physics}, volume = {275}, pages = {325--353}, publisher = publisher-springer, year = {1987} } @Article{ Kan87, author = {Ravi Kannan}, title = {Minkowski's convex body theorem and integer programming}, journal = {\bibremark{No string.}Mathematics of Operations Research\bibremark{No publisher.}}, volume = {12}, pages = {415--440}, year = {1987} } @Article{ KF87, author = {Sy-Ken Kuo and W. Kent Fuchs}, title = {Efficient spare allocation for reconfigurable arrays}, journal = {\bibremark{No string.}IEEE Design and Test\bibremark{No publisher.}}, volume = {4}, pages = {24--31}, year = {1987} } difficult name @Article{ LT87, author = {van Leeuwen, Jan and Richard B. Tan}, title = {Interval Routing}, journal = journal-computerjournal, publisher = publisher-oxford, volume = {30}, number = {4}, year = {1987}, pages = {298--307} } @TechReport{ MN87, author = {Rachel Manber and Giri Narasimhan}, title = {Algorithms for the maximum induced bipartite subgraph problem on interval and circular-arc graphs}, number = {696}, institution = {\bibremark{No string.}Computer Science Department, University of Wisconsin-Madison}, year = {1987}, myurl = {http://www.cs.wisc.edu/techreports/1987/TR696.pdf} } @TechReport{ Bod86, author = {Hans L. Bodlaender}, title = {Classes of graphs with bounded treewidth}, number = {RUU-CS-86-22}, institution = institution-utrechtcs, year = {1986} } @InProceedings{ FJ86, author = {Greg N. Frederickson and Ravi Janardan}, title = {Optimal Message Routing without Complete Routing Tables}, booktitle = proc-podc-86, year = {1986}, pages = {88--97} } @Article{ KM86, author = {Mirko K{\v{r}}iv{\'a}nek and Jaroslav Mor{\'a}vek}, title = {{NP}-Hard Problems in Hierarchical-Tree Clustering}, journal = journal-actainform, publisher = publisher-springer, volume = {23}, number = {3}, pages = {311--323}, year = {1986} } @Book{ LP86, author = {L{\'a}szl{\'o} Lov{\'a}sz and Michael D. Plummer}, title = {Matching Theory}, series = {\bibremark{No string.}Annals of Discrete Mathematics}, volume = {29}, publisher = publisher-northholland, year = {1986} } difficult name @InCollection{ LT86, author = {van Leeuwen, Jan and Richard B. Tan}, title = {Computer networks with compact routing tables}, booktitle = {The Book of {L}}, year = {1986}, pages = {259--273}, publisher = publisher-springer, editor = {Grzegorz Rozenberg and Arto K. Salomaa} } @Article{ Rob86, author = {John Michael Robson}, title = {Algorithms for maximum independent sets}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {7}, pages = {425--440}, year = {1986} } @Article{ RS86, author = {Neil Robertson and Paul D. Seymour}, title = {Graph Minors~{II}: Algorithmic Aspects of Tree-Width}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {7}, pages = {309--322}, year = {1986} } @Book{ Sch86, author = {Schrijver, Alexander}, title = {Theory of Linear and Integer Programming}, year = {1986}, publisher = publisher-wiley } @Article{ BE85, author = {Reuven Bar-Yehuda and Shimon Even}, title = {A local-ratio theorem for approximating the weighted vertex cover problem}, journal = {\bibremark{No string.}Annals of Discrete Mathematics\bibremark{No publisher.}}, volume = {25}, pages = {27--45}, year = {1985} } @Article{ BGM85, author = {Francisco Barahona and Martin Gr{\"o}tschel and Ali Ridha Mahjoub}, title = {Facets of the bipartite subgraph polytope}, journal = {\bibremark{No string.}Mathematics of Operations Research\bibremark{No publisher.}}, volume = {10}, pages = {340--358}, year = {1985}, myurl = {http://www.zib.de/groetschel/pubnew/paper/barahonagroetschelmahjoub1985.pdf} } @Article{ CV85, author = {Don Coppersmith and Uzi Vishkin}, title = {Solving {NP}-hard problems in `almost trees': Vertex cover}, journal = journal-discreteapplmath, volume = {10}, number = {1}, pages = {27--45}, publisher = publisher-elsevier, year = {1985}, doi = {10.1016/0166-218X(85)90057-5} } @Book{ Fis85, author = {Peter C. Fishburn}, title = {Interval Orders and Interval Graphs}, publisher = publisher-wiley, year = {1985} } @Article{ Kei85, author = {J. Mark Keil}, title = {Finding {H}amiltonian Circuits in Interval Graphs}, journal = journal-ipl, publisher = publisher-elsevier, volume = {20}, number = {4}, year = {1985}, pages = {201--206} } @Article{ Mon85, author = {Burkhard Monien}, title = {How to Find Long Paths Efficiently}, journal = {\bibremark{No string.}Annals of Discrete Mathematics\bibremark{No publisher.}}, volume = {25}, pages = {239--254}, year = {1985} } @Article{ MS85, author = {Burkhard Monien and Ewald Speckenmeyer}, title = {Ramsey numbers and an approximation algorithm for the vertex cover problem}, journal = journal-actainform, publisher = publisher-springer, volume = {22}, pages = {115--123}, year = {1985} } @Article{ NP85, author = {J. Ne{\v{s}}et{\v{r}}il and S. Poljak}, title = {On the complexity of the subgraph problem}, journal = {\bibremark{No string.}Commentationes Mathematicae Universitatis Carolinae\bibremark{No publisher.}}, volume = {26}, number = {2}, pages = {415--419}, year = {1985} } @Article{ SK85, author = {Nicola Santoro and Ramez Khatib}, title = {Labelling and implicit routing in networks}, journal = journal-computerjournal, publisher = publisher-oxford, year = {1985}, volume = {28}, number = {1}, pages = {5--8} } @Article{ TY85, author = {Robert E. Tarjan and Mihalis Yannakakis}, title = {Addendum: Simple linear-time algorithms to test chordality of graphs, text acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs}, journal = journal-siamjcomput, publisher = publisher-siam, year = {1985}, volume = {14}, pages = {254--255} } @Article{ Vel85, author = {Marinus Veldhorst}, title = {Approximation of the Consecutive Ones Matrix Augmentation Problem}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {14}, number = {3}, year = {1985}, pages = {709--729} } @Article{ WLS85, author = {Ching-Chy Wang and Errol L. Lloyd and Mary Lou Soffa}, title = {Feedback vertex sets and cyclically reducible graphs}, journal = journal-jacm, publisher = publisher-acm, year = {1985}, volume = {32}, number = {2}, pages = {296--313} } @Article{ Yan85, author = {Mihalis Yannakakis}, title = {A polynomial algorithm for the min-cut linear arrangement of trees}, journal = journal-jacm, publisher = publisher-acm, volume = {32}, number = {4}, pages = {950--988}, year = {1985} } @Article{ AC84, author = {Michael O. Albertson and Karen L. Collins}, title = {Duality and perfection for edges in cliques}, journal = journal-jcombintheoryB, publisher = publisher-elsevier, volume = {36}, number = {3}, pages = {298--309}, year = {1984} } @Article{ GN84, author = {Martin Gr{\"o}tschel and George L. Nemhauser}, title = {A polynomial algorithm for the max-cut problem on graphs without long odd cycles}, journal = journal-mathprogram, publisher = publisher-springer, volume = {29}, number = {1}, pages = {28--40}, year = {1984}, doi = {10.1007/BF02591727} } @InProceedings{ Kar84, author = {Narendra Karmarkar}, title = {A New Polynomial-Time Algorithm for Linear Programming}, booktitle = proc-stoc-84, year = {1984}, pages = {302--311}, publisher = publisher-acm } @Book{ Meh84, author = {Kurt Mehlhorn}, title = {Data Structures and Algorithms, Volume~2: {NP}-Completeness and Graph Algorithms}, series = {\bibremark{No string.}{EATCS} Monographs on Theoretical Computer Science}, publisher = publisher-springer, year = {1984} } @Book{ Pea84, author = {Judea Pearl}, title = {Heuristics}, publisher = publisher-addisonwesley, year = {1984} } @Article{ Ser84, author = {A. I. Serdyukov}, title = {An algorithm with an estimate for the travelling salesman problem of the maximum}, journal = {\bibremark{No string.}Upravlyaemye Sistemy\bibremark{No publisher.}}, volume = {25}, pages = {80--86}, year = {1984}, note = {In Russian language} } @Article{ TY84, author = {Robert E. Tarjan and Mihalis Yannakakis}, title = {Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {13}, number = {3}, pages = {566--579}, year = {1984} } @Article{ Bar83, author = {Francisco Barahona}, title = {The max-cut problem on graphs not contractible to~{$K_5$}}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {2}, number = {3}, pages = {107--111}, year = {1983}, doi = {10.1016/0167-6377(83)90016-0} } @Article{ Len83, author = {Hendrik W. Lenstra}, title = {Integer Programming with a Fixed Number of Variables}, journal = {\bibremark{No string.}Mathematics of Operations Research\bibremark{No publisher.}}, volume = {8}, pages = {538--548}, year = {1983} } difficult name @TechReport{ LT83, author = {van Leeuwen, Jan and Richard B. Tan}, title = {Routing with Compact Routing Tables}, institution = institution-utrechtcs, year = {1983}, number = {RUU-CS-83-16}, note = {Appeared also as Computer Networks with Compact Routing Tables in Grzegorz Rozenberg and Arto K. Salomaa (Eds.), The Book of L, Springer, 1986} } @InProceedings{ AH82, author = {Takao Asano and Tomio Hirata}, title = {Edge-deletion and edge-contraction problems}, booktitle = proc-stoc-82, pages = {245--254}, publisher = publisher-acm, year = {1982}, doi = {10.1145/800070.802198} } @Article{ Bar82, author = {Francisco Barahona}, title = {On the computational complexity of {Ising} spin glass models}, journal = {\bibremark{No string.}Journal of Physics~A: Mathematics and General\bibremark{No publisher.}}, volume = {15}, number = {3241--3253}, year = {1982}, doi = {10.1088/0305-4470/15/10/028} } @Article{ Lic82, author = {David Lichtenstein}, title = {Planar Formulae and Their Uses}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {11}, number = {2}, pages = {329--343}, year = {1982} } @MastersThesis{ Lub82, author = {A. Lubiw}, title = {{$\Gamma$}-free matrices}, school = institution-waterlooco, year = {1982} } @Article{ MT82, author = {Nimrod Megiddo and Arie Tamir}, title = {On the complexity of locating linear facilities in the plane}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {1}, pages = {194--197}, year = {1982} } @Book{ PS82, author = {Christos H. Papadimitriou and Kenneth Steiglitz}, title = {Combinatorial Optimization: Algorithms and Complexity}, year = {1982}, publisher = publisher-prenticehall } @TechReport{ SK82, author = {Nicola Santoro and Ramez Khatib}, title = {Routing Without Routing Tables}, institution = institution-carletoncs, year = {1982}, number = {SCS-TR-6} } @Article{ Skr82, author = {Dale J. Skrien}, title = {A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs}, journal = journal-jgraphtheory, publisher = publisher-wiley, pages = {309--316}, volume = {6}, year = {1982} } @Article{ ASSU81, author = {Alfred V. Aho and Yehoshua Sagiv and Thomas G. Szymanski and Jeffrey D. Ullman}, title = {Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions}, journal = journal-siamjcomput, volume = {10}, number = {3}, pages = {405--421}, publisher = publisher-siam, year = {1981} } difficult name @Article{ BE81, author = {Reuven Bar{-}Yehuda and Shimon Even}, title = {A linear-time approximation algorithm for the weighted vertex cover problem}, journal = journal-jalgorithms, publisher = publisher-elsevier, volume = {2}, pages = {198--203}, year = {1981} } @Article{ GP81, author = {Martin Gr{\"o}tschel and William R. Pulleyblank}, title = {Weakly bipartite graphs and the Max-cut problem}, journal = journal-operreslett, publisher = publisher-elsevier, volume = {1}, number = {1}, pages = {23--27}, year = {1981}, doi = {10.1016/0167-6377(81)90020-1} } @Article{ LP81, author = {Lipski, Jr., Witold and Franco P. Preparata}, title = {Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems}, journal = journal-actainform, publisher = publisher-springer, volume = {15}, year = {1981}, pages = {329--346} } @conference{ MS81, author = {Burkhard Monien and R. Schulz}, title = {Four approximation algorithms for the feedback vertex set problem}, booktitle = proc-wg-81, pages = {315--326}, publisher = publisher-hanser, year = {1981} } @Article{ SS81, author = {Richard Schroeppel and Adi Shamir}, title = {A {$T=O(2^{n/2})$}, {$S=O(2^{n/4})$} algorithm for certain {NP}-complete problems}, journal = journal-siamjcomput, volume = {10}, number = {3}, pages = {456--464}, publisher = publisher-siam, year = {1981} } @Article{ Yan81, author = {Mihalis Yannakakis}, title = {Edge-Deletion Problems}, journal = journal-siamjcomput, volume = {10}, number = {2}, pages = {297--309}, publisher = publisher-siam, year = {1981}, doi = {10.1137/0210021} } @Article{ ADP80, author = {Giorgio Ausiello and Alessandro D'Atri and Marco Protasi}, title = {Structure Preserving Reductions among Convex Optimization Problems}, journal = journal-jcss, volume = {21}, number = {1}, pages = {136--153}, publisher = publisher-elsevier, year = {1980} } @Article{ BOR80, author = {Bartholdi, {III}, John J. and James B. Orlin and H. Donald Ratliff}, title = {Cyclic Scheduling via Integer Programs with Circular Ones}, journal = journal-operres, publisher = publisher-informs, volume = {28}, number = {5}, pages = {1074--1085}, year = {1980} } @TechReport{ Bar80, author = {Francisco Barahona}, title = {On the Complexity of Max Cut}, number = {186}, institution = {\bibremark{No string.}IMAG, Universit{\'e} Joseph Fourier, Grenoble, France}, year = {1980} } @Article{ GJMP80, author = {Michael J. Garey and David S. Johnson and Gary L. Miller and Christos H. Papadimitriou}, title = {The complexity of coloring circular arcs and chords}, journal = journal-siamjmethods # {\bibremark{No publisher.}}, volume = {1}, pages = {216--227}, year = {1980} } @Book{ Gol80, author = {Martin C. Golumbic}, title = {Algorithmic graph theory and perfect graphs}, publisher = publisher-academic, year = {1980} } rather TechReport? @Article{ Kar80, author = {A. Karapetjan}, title = {Coloring of arc graphs}, journal = {\bibremark{No string.}Reports of the Academy of Science of the Armenian Soviet Socialist Republic\bibremark{No publisher.}}, volume = {70}, number = {5}, pages = {306--311}, note = {In Russian} } @Article{ LT80, author = {Lipton, R. J. and Robert E. Tarjan}, title = {Applications of a planar separator theorem}, journal = journal-siamjcomput, volume = {9}, number = {3}, pages = {615--627}, publisher = publisher-siam, year = {1980} } @Article{ LY80, author = {John M. Lewis and Mihalis Yannakakis}, title = {The node-deletion problem for hereditary properties is {NP}-complete}, journal = journal-jcss, volume = {20}, number = {2}, pages = {219--230}, publisher = publisher-elsevier, year = {1980}, doi = {10.1016/0022-0000(80)90060-4} } @Article{ Tuc80, author = {Alan C. Tucker}, title = {An Efficient Test for Circular-Arc Graphs}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {9}, number = {1}, year = {1980}, pages = {1--24} } @Article{ APT79, author = {Bengt Aspvall and Michael F. Plass and Robert Endre Tarjan}, title = {A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas}, journal = journal-ipl, publisher = publisher-elsevier, year = {1979}, volume = {8}, pages = {121--123} } @Book{ HU79, author = {John E. Hopcroft and Jeffrey D. Ullman}, title = {Introduction to Automata Theory, Languages, and Computation}, publisher = publisher-addisonwesley, year = {1979} } @Book{ GJ79, author = {Michael R. Garey and David S. Johnson}, title = {Computers and Intractability: A Guide to the Theory of {NP}-Completeness}, publisher = publisher-freeman, year = {1979} } @Article{ Opa79, author = {Jaroslav Opatrny}, title = {Total Ordering Problem}, journal = journal-siamjcomput, volume = {8}, number = {1}, pages = {111--114}, publisher = publisher-siam, year = {1979} } difficult name @Article{ GS78, author = {Joachim von{ }zur Gathen and Malte Sieveking}, title = {A bound on solutions of linear integer equations and inequalities}, journal = journal-procams, publisher = publisher-ams, volume = {72}, pages = {155--158}, year = {1978} } @Article{ IR78, author = {Alon Itai and Michael Rodeh}, title = {Finding a minimum circuit in a graph}, journal = journal-siamjcomput, publisher = publisher-siam, year = {1978}, volume = {7}, number = {4}, pages = {413--423} } @InCollection{ KM78, author = {Ravindran Kannan and C. L. Monma}, title = {On the computational complexity of integer programming problems}, booktitle = {Optimization and Operations Research}, editor = {R. Henn and B. Korte and W. Oettli}, series = series-springer-lectnoteseconmathsyst, publisher = publisher-springer, year = {1978}, volume = {157}, pages = {161--172} } @Article{ KSW78, author = {Lawrence T. Kou and Larry J. Stockmeyer and Chak-Kuen Wong}, title = {Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs}, journal = {\bibremark{No string.}Communications of the ACM\bibremark{No publisher.}}, volume = {21}, number = {2}, pages = {135--139}, year = {1978} } @InProceedings{ Lew78, author = {John M. Lewis}, title = {On the complexity of the Maximum Subgraph Problem}, booktitle = proc-stoc-78, pages = {265--274}, publisher = publisher-acm, year = {1978}, doi = {10.1145/800133.804356} } @Article{ SF78, author = {Stephen B. Seidman and Brian L. Foster}, title = {A graph-theoretic generalization of the clique concept}, journal = {\bibremark{No string.}Journal of Mathematical Sociology\bibremark{No publisher.}}, volume = {6}, pages = {139--154}, year = {1978}, xmyurl = {http://aris.ss.uci.edu/~lin/65.pdf} } @InProceedings{ Sch78, author = {T. J. Schaefer}, title = {The complexity of satisfiability problems}, booktitle = proc-stoc-78, pages = {216--226}, publisher = publisher-acm, year = {1978} } @Unpublished{ Tru78, author = {Klaus Truemper}, title = {On balanced matrices and {T}utte's characterization of regular matroids}, note = {Manuscript}, year = {1978} } @Article{ AH77I, author = {K. Appel and W. Haken}, title = {Every planar map is four colorable. {I}.~Discharging}, journal = {\bibremark{No string.}Illinois J. Math.\bibremark{No publisher.}}, volume = {21}, pages = {429--490}, year = {1977} } @Article{ AH77II, author = {K. Appel and W. Haken}, title = {Every planar map is four colorable. {II}.~Reducibility}, journal = {\bibremark{No string.}Illinois J. Math.\bibremark{No publisher.}}, volume = {21}, pages = {491--567}, year = {1977} } difficult name @Article{ Emd77, author = {van Emde{ }Boas, Peter}, title = {Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space}, journal = journal-ipl, publisher = publisher-elsevier, volume = {6}, number = {3}, year = {1977}, pages = {80--82} } @Article{ Fis77, author = {Peter C. Fishburn}, title = {Condorcet social choice functions}, journal = {\bibremark{No string.}SIAM Journal on Applied Mathematics\bibremark{No publisher.}}, volume = {33}, number = {3}, pages = {469--489}, year = {1977} } @article{ GJ77, author = {Michael R. Garey and David S. Johnson}, title = {The Rectilinear Steiner Tree Problem is {NP}-Complete}, journal = {\bibremark{No string.}SIAM Journal of Applied Mathematics}, volume = {32}, year = {1977}, pages = {826--834} } @Article{ HS77, author = {James W. Hunt and Thomas G. Szymanski}, title = {A fast algorithm for computing longest common subsequences}, journal = {\bibremark{No string.}Communications of the ACM\bibremark{No publisher.}}, volume = {20}, number = {5}, pages = {350--353}, year = {1977}, doi = {10.1145/359581.359603} } @Article{ KK77, author = {Leonard Kleinrock and Farouk Kamoun}, title = {Hierarchical Routing for Large Networks; Performance Evaluation and Optimization}, journal = {\bibremark{No string.}Computer Networks\bibremark{No publisher.}}, volume = {1}, year = {1977}, pages = {155--174} } @Article{ Kou77, author = {Lawrence T. Kou}, title = {Polynomial Complete Consecutive Information Retrieval Problems}, journal = journal-siamjcomput, publisher = publisher-siam, volume = {6}, number = {1}, year = {1977}, pages = {67--75} } @Article{ Orl77, author = {James B. Orlin}, title = {Contentment in Graph Theory: Covering Graphs with Cliques}, journal = {\bibremark{No string.}Indagationes Mathematicae (Proceedings)\bibremark{No publisher.}}, volume = {80}, number = {5}, pages = {406--424}, year = {1977} } @Article{ BL76, author = {Kellogg S. Booth and George S. Lueker}, title = {Testing for the consecutive ones property, interval graphs, and graph planarity using {PQ}-tree algorithms}, journal = journal-jcss, publisher = publisher-elsevier, year = {1976}, volume = {13}, pages = {335--379}, } @Article{ BT76, author = {I. Borosh and L. B. Treybig}, title = {Bounds on positive integral solutions of linear {D}iophantine equations}, journal = journal-procams, publisher = publisher-ams, year = {1976}, volume = {55}, number = {2}, pages = {299--304}, } @Article{ GJS76, author = {Michael R. Garey and David S. Johnson and Larry J. Stockmeyer}, title = {Some simplified {NP}-complete graph problems}, journal = journal-tcs, publisher = publisher-elsevier, volume = {1}, number = {3}, pages = {237--267}, year = {1976}, issn = {0304-3975}, mymonth = {feb} } difficult name @Unpublished{ GS76, author = {Joachim von{ }zur Gathen and Malte Sieveking}, title = {A bound on solutions of linear integer programs}, year = {1976}, note = {Manuscript} } @Article{ FNT75, author = {Delbert R. Fulkerson and George L. Nemhauser and Leslie E. Trotter}, title = {Two Computationally Difficult Set-Covering Problems That Arise in Computing the 1-Width of Incidence Matrices of {S}teiner Triple Systems}, journal = journal-mathprogramstudy, publisher = publisher-northholland, myeditor = {M. L. Balinski}, volume = {2}, pages = {72--82}, year = {1975} } @Article{ Fre75, author = {Michael L. Fredman}, title = {On computing the length of longest increasing subsequences}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {11}, number = {1}, pages = {29--35}, year = {1975} } @Article{ Had75, author = {Frank O. Hadlock}, title = {Finding a Maximum Cut of a Planar Graph in Polynomial Time}, journal = journal-siamjcomput, volume = {4}, number = {3}, pages = {221--225}, publisher = publisher-siam, year = {1975}, doi = {10.1137/0204019} } @article{ LLS75, author = {Richard E. Ladner and Nancy A. Lynch and Alan L. Selman}, title = {A Comparison of Polynomial Time Reducibilities}, journal = journal-tcs, publisher = publisher-springer, volume = {1}, number = {2}, year = {1975}, pages = {103--123} } @Article{ Lov75, author = {Laszlo Lov{\`a}sz}, title = {On the ratio of optimal fractional and integral covers}, journal = journal-discretemath, publisher = publisher-elsevier, volume = {13}, pages = {383--390}, year = {1975} } @Article{ NT75, author = {George L. Nemhauser and Leslie E. Trotter}, title = {Vertex packings: Structural properties and algorithms}, journal = journal-mathprogram, publisher = publisher-springer, volume = {8}, pages = {232--248}, year = {1975} } @Book{ AHU74, author = {Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman}, title = {The Design and Analysis of Computer Algorithms}, publisher = publisher-addisonwesley, year = {1974} } @Article{ FHO74, author = {Delbert R. Fulkerson and Alan J. Hoffman and Rosa Oppenheim}, title = {On balanced matrices}, journal = journal-mathprogramstudy, publisher = publisher-northholland, volume = {1}, pages = {120--132}, year = {1974} } @Article{ Gav74, author = {Fanica Gavril}, title = {Algorithms on circular-arc graphs}, journal = journal-networks, publisher = publisher-wiley, volume = {4}, pages = {357--369}, year = {1974} } @Article{ HS74, author = {Ellis Horowitz and Sartaj Sahni}, title = {Computing Partitions with Applications to the {K}napsack Problem}, journal = journal-jacm, publisher = publisher-acm, volume = {21}, number = {2}, pages = {277--292}, year = {1974} } @Article{ Joh74, author = {David S. Johnson}, title = {Approximation Algorithms for Combinatorial Problems}, journal = journal-jcss, publisher = publisher-elsevier, volume = {9}, number = {3}, year = {1974}, pages = {256--278} } @inproceedings{ LLS74, author = {Richard E. Ladner and Nancy A. Lynch and Alan L. Selman}, title = {Comparisons of Polynomial-Time Reducibilities}, booktitle = proc-stoc-74, publisher = publisher-acm, year = {1974}, pages = {110--121} } @Article{ BK73, author = {Coen Bron and Joep Kerbosch}, title = {Algorithm~457: finding all cliques of an undirected graph}, journal = {\bibremark{No string.}Communications of the ACM\bibremark{No publisher.}}, volume = {16}, number = {9}, pages = {575--577}, year = {1973} } @InProceedings{ GHK73, author = {Don L. Greenwell and Robert L. Hemminger and Joseph B. Klerlein}, title = {Forbidden subgraphs}, booktitle = {\bibremark{No string.}Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing\bibremark{No publisher.}}, pages = {389--394}, year = {1973} } @Article{ HT73, author = {John E. Hopcroft and Robert E. Tarjan}, title = {Dividing a Graph into Triconnected Components}, journal = journal-siamjcomput, volume = {2}, number = {3}, pages = {135--158}, publisher = publisher-siam, year = {1973} } @Article{ Kel73, author = {E. Kellerman}, title = {Determination of keyword conflict}, journal = {\bibremark{No string.}IBM Technical Disclosure Bulletin\bibremark{No publisher.}}, volume = {16}, number = {2}, pages = {544--546}, year = {1973} } @Article{ Ber72, author = {Claude Berge}, title = {Balanced matrices}, journal = journal-mathprogram, publisher = publisher-springer, volume = {2}, pages = {19--31}, year = {1972} } @Article{ DW72, author = {Stuart E. Dreyfus and Robert A. Wagner}, title = {The {S}teiner problem in graphs}, journal = {\bibremark{No string.}Networks\bibremark{No publisher.}}, volume = {1}, number = {3}, pages = {195--207}, year = {1972} } @Article{ EK72, author = {Jack Edmonds and Richard M. Karp}, title = {Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems}, journal = journal-jacm, publisher = publisher-acm, volume = {19}, number = {2}, pages = {248--264}, year = {1972}, doi = {10.1145/321694.321699} } @InCollection{ Kar72, author = {Richard M. Karp}, title = {Reducibility Among Combinatorial Problems}, booktitle = {Complexity of Computer Computations}, editor = {Raymond E. Miller and James W. Thatcher}, pages = {85--103}, publisher = publisher-plenum, year = {1972} } @Article{ OD72, author = {G. I. Orlova and Ya. G. Dorfman}, title = {Finding the Maximum Cut in a Graph (in {Russian})}, journal = {\bibremark{No string.}Tekhnicheskaja Kibernetika\bibremark{No publisher.}}, volume = {3}, pages = {155--159}, year = {1972}, note = {English translation in \bibremark{No string.}\textit{Engineering Cybernetics}, 10:502--506, 1972} } @Article{ Tuc72, author = {Alan C. Tucker}, title = {A structure theorem for the consecutive 1's property}, journal = journal-jcombintheoryB, publisher = publisher-elsevier, volume = {12}, year = {1972}, pages = {153--162} } @InProceedings{ Coo71, author = {Stephen A. Cook}, title = {The Complexity of Theorem-Proving Procedures}, booktitle = proc-stoc-71, year = {1971}, pages = {151--158}, publisher = publisher-acm } @Article{ Moo71, author = {John W. Moon}, title = {On maximal transitive subtournaments}, journal = {\bibremark{No string.}Proceedings of the Edinburgh Mathematical Society\bibremark{No publisher.}}, volume = {17}, pages = {345--349}, year = {1971} } @Article{ Tuc71, author = {Alan C. Tucker}, title = {Matrix Characterizations of Circular-Arc Graphs}, journal = journal-pacificjmath, publisher = publisher-mathsciencesberkeley, number = {39}, volume = {2}, year = {1971}, pages = {535--545} } @InCollection{ Ber70, author = {Claude Berge}, title = {Sur certains hypergraphes g{\'e}n{\'e}ralisant les graphes bipartites}, booktitle = {\bibremark{No string.}Combinatorial Theory and its Applications~I (\bibremark{No string.}Proceedings of the Colloquium on Combinatorial Theory and its Applications,~1969)}, editor = {Paul Erd{\H{o}}s and Alfr{\'e}d Rh{\'e}nyi and Vera T. S{\'o}s}, pages = {119--133}, publisher = publisher-northholland, year = {1970} } @Article{ Din70, author = {Efim A. Dinic}, title = {Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation (in {Russian})}, journal = {\bibremark{No string.}Doklady Akademii Nauk SSSR\bibremark{No publisher.}}, volume = {194}, number = {4}, year = {1970}, note = {English translation in \bibremark{No string.}\textit{Soviet Mathematics Doklady}, 11:1277--1280, 1970}, myurl = {http://www.cs.bgu.ac.il/~dinitz/D70.pdf} } @InCollection{ Rob69, author = {Fred. S. Roberts}, title = {Indifference graphs}, booktitle = {Proof Techniques in Graph Theory}, editor = {Frank Harary}, pages = {139--146}, publisher = publisher-academic, year = {1969} } @InProceedings{ Gal68, author = {Tibor Gallai}, title = {On directed paths and circuits}, booktitle = {\bibremark{No string.}Theory of Graphs: Proceedings of the Colloquium in Tihnay}, myeditor = {Paul Erd{\H{o}}s and Gyula Katona}, publisher = publisher-academic, pages = {115--118}, year = {1968} } @PhDThesis{ Rob68, author = {Fred. S. Roberts}, title = {Representations of Indifference Relations}, school = institution-stanford, year = {1968} } @Article{ Glo67, author = {F. Glover}, title = {Maximum matching in convex bipartite graphs}, journal = journal-navalreslogist, publisher = publisher-wiley, volume = {14}, pages = {313--316}, year = {1967} } @Article{ EGP66, author = {Paul Erd{\H{o}}s and Adolph W. Goodman and Louis P{\'o}sa}, title = {The representation of a graph by set intersections}, journal = {\bibremark{No string.}Canadian Journal of Mathematics\bibremark{No publisher.}}, volume = {18}, pages = {106--112}, year = {1966} } @Article{ FG65, author = {Delbert R. Fulkerson and O. A. Gross}, title = {Incidence Matrices and Interval Graphs}, journal = journal-pacificjmath, publisher = publisher-mathsciencesberkeley, volume = {15}, number = {3}, year = {1965}, pages = {835--855} } @Article{ Gim65, author = {James F. Gimpel}, title = {A Reduction Technique for Prime Implicant Tables}, journal = {\bibremark{No string.}IEEE Transactions on Electronic Computers\bibremark{No publisher.}}, volume = {EC-14}, pages = {535--541}, year = {1965} } @Article{ Kas63, author = {Pieter W. Kasteleyn}, title = {Dimer Statistics and Phase Transitions}, journal = {\bibremark{No string.}Journal of Mathematical Physics\bibremark{No publisher.}}, volume = {4}, number = {2}, pages = {287--293}, year = {1963}, doi = {10.1063/1.1703953} } @Article{ Bel62, author = {Richard Bellman}, title = {Dynamic Programming Treatment of the Travelling Salesman Problem}, journal = journal-jacm, publisher = publisher-acm, volume = {9}, number = {1}, pages = {61--63}, year = {1962}, doi = {10.1145/321105.321111} } @Article{ DLL62, author = {Martin Davis and George Logemann and Donald W. Loveland}, title = {A machine program for theorem-proving}, journal = {\bibremark{No string.}Communications of the ACM\bibremark{No publisher.}}, volume = {5}, number = {7}, pages = {394--397}, year = {1962} } @Article{ EP62, author = {Paul Erd\H{o}s and Louis P\'osa}, title = {On the maximal number of disjoint circuits of a graph}, journal = {\bibremark{No string.}Publicationes Mathematicae Debrecen\bibremark{No publisher.}}, year = {1962}, volume = {9}, pages = {3--12} } difficult name @Article{ Gho62, author = {Alain Ghouila{-}Houri}, title = {Caract{\'e}risation des matrices totalement unimodulaires}, journal = journal-comptesrendus, publisher = publisher-elsevier, year = {1962}, volume = {254}, pages = {1192--1194} } @Article{ HK62, author = {Michael Held and Richard M. Karp}, title = {A Dynamic Programming Approach to Sequencing Problems}, journal = {\bibremark{No string.}Journal of the Society for Industrial and Applied Mathematics}, volume = {10}, number = {1}, pages = {196--210}, publisher = publisher-siam, year = {1962}, doi = {10.1137/0110015} } @Article{ LB62, author = {C. G. Lekkerkerker and J. Ch. Boland}, title = {Representation of a finite graph by a set of intervals on the real line}, journal = journal-fundmath, publisher = publisher-impan, volume = {51}, pages = {45--64}, year = {1962} } @Article{ VW62I, author = {Arthur F. Veinott and H. M. Wagner}, title = {Optimal capacity scheduling---{I}}, journal = journal-operres, publisher = publisher-informs, year = {1962}, volume = {10}, pages = {518--532} } @Article{ VW62II, author = {Arthur F. Veinott and H. M. Wagner}, title = {Optimal capacity scheduling---{II}}, journal = journal-operres, publisher = publisher-informs, year = {1962}, volume = {10}, pages = {533--47} } @Article{ VW62IandII, author = {Arthur F. Veinott and H. M. Wagner}, title = {Optimal capacity scheduling, {P}arts~{I} and~{II}}, journal = journal-operres, publisher = publisher-informs, year = {1962}, volume = {10}, pages = {518--547} } @Article{ VW62, author = {Arthur F. Veinott and H. M. Wagner}, title = {Optimal capacity scheduling}, journal = journal-operres, publisher = publisher-informs, year = {1962}, volume = {10}, pages = {518--547} } @Article{ Sla61, author = {Patrick Slater}, title = {Inconsistencies in a schedule of paired comparisons}, journal = {\bibremark{No string.}Biometrika\bibremark{No publisher.}}, year = {1961}, volume = {48}, pages = {303--312} } @Article{ Ben59, author = {Seymour Benzer}, title = {On the topology of the genetic fine structure}, journal = journal-procnatlacadusa, publisher = publisher-natlacadusa, volume = {45}, year = {1959}, pages = {1607--1620} } @Article{ Har59, author = {Frank Harary}, title = {On the Measurement of Structural Balance}, journal = {\bibremark{No string.}Behavioral Science\bibremark{No publisher.}}, volume = {4}, number = {4}, pages = {316--323}, year = {1959} } @InProceedings{ Moo59, author = {Edward F. Moore}, title = {The shortest path through a maze}, booktitle = {\bibremark{No string.}Proceedings of the International Symposium on the Theory of Switching}, year = {1959}, publisher = publisher-harvard, pages = {285--292} } @Article{ Bel58, author = {Richard Bellmann}, title = {On a Routing Problem}, journal = {\bibremark{No string.}Quarterly of Applied Mathematics\bibremark{No publisher.}}, volume = {16}, issue = {1}, pages = {87--90}, year = {1958} } @Article{ Haj57, author = {G. Haj{\"o}s}, title = {{\"U}ber eine {A}rt von {G}raphen}, myjournal = journal-internatmathnews, journal = journal-internatmathnews # {\bibremark{No pages.}\textnormal{, 11, Problem~65}}, publisher = publisher-oemg, myvolume = {11~}, mynumber = {\bibremark{Abused number entry.}Problem~65}, year = {1957}, note = {In German language} } @Article{ EFS56, author = {Peter Elias and Amiel Feinstein and Claude E. Shannon}, title = {A note on the maximum flow through a network}, journal = {\bibremark{No string.}IEEE Transactions on Information Theory\bibremark{No publisher.}}, volume = {2}, number = {4}, pages = {117--119}, year = {1956} } @Article{ FF56, author = {Delbert R. Fulkerson and Ford, Jr., Lester R.}, title = {Maximal Flow Through a Network}, journal = {\bibremark{No string.}Canadian Journal of Mathematics\bibremark{No publisher.}}, volume = {8}, pages = {399--404}, year = {1956} } @TechReport{ For56, author = {Ford, Jr., Lester R.}, title = {Network flow theory}, number = {Paper P-923}, institution = institution-rand, year = {1956} } @InCollection{ HK56, author = {Alan J. Hoffman and Joseph B. Kruskal}, title = {Integral boundary points of convex polyhedra}, booktitle = {Linear Inequalities and Related Systems}, editor = {H. W. Kuhn and A. W. Tucker}, pages = {223--246}, publisher = publisher-princeton, year = {1956} } @Article{ Har53, author = {Frank Harary}, title = {On the notion of balance of a signed graph}, journal = {\bibremark{No string.}Michigan Mathematical Journal\bibremark{No publisher.}}, volume = {2}, number = {2}, pages = {143--146}, year = {1953}, doi = {10.1307/mmj/1028989917} } @Book{ Kon36, author = {D{\'e}nes K{\H{o}}nig}, title = {Theorie der endlichen und unendlichen Graphen}, publisher = {Akademische Verlagsgesellschaft, Leipzig}, year = {1936}, note = {English translation: \bibremark{No string.}\textit{Theory of finite and infinite graphs}, Birkh{\"a}user, 1990} } % ---------------------------------------------------------------------- % Unused code: % % How to switch from long to short versions of the titles of % proceedings, journals, publishers, or series % by defining commands in the LaTeX file (\usepackage{ifthen} is needed): % % Preamble{ { % \providecommand{\ifthenelse}[3]{} % \newcommand{\bibprocl}[1]{#1} % \newcommand{\bibprocs}[1]{} % \newcommand{\bibjournall}[1]{#1} % \newcommand{\bibjournals}[1]{} % \newcommand{\bibpublisherl}[1]{#1} % \newcommand{\bibpublishers}[1]{} % \newcommand{\bibseriesl}[1]{#1} % \newcommand{\bibseriess}[1]{} % \ifthenelse{\NOT \isundefined{\bibprocshort} \OR \NOT \isundefined{\biballshort}} % {\renewcommand{\bibprocl}[1]{} % \renewcommand{\bibprocs}[1]{#1}} % {} % \ifthenelse{\NOT \isundefined{\bibjournalshort} \OR \NOT \isundefined{\biballshort}} % {\renewcommand{\bibjournall}[1]{} % \renewcommand{\bibjournals}[1]{#1}} % {} % \ifthenelse{\NOT \isundefined{\bibpublishershort} \OR \NOT \isundefined{\biballshort}} % {\renewcommand{\bibpublisherl}[1]{} % \renewcommand{\bibpublishers}[1]{#1}} % {} % \ifthenelse{\NOT \isundefined{\bibseriesshort} \OR \NOT \isundefined{\biballshort}} % {\renewcommand{\bibseriesl}[1]{} % \renewcommand{\bibseriess}[1]{#1}} % {} % } } % % Usage in the BibTeX file: % string{proc-test-08-long = {\bibprocl{Proceedings of a test (TEST~'08)}}} % string{proc-test-08-short = {\bibprocs{Proc.\ 1st~TEST}}} % string{proc-test-08 = proc-test-08-long # proc-test-08-short} % % Usage in the LaTeX file: % \newcommand{\biballshort}{} % switch to short titles of proceedings, journals, publishers, and series % \newcommand{\bibprocshort}{} % switch to short proceeding titles % \newcommand{\bibjournalshort}{} % switch to short journal titles % \newcommand{\bibpublishershort}{} % switch to short publisher names % \newcommand{\bibseriesshort}{} % switch to short series titles % ---------------------------------------------------------------------- % Unused string definitions ("string" commands without "at"-symbol are deactivated). % These definitions are copy-and-pasted from somebody's bibfile. DO NOT USE WITHOUT CHECKING! string{proc-afips-70 = {Proceedings of the Fall Joint Compute Conference, AFIPS Conference}} string{proc-algosensors-04 = {Proceedings of the 1st Intl. Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS~'04)}} string{proc-amwg-02 = {Workshop on Algorithms and Models for the Web Graph}} string{proc-bcc-79 = {Proceedings of the 7th British Combinatorial Conference}} string{proc-ccn-02 = {Proceedings of the IASTED International Conference on Communications and Computer Networks}} string{proc-ccss-72 = {Courant Computer Science Symposium~9: Combinatorial Algorithms (1972)}} string{proc-cec-03 = {Proceedings of the IEEE Conference on E-Commerce (CEC~'03)}} string{proc-dcoss-05 = {Proceedings of the 1st International Conference on Distributed Computing in Sensor Systems}} string{proc-dialm-99 = {Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M~'99)}} string{proc-dialm-01 = {Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M~'01)}} string{proc-dialm-02 = {Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M~'02)}} string{proc-dialmpomc-03 = {Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC~'03)}} string{proc-dialmpomc-04 = {Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC~'04)}} string{proc-dialmpomc-05 = {Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (DIALM-POMC~'05)}} string{proc-ec-00 = {Proceedings of the 2nd ACM conference on Electronic Commerce (EC~'00)}} string{proc-ec-05 = {Proceedings of the 6th ACM conference on Electronic Commerce (EC~'05)}} string{proc-ew-02 = {Proceedings of the 4th European Wireless Conference (EW~'02)}} string{proc-ewcg-05 = {Proceedings of the 21st European Workshop on Computational Geometry (EWCG~'05)}} string{proc-gd-00 = {Proceedings of the 8th International Symposium on Graph Drawing (GD~'00)}} string{proc-gd-04 = {Proceedings of the 12th International Symposium on Graph Drawing (GD~'04)}} string{proc-globecom-01 = {IEEE GLOBECOM~'01}} string{proc-globecom-96 = {IEEE GLOBECOM~'96}} string{proc-gttc = {Proceedings of The International Conference on Graph Theory and Topology in Chemistry}} string{proc-hicss-99 = {Proceedings of the 32nd Hawaii International Conference on System Sciences (HICSS~'99)}} string{proc-hicss-00 = {Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS~'00)}} string{proc-icc-04 = {Proceedings of the IEEE International Conference on Communications (ICC~'04)}} string{proc-icdcs-06 = {Proceedings of the 26th International Conference on Distributed Computing Systems (ICDCS~'06)}} string{proc-icmus-04 = {Proceedings of the 1th International Conference on Mobile and Ubiquitous Systems: Networking and Services}} string{proc-icnp-05 = {Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP~'05)}} string{proc-ictm-04 = {Proceedings of the 2nd International Conference on Trust Management (iTrust~'04)}} string{proc-icwi-03 = {Proceedings of the IEEE/WIC International Conference on Web Intelligence (WI~'03)}} string{proc-ist-01 = {International Symposium on Telecommunications (IST~'01), Teheran, Iran}} string{proc-infocom-04 = {Proceedings of Infocom~'04}} string{proc-infocom-97 = {Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'97)}} string{proc-infocom-00 = {Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'00)}} string{proc-infocom-01 = {Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'01)}} string{proc-infocom-02 = {Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'02)}} string{proc-infocom-03 = {Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'03)}} string{proc-infocom-04 = {Proceedings of the 23nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'04)}} string{proc-infocom-05 = {Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'05)}} string{proc-infocom-06 = {Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM~'06)}} string{proc-ipps-98-ws = {Parallel and Distributed Processing---10th International IPPS/SPDP~'98 Workshops}} string{proc-ipdps-02 = {16th IEEE International Parallel and Distributed Processing Symposium (IPDPS~~'02)}} string{proc-ipdps-04 = {18th IEEE International Parallel and Distributed Processing Symposium (IPDPS~~'04)}} string{proc-ipdps-05 = {19th IEEE International Parallel and Distributed Processing Symposium (IPDPS~~'05)}} string{proc-ipsn-04 = {Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN~'04)}} string{proc-ipsn-05 = {Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN~'05)}} string{proc-itcom-01 = {Proceedings of SPIE ITcom~'01}} string{proc-kdd-03 = {Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD~'03)}} string{proc-mascots-01 = {Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS~'01)}} string{proc-mass-04 = {Proceedings of the 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS~'04)}} string{proc-mass-05 = {Proceedings of the 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS~'05)}} string{proc-milcom-99 = {Proceedings of the IEEE Military Communications Conference (MILCOM~'99)}} string{proc-mobicom-98 = {Proceedings of the 4th Annual International Conference on Mobile Computing and Networking (MOBICOM~'98)}} string{proc-mobicom-00 = {Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM~'00)}} string{proc-mobicom-03 = {Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MOBICOM~'03)}} string{proc-mobicom-04 = {Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM~'04)}} string{proc-mobihoc-01 = {Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC~'01)}} string{proc-mobihoc-02 = {Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC~'02)}} string{proc-mobihoc-03 = {Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC~'03)}} string{proc-mobihoc-04 = {Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC~'04)}} string{proc-mobihoc-05 = {Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC~'05)}} string{proc-mobihoc-06 = {Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC~'06)}} string{proc-mobisys-05 = {Proceedings of the 3rd International Conference on Mobile Systems, Applications, and Services (MOBISYS~'05)}} string{proc-momaw-03 = {Proceedings of the 1th International Symposium on Modeling and Optimizationin Mobile, Ad Hoc and Wireless Networks (WiOpt~'03)}} string{proc-mswim-05 = {Proceedings of the 8th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems(MSWiM~'06)}} string{proc-nips-02 = {Proceedings of 15th Conference: Neiral Information Processing Systems, Advances in Neural Information Processing Systems}} string{proc-nrdm-01 = {Workshop on Network-Related Data Management (NRDM~'01)}} string{proc-nas-0 = {Proceedings of the National Academy of Sciences}} string{proc-nsdi-05 = {Proceedings of the Second USENIX/ACM Symposium on Networked System Design and Implementation (NSDI~'05)}} string{proc-nsdi-06 = {Proceedings of the Third USENIX/ACM Symposium on Networked System Design and Implementation (NSDI~'06)}} string{proc-osdi-99 = {Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI~'99)}} string{proc-osdi-02 = {Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI~'02)}} string{proc-opodis-04 = {Proceedings of the 8th International Conference on Principles of Distributed Systems (OPODIS~'04)}} string{proc-percom-04 = {Proceedings of the 2nd IEEE Int. Conf. on Pervasive Computing and Communications (PerCom~'04)}} string{proc-scg-01 = {Proceedings of the 17th Annual Symposium on on Computational Geometry (SCG~'01)}} string{proc-seagtc-83 = {Proceedings of the 1st Southeast Asian Graph Theory Colloquium}} string{proc-sensys-03 = {Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SENSYS~'03)}} string{proc-sensys-05 = {Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems (SENSYS~'05)}} string{proc-sicon-97 = {Proceedings of the IEEE Singapore International Conference on Networks (SICON~'97)}} string{proc-sigcomm-92 = {Proceedings of SIGCOMM~'92}} string{proc-sigcomm-99 = {Proceedings of SIGCOMM~'99}} string{proc-sigmetrics-03 = {SIGMETRICS~'03}} string{proc-smlic-95 = {Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing}} string{proc-tag-76 = {Proceedings of Theory and Applications of Graphs}} string{proc-tmfogt-68 = {The Many Facets of Graph Theory, Proc.}} string{proc-usenix-02 = {USENIX Technical Annual Conference~'02}} string{proc-aracne-02 = {Proceedings of the 3rd Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE~'02)}} string{proc-wman-04 = {Proceedings of the 4th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN~'04)}} string{proc-wman-05 = {Proceedings of the 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN~'05)}} string{proc-wpdrts-06 = {14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS)}} string{proc-wscg7-99 = {Proceedings of the 7-th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media~'99 (WSCG~'99)}} string{proc-www7-98 = {Proceedings of the 7th International World Wide Web Conference (WWW7)}} string{proc-www8-99 = {Proceedings of the 8th International World Wide Web Conference (WWW8)}} string{proc-www10-01 = {Proceedings of the 10th International World Wide Web Conference (WWW10)}} string{proc-www12-03 = {Proceedings of the 12th International World Wide Web Conference (WWW12)}} string{proc-rpgd10-02 = {Revised Papers from the 10th International Symposium on Graph Drawing}} string{proc-ijcai-01 = {Proceedings of the 17th international joint conference on artificial intelligence}} string{proc-iwsss-02 = {Proceedings of the Joint IAPR International Workshop on Structural Syntactic, and Statistical Pattern Recognition}} string{journal-abhmsuh = {Abhandlungen aus dem Mathematischen Seminar der Universit{\"a}t Hamburg}} string{journal-ac = {Annals of Combinatorics}} string{journal-acm-ccr = {ACM SIGCOMM Computer Communication Review}} string{journal-acm-csur = {ACM Computing Surveys}} string{journal-acm-tchi = {ACM Transactions on Computer-Human Interaction}} string{journal-acm-tms = {ACM Transactions on Mathematical Software}} string{journal-acm-tois = {ACM Transactions on Information Systems}} string{journal-acs = {Advances in Complex Systems}} string{journal-ahn = {Ad Hoc Networks}} string{journal-ajm = {American Journal of Mathematics}} string{journal-ajs = {American Journal of Sociology}} string{journal-am = {Aequationes Mathematicae}} string{journal-amash = {Acta Mathematica Academiae Scientiarum Hungaricae}} string{journal-amath = {Annals of Mathematics}} string{journal-amm = {American Mathematical Monthly}} string{journal-ams = {The Annals of Mathematical Statistics}} string{journal-aor = {Annals of Operations Research}} string{journal-aocm = {Journal of the Association of Computer Machinery}} string{journal-ap = {Advances in Physics}} string{journal-apc = {Applied Physical Sciences}} string{journal-arch-math = {Archiv der Mathematik}} string{journal-arist = {Annual Review of Information Science and Technology}} string{journal-asa = {Journal of the Acoustical Society of America}} string{journal-asr = {American Sociological Review}} string{journal-bit = {BIT}} string{journal-bjmsp = {British Journal of Mathematical and Statistical Psychology}} string{journal-bmb = {Bulletin of Mathematical Biophysics}} string{journal-bs = {Behavioral Science}} string{journal-bull-ams = {Bulletin of the American Mathematical Society}} string{journal-c = {Connections}} string{journal-c2 = {Journal of Classification}} string{journal-can-math-bull = {Canadian Mathematical Bulletin}} string{journal-ccacaa = {Crotia Chemica ACTA}} string{journal-ccr = {Computer Communication Review}} string{journal-cjm = {Canadian Journal of Mathematics}} string{journal-cjp = {Canadian Journal of Psychology}} string{journal-cm = {IEEE Communications Magazine}} string{journal-cma = {Computers~\& Mathematics with Applications}} string{journal-cmj = {Czechoslovak Mathematical Journal}} string{journal-cmpan = {Colloquium Mathematicum}} string{journal-cmsjb = {Colloquia Mathematica Societatis J{\'a}nos Bolyai}} string{journal-cmuc = {Commentationes Mathematicae Universitatis Carolinae}} string{journal-cn = {Computer Networks: The International Journal of Computer and Telecommunications Networking}} string{journal-cn-isdn = {Computer Networks and ISDN Systems}} string{journal-coa = {Computational Optimization and Applications}} string{journal-comm-acm = {Communications of the ACM}} string{journal-comp = {Journal of Complexity}} string{journal-comput = {Computing}} string{journal-cpc = {Combinatorics, Probability and Computing}} string{journal-css = {Journal of Computer and System Sciences}} string{journal-cwi-qu = {CWI Quarterly}} string{journal-cy = {Cybernetics}} string{journal-dmgt = {Discussiones Mathematicae Graph Theory}} string{journal-dka = {Diskret. Analiz.}} string{journal-distc = {Distributed Computing}} string{journal-dor = {Developments in Operations Research}} string{journal-duke-mj = {Duke Mathematical Journal}} string{journal-fm = {Fundamenta Mathematicae}} string{journal-fin = {The Journal of Finance}} string{journal-geb = {Games and Economic Behavior}} string{journal-e = {Econometrica}} string{journal-ea = {Journal of Experimental Algorithmics}} string{journal-eco = {Economic Journal}} string{journal-ems = {Journal of Economics and Management Strategy}} string{journal-endima = {Electronic Notes in Discrete Mathematics}} string{journal-epjb = {The European Physical Journal~B}} string{journal-et = {Journal of Economic Theory}} string{journal-ho = {Human Organizations}} string{journal-ic = {Information and Control}} string{journal-iijci = {Informatica: An International Journal of Computing and Informatics}} string{journal-ijc = {International Journal of Control}} string{journal-ijm = {Israel Journal of Mathematics}} string{journal-ijrd = {IBM Journal of Research and Development}} string{journal-impc = {International Journal of Modern Physics~C}} string{journal-indmath = {Indagationes Mathematicae}} string{journal-int = {Integration: The VLSI Journal}} string{journal-ipj = {The Internet Protocol Journal}} string{journal-ipm = {Information Processing~\& Management}} string{journal-ir = {Information Retrieval, special issue on Advances in Mathematics/Formal Methods in Information Retrieval}} string{journal-ire-tec = {IRE Transaction on Electronic Computers}} string{journal-ire-trans-it = {IRE Transactions on Information Theory}} string{journal-jacs = {Journal of the American Chemical Society}} string{journal-jasa = {Journal of the American Statistical Association}} string{journal-jc = {Journal of Classification}} string{journal-jcit = {Journal of Computing and Information Technology}} string{journal-jgaa = {Journal of Graph Algorithms and Applications}} string{journal-jgt = {Journal of Graph Theory}} string{journal-jgo = {Journal of Global Optimization}} string{journal-jmp = {Journal of Mathematical Psychology}} string{journal-jms = {Journal of Mathematical Sociology}} string{journal-jpdc = {Journal of Parallel and Distributed Computing}} string{journal-jrsssb = {Journal of the Royal Statistical Society, Series~B}} string{journal-jsac = {IEEE Journal on Selected Areas in Communications}} string{journal-jsbs = {Journal of Social and Biological Structures}} string{journal-jsp = {Journal of Statistical Physics}} string{journal-jtb = {Journal of Theoretical Biology}} string{journal-kcdu = {Knowledge: Creation, Diffusion, Utilization}} string{journal-l = {Language: Journal of the Linguistic Society of America}} string{journal-maa = {Journal of Mathematical Analysis and Applications}} string{journal-math-prog-a = {Mathematical Programming, Series~A}} string{journal-mathann = {Mathematische Annalen}} string{journal-mathematika = {Mathematika}} string{journal-mb = {Mathematica Bohemica}} string{journal-mfl = {Matematikai {\'e}s Fizikai Lapok}} string{journal-ma = {Machine Learning}} string{journal-mmj = {Michigan Mathematical Journal}} string{journal-mpcps = {Mathematical Proceedings of the Cambridge Philosophical Society}} string{journal-ms = {Mathematica Slovaca}} string{journal-msr = {Sociological Methods and Research}} string{journal-mss = {Mathematical Social Sciences}} string{journal-nationalb = {Journal of National Bureau of Standards}} string{journal-nature = {Nature}} string{journal-netnomics = {Netnomics}} string{journal-nummat = {Numerische Mathematik}} string{journal-or = {Operations Research}} string{journal-orl = {Operations Research Letter}} string{journal-patrl = {Pattern Recognition Letters}} string{journal-pc = {IEEE Personal Communications}} string{journal-phre = {Physical Review~E}} string{journal-phrl = {Physical Review Letters}} string{journal-physa = {Physica~A}} string{journal-pieee = {Proceedings IEEE}} string{journal-plms = {Proceedings of the London Mathematical Society}} string{journal-pmd = {Publicationes Mathematicae Debrecen}} string{journal-pnas = {Proceedings of the National Academy of Science of the United States of America}} string{journal-pr-e = {Physical Review E}} string{journal-psy = {Psychometrika}} string{journal-pubc = {Public Choice}} string{journal-qa = {Journal of Quantitative Anthropology}} string{journal-qq = {Quality and Quantity}} string{journal-ram = {Journal der reinen und angewandten Mathematik}} string{journal-rmp = {Reviews of Modern Physics}} string{journal-rsa = {Randoms Structures and Algorithms}} string{journal-sc = {Journal of Symbolic Computation}} string{journal-science = {Science}} string{journal-science-sinica = {Science Sinica}} string{journal-sf = {Social Forces}} string{journal-siam = {Journal of SIAM}} string{journal-sigmobile = {SIGMOBILE Mob. Comput. Commun. Rev.}} string{journal-sijam = {SIAM Journal on Applied Mathematics}} string{journal-sisccomp = {SIAM Journal on Scientific Computing}} string{journal-sjmaa = {SIAM Journal on Matrix Analysis and Applications}} string{journal-sm = {Sociological Methodology}} string{journal-smr = {Sociological Methods and Research}} string{journal-sn = {Social Networks}} string{journal-socm = {Sociometry}} string{journal-sov-math-dokl = {Soviet Mathematics-Doklady}} string{journal-spe = {Software - Practice and Experience}} string{journal-sr = {SIAM Review}} string{journal-ss = {Journal of Social Structure}} string{journal-ssr = {Sociology and Social Research}} string{journal-ssre = {Social Science Research}} string{journal-tams = {Transactions of the American Mathematical Society}} string{journal-tc = {IEEE Transactions on Computers}} string{journal-tcm = {IEEE Transactions on Communications}} string{journal-tct = {IEEE Transactions on Circuit Theory}} string{journal-tinfth = {IEEE Transactions on Information Theory}} string{journal-tit = {ACM Transactions on Internet Technology}} string{journal-tkde = {IEEE Transactions on Knowledge and Data Engineering}} string{journal-toc = {IEEE Transaction on Communications}} string{journal-tomc = {IEEE Transaction on Mobile Computing}} string{journal-ton = {IEEE/ACM Transactions on Networking}} string{journal-tpami = {IEEE Transactions on Pattern Analysis and Machine Intelligence}} string{journal-tpds = {IEEE Transactions on Parallel and Distributed Systems}} string{journal-tpls = {IEEE Transactions on Programming Languages and Systems}} string{journal-tr = {IEEE Transactions on Reliability}} string{journal-tr-ec = {IEEE Transactions on Electronic Computers}} string{journal-tsq = {The Sociological Quarterly}} string{journal-tvcg = {IEEE Transactions on Visualization and Computer Graphics}} string{journal-wcmc = {Wireless Communications and Mobile Computing}} string{journal-wn = {Wireless Networks}} string{publisher-ap = {Academic Press}} string{publisher-apraha = {Academia Praha}} string{publisher-birk = {Birkh{\"a}user Verlag}} string{publisher-bsp = {Booksurge Publishing}} string{publisher-bbk = {Basic Books}} string{publisher-crc = {CRC Press}} string{publisher-csp = {Computer Science Press}} string{publisher-cw = {Cohen~\& West LTD}} string{publisher-dp = {Duxbury Press}} string{publisher-gb = {Gordon and Breach}} string{publisher-gmup = {George Mason University Press}} string{publisher-jab = {Johann Ambrosius Barth Verlag}} string{publisher-jb = {Jossey Bass}} string{publisher-lb = {Leske und Budrich}} string{publisher-longman = {Longman Scientific and Technical}} string{publisher-maa = {Mathematical Association of America}} string{publisher-macmillan = {Macmillan}} string{publisher-mc = {Mathematisch Centrum}} string{publisher-mohr = {J.~C.~B.~Mohr}} string{publisher-nauka = {Nauka}} string{publisher-norton = {W.~W.~Norton~\& Company}} string{publisher-perseus = {Perseus Publishing}} string{publisher-sage = {Sage}} string{publisher-tjhup = {John Hopkins University Press}} string{publisher-utp = {University of Toronto Press}} string{publisher-wiley-vch = {Wiley-VCH}} string{publisher-wieee = {Wiley-IEEE Press}} string{series-ams-cbms = {CBMS Regional Conference Series in Mathematics}} string{series-ann-math-stud = {Annals of Mathematics Studies}} string{series-ch-tiss = {Chapman~\& Hall Texts in Statistical Science}} string{series-ima = {The IMA Volumes in Mathematics and its Applications}} string{series-lms-lns = {London Mathematical Society Lecture Note Series}} string{series-mct = {Mathematical Centre Tracts}} string{series-msap = {Monographs on Statistics and Applied Probability}} string{series-springer-gtm = {Graduate Texts in Mathematics}} string{series-springer-lnm = {Lecture Notes in Mathematics}} string{series-springer-lnp = {Lecture Notes in Physics}} string{series-springer-mcs = {Monographs in Computer Science}} string{series-springer-stis = {Springer Texts in Statistics}} string{series-utp-me = {Mathematical Expositions}}