Name
Affiliation
Papers
VÉRONIQUE BRUYÈRE
University of Mons-Hainaut, 6, Avenue du Champ de Mars, B-7000 Mons, Belgium
78
Collaborators
Citations 
PageRank 
54
429
43.59
Referers 
Referees 
References 
508
629
587
Search Limit
100629
Title
Citations
PageRank
Year
On relevant equilibria in reachability games00.342021
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives00.342021
Synthesis of equilibria in infinite-duration: games on graphs00.342021
The Complexity Of Subgame Perfect Equilibria In Quantitative Reachability Games00.342020
Energy Mean-Payoff Games.00.342019
On Relevant Equilibria in Reachability Games.00.342019
Partial Solvers for Generalized Parity Games.00.342019
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version).00.342019
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.00.342019
Parameterized complexity of games with monotonically ordered omega-regular objectives.00.342018
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives.00.342018
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives.00.342018
Computer aided synthesis: a game theoretic approach.00.342017
Games with lexicographically ordered $ω$-regular objectives.00.342017
On the existence of weak subgame perfect equilibria.00.342017
On the Complexity of Heterogeneous Multidimensional Games.00.342016
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version).00.342016
Window Parity Games: An Alternative Approach Toward Parity Games With Time Bounds20.382016
Weak subgame perfect equilibria and their application to quantitative reachability30.432015
On the complexity of heterogeneous multidimensional quantitative games.00.342015
Secure equilibria in weighted games90.722014
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.90.512014
Expectations Or Guarantees? I Want It All! A Crossroad Between Games And Mdps40.442014
Reasoning on BGP routing filters using tree automata.00.342014
D Symblicit Algorithms For Optimal Strategy Synthesis In Monotonicmarkov Decision Processes30.392014
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.10.362014
Visibly Pushdown Automata: Universality and Inclusion via Antichains.30.432013
Synthesis from LTL specifications with mean-payoff objectives150.572013
On Subgame Perfection in Quantitative Reachability Games30.392012
Visibly pushdown automata on trees: universality and u-universality00.342012
On Equilibria in Quantitative Games with Reachability/Safety Objectives30.402012
An aperiodicity problem for multiwords.00.342012
Acacia+, a tool for LTL synthesis551.902012
Trees with Given Stability Number and Minimum Number of Stable Sets10.372012
Subgame perfection for equilibria in quantitative reachability games10.402012
Antichain-based QBF solving10.352011
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases00.342010
Equilibria in quantitative reachability games100.662010
Fibonacci index and stability number of graphs: a polyhedral study00.342009
On the size of Boyer-Moore automata10.352009
Tree Automata and Automata on Linear Orderings40.562009
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases20.412008
Durations and parametric model-checking in timed automata80.502008
Turán Graphs, Stability Number, and Fibonacci Index00.342008
Automata on linear orderings332.362007
Real-Time Model-Checking: Parameters everywhere260.922007
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique00.342007
On the optimal reachability problem of weighted timed automata401.372007
On model-checking timed automata with stopwatch observers90.552006
Words derivated from Sturmian words30.492005
  • 1
  • 2