_id,doi,title
535,10.1007/s00453-013-9843-7,Polynomial-time algorithms for energy games with special weight structures
537,10.1002/ece3.1150,Fitness consequences of maternal and grandmaternal effects
5411,10.15479/AT:IST-2014-148-v2-1,Compositional specifications for IOCO testing
5412,10.15479/AT:IST-2014-153-v1-1,CEGAR for qualitative analysis of probabilistic systems
5413,10.15479/AT:IST-2014-153-v2-2,CEGAR for qualitative analysis of probabilistic systems
5414,10.15479/AT:IST-2014-153-v3-1,CEGAR for qualitative analysis of probabilistic systems
5415,10.15479/AT:IST-2014-170-v1-1,Nested weighted automata
5416,10.15479/AT:IST-2014-171-v1-1,Model measuring for hybrid systems
5417,10.15479/AT:IST-2014-172-v1-1,From model checking to model measuring
5418,10.15479/AT:IST-2014-176-v1-1,Games with a weak adversary
5419,10.15479/AT:IST-2014-187-v1-1,Improved algorithms for reachability and shortest path on low tree-width graphs
5420,10.15479/AT:IST-2014-191-v1-1,The value 1 problem for concurrent mean-payoff games
5421,10.15479/AT:IST-2014-190-v2-2,The complexity of evolution on graphs
5422,,"Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland"
5423,10.15479/AT:IST-2014-300-v1-1,A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
5424,10.15479/AT:IST-2014-305-v1-1,Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
5425,,Optimal cost almost-sure reachability in POMDPs
5426,10.15479/AT:IST-2014-305-v2-1,Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
5427,10.15479/AT:IST-2014-314-v1-1,Optimal tree-decomposition balancing and reachability on low treewidth graphs
5428,10.15479/AT:IST-2014-315-v1-1,Quantitative fair simulation games