Mathematical foundations of computer science 2012 : (Record no. 641993)

MARC details
000 -LEADER
fixed length control field 14770cam a2201081 a 4500
001 - CONTROL NUMBER
control field ocn806059092
003 - CONTROL NUMBER IDENTIFIER
control field OCoLC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250703161757.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr cnu---unuuu
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120814s2012 gw a ob 101 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency GW5XE
Language of cataloging eng
Description conventions pn
Transcribing agency GW5XE
Modifying agency C$Q
-- ZMC
-- COO
-- UKMGB
-- ZMC
-- OCLCQ
-- E7B
-- OCLCF
-- BEDGE
-- OCLCO
-- YDXCP
-- OCL
-- OCLCO
-- OCLCQ
-- EBLCP
-- OCLCQ
-- VGM
-- ESU
-- OCLCQ
-- IOG
-- NJR
-- BUF
-- REB
-- VMW
-- COS
-- COF
-- CEF
-- U3W
-- WYU
-- UWO
-- YOU
-- TKN
-- LEAUB
-- W2U
-- OCLCQ
-- AJS
-- OCLCQ
-- OCLCO
-- UKAHL
-- OCLCO
-- OCLCQ
-- DCT
-- DKDLA
-- OCLCO
-- OCLCQ
066 ## - CHARACTER SETS PRESENT
Alternate G0 or G1 character set (S
016 7# - NATIONAL BIBLIOGRAPHIC AGENCY CONTROL NUMBER
Record control number 016169308
Source Uk
019 ## -
-- 1154946315
-- 1204014934
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642325892
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 3642325890
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9783642325885
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 3642325882
Qualifying information (Trade Paper)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 3642325882
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642325885
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-32589-2
Source of number or code doi
024 3# - OTHER STANDARD IDENTIFIER
Standard number or code 9783642325885
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000050021889
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000058160302
029 1# - (OCLC)
OCLC library identifier NLGGC
System control number 384331033
029 1# - (OCLC)
OCLC library identifier NZ1
System control number 14675919
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000060505354
029 1# - (OCLC)
OCLC library identifier DKDLA
System control number 820120-katalog:999910454905765
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)806059092
Canceled/invalid control number (OCoLC)1154946315
-- (OCoLC)1204014934
037 ## - SOURCE OF ACQUISITION
Stock number 9783642325885
Source of stock number/acquisition 00024965
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.M35
Item number S96 2012
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.01/51
Edition number 23
049 ## - LOCAL HOLDINGS (OCLC)
Holding library MAIN
111 2# - MAIN ENTRY--MEETING NAME
Meeting name or jurisdiction name as entry element Symposium on Mathematical Foundations of Computer Science (1972- )
Number of part/section/meeting (37th :
Date of meeting 2012 :
Location of meeting Bratislava, Slovakia)
9 (RLIN) 46152
245 10 - TITLE STATEMENT
Title Mathematical foundations of computer science 2012 :
Remainder of title 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings /
Statement of responsibility, etc. Branislav Rovan, Vladimiro Sassone, Peter Widmayer (eds.).
246 30 - VARYING FORM OF TITLE
Title proper/short title MFCS 2012
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. Berlin ;
-- New York :
Name of publisher, distributor, etc. Springer,
Date of publication, distribution, etc. ©2012.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (xv, 838 pages) :
Other physical details illustrations
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Lecture notes in computer science,
International Standard Serial Number 1611-3349 ;
Volume/sequential designation 7464.
Series statement Advanced research in computing and software science
490 1# - SERIES STATEMENT
Series statement LNCS sublibrary. SL 1, Theoretical computer science and general issues
505 00 - FORMATTED CONTENTS NOTE
Title On the Complexity of Ontological Reasoning under Disjunctive Existential Rules /
Statement of responsibility Georg Gottlob, Marco Manna, Michael Morak and Andreas Pieris --
Title New Races in Parameterized Algorithmics /
Statement of responsibility Christian Komusiewicz and Rolf Niedermeier --
Title Scott Is Always Simple /
Statement of responsibility Antonino Salibra --
Title A Toolkit for Proving Limitations of the Expressive Power of Logics /
Statement of responsibility Nicole Schweikardt --
Title How to Reconstruct a Genome /
Statement of responsibility Esko Ukkonen --
Title Simple Models for Recursive Schemes /
Statement of responsibility Igor Walukiewicz --
Title Transportation under Nasty Side Constraints /
Statement of responsibility Gerhard J. Woeginger --
Title Computation of Least Fixed Points /
Statement of responsibility Mihalis Yannakakis --
Title Unordered Constraint Satisfaction Games /
Statement of responsibility Lauri Ahlroth and Pekka Orponen --
Title A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree /
Statement of responsibility Tatsuya Akutsu and Takeyuki Tamura --
Title Reductions to the Set of Random Strings: The Resource-Bounded Case /
Statement of responsibility Eric Allender, Harry Buhrman, Luke Friedman and Bruno Loff --
Title Approximate Graph Isomorphism /
Statement of responsibility Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert and Yadu Vasudev --
Title Near-Optimal Expanding Generator Sets for Solvable Permutation Groups /
Statement of responsibility Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar and Yadu Vasudev --
Title Generating Functions of Timed Languages /
Statement of responsibility Eugene Asarin, Nicolas Basset, Aldric Degorre and Dominique Perrin --
Title The Robust Set Problem: Parameterized Complexity and Approximation /
Statement of responsibility Cristina Bazgan and Morgan Chopin --
Title Mortality for 2 x 2 Matrices Is NP-Hard /
Statement of responsibility Paul C. Bell, Mika Hirvensalo and Igor Potapov --
Title Solving Counter Parity Games /
Statement of responsibility Dietmar Berwanger, Łukasz Kaiser and Simon Lessenich --
Title Drawing Planar Graphs on Points Inside a Polygon /
Statement of responsibility Therese Biedl and Peter Floderus --
Title New Advances in Reoptimizing the Minimum Steiner Tree Problem /
Statement of responsibility Davide Bilò and Anna Zych --
Title Smoothed Complexity Theory /
Statement of responsibility Markus Bläser and Bodo Manthey --
Title Abelian Pattern Avoidance in Partial Words /
Statement of responsibility Francine Blanchet-Sadri and Sean Simmons --
Title The Complexity of Rerouting Shortest Paths /
Statement of responsibility Paul Bonsma --
Title Computing with Large Populations Using Interactions /
Statement of responsibility Olivier Bournez, Pierre Fraigniaud and Xavier Koegler --
Title Pancake Flipping Is Hard /
Statement of responsibility Laurent Bulteau, Guillaume Fertin and Irena Rusu --
Title In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses /
Statement of responsibility Jingsen Chen, Stefan Edelkamp, Amr Elmasry and Jyrki Katajainen --
Title Model Checking Stochastic Branching Processes /
Statement of responsibility Taolue Chen, Klaus Dräger and Stefan Kiefer.
505 80 - FORMATTED CONTENTS NOTE
Title Parameterized Study of the Test Cover Problem /
Statement of responsibility Robert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh and Anders Yeo --
Title Sitting Closer to Friends Than Enemies, Revisited /
Statement of responsibility Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk --
Title A Dichotomy Theorem for Homomorphism Polynomials /
Statement of responsibility Nicolas de Rugy-Altherre --
Title Finite State Transducers for Modular Möbius Number Systems /
Statement of responsibility Martin Delacourt and Petr Kůrka --
Title Zero-Knowledge Proofs via Polynomial Representations /
Statement of responsibility Giovanni Di Crescenzo and Vadym Fedyukovych --
Title Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width /
Statement of responsibility Martin Doucha and Jan Kratochvíl --
Title On the Impact of Fair Best Response Dynamics /
Statement of responsibility Angelo Fanelli, Luca Moscardelli and Alexander Skopalik --
Title Fast Balanced Partitioning Is Hard Even on Grids and Trees /
Statement of responsibility Andreas Emil Feldmann --
Title A Characterization of Bispecial Sturmian Words /
Statement of responsibility Gabriele Fici --
Title Online Sum-Radii Clustering /
Statement of responsibility Dimitris Fotakis and Paraschos Koutris --
Title Observe and Remain Silent (Communication-Less Agent Location Discovery) /
Statement of responsibility Tom Friedetzky, Leszek Gąsieniec, Thomas Gorry and Russell Martin --
Title When Trees Grow Low: Shrubs and Fast MSO1 /
Statement of responsibility Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek and Patrice Ossona de Mendez, et al. --
Title Strategy Machines and Their Complexity /
Statement of responsibility Marcus Gelderie --
Title Coloring Graphs Characterized by a Forbidden Subgraph /
Statement of responsibility Petr A. Golovach, Daniël Paulusma and Bernard Ries --
Title Obtaining Planarity by Contracting Few Edges /
Statement of responsibility Petr A. Golovach, Pim van 't Hof and Daniël Paulusma --
Title Light Spanners in Bounded Pathwidth Graphs /
Statement of responsibility Michelangelo Grigni and Hao-Hsiang Hung --
Title Planarizing Gadgets for Perfect Matching Do Not Exist /
Statement of responsibility Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub and Thomas Thierauf --
Title Kernels for Edge Dominating Set: Simpler or Smaller /
Statement of responsibility Torben Hagerup --
Title Categories of Coalgebraic Games /
Statement of responsibility Furio Honsell, Marina Lenisa and Rekha Redamalla --
Title Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles /
Miscellaneous information (Extended Abstract) /
Statement of responsibility David Janin --
Title An Improved Approximation Scheme for Variable-Sized Bin Packing /
Statement of responsibility Klaus Jansen and Stefan Kraft --
Title Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection /
Statement of responsibility Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita and Sébastien Tixeuil --
Title Reversal Hierarchies for Small 2DFAs /
Statement of responsibility Christos A. Kapoutsis and Giovanni Pighizzini.
505 80 - FORMATTED CONTENTS NOTE
Title Strictness of the Collapsible Pushdown Hierarchy /
Statement of responsibility Alexander Kartzow and Paweł Parys --
Title Computational Complexity of Smooth Differential Equations /
Statement of responsibility Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick and Martin Ziegler --
Title The Lower Reaches of Circuit Uniformity /
Statement of responsibility Christoph Behle, Andreas Krebs, Klaus-Jörn Lange and Pierre McKenzie --
Title The Join Levels of the Trotter-Weil Hierarchy Are Decidable /
Statement of responsibility Manfred Kufleitner and Alexander Lauser --
Title Equations X+A=B and (X+X)+C=(X -- X)+D over Sets of Natural Numbers /
Statement of responsibility Tommi Lehtinen --
Title Weakly-Synchronized Ground Tree Rewriting (with Applications to Verifying Multithreaded Programs) /
Statement of responsibility Anthony Widjaja Lin --
Title Descriptional Complexity of Deterministic Regular Expressions /
Statement of responsibility Katja Losemann, Wim Martens and Matthias Niewerth --
Title Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs /
Statement of responsibility Meena Mahajan, B.V. Raghavendra Rao and Karteek Sreenivasaiah --
Title Fine and Wilf's Theorem and Pseudo-repetitions /
Statement of responsibility Florin Manea, Robert Mercaş and Dirk Nowotka --
Title Taking It to the Limit: Approximate Reasoning for Markov Processes /
Statement of responsibility Kim Guldstrand Larsen, Radu Mardare and Prakash Panangaden --
Title Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games /
Statement of responsibility Matúš Mihalák and Jan Christoph Schlegel --
Title Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? /
Statement of responsibility Filip Murlak, Michał Ogiński and Marcin Przybyłko --
Title Reducing a Target Interval to a Few Exact Queries /
Statement of responsibility Jesper Nederlof, Erik Jan van Leeuwen and Ruben van der Zwaan --
Title Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs /
Statement of responsibility Sotiris Nikoletseas, Christoforos Raptopoulos and Paul G. Spirakis --
Title A Finite Basis for 'Almost Future' Temporal Logic over the Reals /
Statement of responsibility Dorit Pardo (Ordentlich) and Alexander Rabinovich --
Title Constructing Premaximal Ternary Square-Free Words of Any Level /
Statement of responsibility Elena A. Petrova and Arseny M. Shur --
Title Regularity Problems for Weak Pushdown [omega]-Automata and Games /
Statement of responsibility Christof Löding and Stefan Repke --
Title Computational Aspects of Cellular Automata on Countable Sofic Shifts /
Statement of responsibility Ville Salo and Ilkka Törmä --
Title Computing Lempel-Ziv Factorization Online /
Statement of responsibility Tatiana Starikovskaya --
Title On Two Stronger Versions of Dejean's Conjecture /
Statement of responsibility Igor N. Tunev and Arseny M. Shur --
Title Probabilistic Automata and Probabilistic Logic /
Statement of responsibility Thomas Weidner --
Title A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments /
Statement of responsibility Mingyu Xiao and Jiong Guo.
500 ## - GENERAL NOTE
General note International conference proceedings.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and author index.
588 0# - SOURCE OF DESCRIPTION NOTE
Source of description note Online resource; title from PDF title page (SpringerLink, viewed August 27, 2012).
520 ## - SUMMARY, ETC.
Summary, etc. This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics
Form subdivision Congresses.
9 (RLIN) 15039
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer programming
Form subdivision Congresses.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer algorithms
Form subdivision Congresses.
9 (RLIN) 14835
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Informatique
General subdivision Mathématiques
Form subdivision Congrès.
9 (RLIN) 20905
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programmation (Informatique)
Form subdivision Congrès.
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithmes
Form subdivision Congrès.
9 (RLIN) 17080
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logiciels.
9 (RLIN) 26065
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Informatique.
9 (RLIN) 14930
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element software.
Source of heading or term aat
9 (RLIN) 16724
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element computer science.
Source of heading or term aat
9 (RLIN) 941
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element data processing.
Source of heading or term aat
9 (RLIN) 14620
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Informatique.
Source of heading or term eclas
9 (RLIN) 14930
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer algorithms
Source of heading or term fast
9 (RLIN) 896
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer programming
Source of heading or term fast
9 (RLIN) 3021
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics
Source of heading or term fast
9 (RLIN) 2386
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Computer science.
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Data structures (Computer science)
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Computational complexity.
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Algorithm Analysis and Problem Complexity.
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Discrete Mathematics in Computer Science.
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Numeric Computing.
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Mathematical Logic and Formal Languages.
653 #4 - INDEX TERM--UNCONTROLLED
Uncontrolled term Math Applications in Computer Science.
655 #7 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Conference papers and proceedings
Source of term fast
9 (RLIN) 6065
655 #7 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Software.
Source of term lcgft
9 (RLIN) 98343
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rovan, B.
Fuller form of name (Branislav)
9 (RLIN) 41045
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sassone, Vladimiro.
9 (RLIN) 26551
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Widmayer, Peter.
9 (RLIN) 38741
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642325885
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture notes in computer science ;
Volume number/sequential designation 7464.
International Standard Serial Number 1611-3349
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture notes in computer science.
Name of part/section of a work Advanced research in computing and software science.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title LNCS sublibrary.
Number of part/section of a work SL 1,
Name of part/section of a work Theoretical computer science and general issues.
9 (RLIN) 20736
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://link.springer.com/10.1007/978-3-642-32589-2">https://link.springer.com/10.1007/978-3-642-32589-2</a>
880 0# - ALTERNATE GRAPHIC REPRESENTATION
Linkage 505-00/(S
a On the Complexity of Ontological Reasoning under Disjunctive -- Existential Rules -- New Races in Parameterized Algorithmics -- Scott Is Always Simple -- Simple Models for Recursive Schemes -- Unordered Constraint Satisfaction Games -- A Polynomial-Time Algorithm for Computing the Maximum Common -- Subgraph of Outerplanar Graphs of Bounded Degree -- Reductions to the Set of Random Strings: The Resource-Bounded Case -- Approximate Graph Isomorphism -- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups -- Generating Functions of Timed Languages -- The Robust Set Problem: Parameterized Complexity and Approximation -- Mortality for 2 x 2 Matrices Is NP-Hard -- Solving Counter Parity Games -- Drawing Planar Graphs on Points Inside a Polygon -- Smoothed Complexity Theory -- Abelian Pattern Avoidance in Partial Words -- The Complexity of Rerouting Shortest Paths -- Computing with Large Populations Using Interactions -- Pancake Flipping Is Hard -- In-place Heap Construction with Optimized Comparisons, Moves, and Cache -- A Dichotomy Theorem for Homomorphism -- On the Impact of Fair Best Response Dynamics -- When Trees Grow Low: Shrubs and Fast MSO1 -- Obtaining Planarity by Contracting Few Kernels for Edge Dominating Set -- Quasi-recognizable vs MSO Definable Languages of One-Dimensional -- Reversal Hierarchies for Small -- The Lower Reaches of Circuit Weakly-Synchronized Ground Tree Rewriting -- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs -- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games -- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection -- Regularity Problems for Weak Pushdown ω-Automata and Games -- Computational Aspects of Cellular Automata on Countable Sofic Shifts -- On Two Stronger Versions of Dejean's Conjecture -- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.
938 ## -
-- Askews and Holts Library Services
-- ASKH
-- AH29654854
938 ## -
-- ProQuest Ebook Central
-- EBLB
-- EBL3069940
938 ## -
-- ebrary
-- EBRY
-- ebr10651278
938 ## -
-- YBP Library Services
-- YANK
-- 9639166
994 ## -
-- 92
-- ATIST
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Home library Current library Date acquired Total Checkouts Date last seen Price effective from Koha item type
  Not Lost     eBook LNCS e-Library e-Library 28/07/2022   28/07/2022 28/07/2022 eBook

Powered by Koha